14. ICALP 1987:
Karlsruhe,
Germany
Thomas Ottmann (Ed.):
Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings.
Lecture Notes in Computer Science 267 Springer 1987, ISBN 3-540-18088-5 BibTeX
@proceedings{DBLP:conf/icalp/1987,
editor = {Thomas Ottmann},
title = {Automata, Languages and Programming, 14th International Colloquium,
ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings},
booktitle = {ICALP},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {267},
year = {1987},
isbn = {3-540-18088-5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Inductive Inference,
Logic and Functional Programming
Rewrite Systems
Semantics, Concurrency
Formal Languages and Automata
Temporal Logic, Concurrent Systems
Parallel and Distributed Computing
- Torben Hagerup, Marek Chrobak, Krzysztof Diks:
Parallel 5-Colouring of Planar Graphs.
304-313 BibTeX
- Gad M. Landau, Baruch Schieber, Uzi Vishkin:
Parallel Construction of a Suffix Tree (Extended Abstract).
314-325 BibTeX
- Ming Li, Yaacov Yesha:
The Probabilistic and Deterministic Parallel Complexity of Symmetric Functions.
326-335 BibTeX
- R. Ramesh, Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan:
Term Matching on Parallel Computers.
336-346 BibTeX
- Jan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks:
Guessing Games and Distributed Computations in Synchronous Networks.
347-356 BibTeX
Algorithms and Complexity
- Jacob T. Schwartz, Micha Sharir:
On the Bivariate Function Minimization Problem And Its Applications to Motion Planning.
357-363 BibTeX
- Herbert Edelsbrunner, Günter Rote, Emo Welzl:
Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.
364-375 BibTeX
- Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack:
Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract).
376-385 BibTeX
- Azaria Paz, Claus-Peter Schnorr:
Approximating Integer Lattices by Lattices with Cyclic Factor Groups.
386-393 BibTeX
- Jin-yi Cai, Gabriele E. Meyer:
On the Complexity of Graph Critical Uncolorability.
394-403 BibTeX
- Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo:
Posets, Boolean Representations and Quick Path Searching.
404-424 BibTeX
- Satoru Miyano:
The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC Algorithms.
425-434 BibTeX
- Norbert Th. Müller:
Uniform Computational Complexity of Taylor Series.
435-444 BibTeX
- Alberto Marchetti-Spaccamela, Carlo Vercellis:
Efficient On-Line Algorithms for the Knapsack Problem (Extended Abstract).
445-456 BibTeX
- Martin Dietzfelbinger:
Lower Bounds for Sorting of Sums.
457-466 BibTeX
- Alok Aggarwal, Jeffrey Scott Vitter:
The I/O Complexity of Sorting and Related Problems (Extended Abstract).
467-478 BibTeX
- Kurt Mehlhorn, Stefan Näher, Helmut Alt:
A Lower Bound for the Complexity of the Union-Split-Find Problem.
479-488 BibTeX
- Athanasios K. Tsakalidis:
The Nearest Common Ancestor in a Dynamic Tree.
489-498 BibTeX
Petri Nets, Algebraic Specification
Complexity
Invited Lecture
Copyright © Sat May 16 23:16:05 2009
by Michael Ley (ley@uni-trier.de)
