12. ICALP 1985:
Nafplion, Greece
Wilfried Brauer (Ed.):
Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece, July 15-19, 1985, Proceedings.
Lecture Notes in Computer Science 194 Springer 1985, ISBN 3-540-15650-X BibTeX
@proceedings{DBLP:conf/icalp/1985,
editor = {Wilfried Brauer},
title = {Automata, Languages and Programming, 12th Colloquium, Nafplion,
Greece, July 15-19, 1985, Proceedings},
booktitle = {ICALP},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {194},
year = {1985},
isbn = {3-540-15650-X},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- László Lovász:
Vertex Packing Algorithms.
1-14 BibTeX
- Amir Pnueli:
Linear and Branching Structures in the Semantics and Logics of Reactive Systems.
15-32 BibTeX
- Danièle Beauquier, Maurice Nivat:
About Rational Sets of Factors of a Bi-Infinite Word.
33-42 BibTeX
- Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest:
A Fair Protocol for Signing Contracts (Extended Abstract).
43-52 BibTeX
- Gianfranco Bilardi, Franco P. Preparata:
The Influence of Key Length on the Area-Time Complexity of Sorting.
53-62 BibTeX
- Luc Bougé:
Repeated Synchronous Snapshots and Their Implementation in CSP (Extended Abstract).
63-70 BibTeX
- Walter Bucher, Andrzej Ehrenfeucht, David Haussler:
On Total Regulators Generated by Derivation Relations.
71-79 BibTeX
- Bernard Chazelle, Herbert Edelsbrunner:
Optimal Solutions for a Class of Point Retrieval Problems.
80-89 BibTeX
- Bernard Chazelle, Leonidas J. Guibas:
Fractional Cascading: A Data Structuring Technique with Geometric Applications.
90-100 BibTeX
- Marek Chrobak:
Hierarchies of One-Way Multihead Automata Languages.
101-110 BibTeX
- Richard Cole:
Partitioning Point Sets in 4 Dimensions.
111-119 BibTeX
- Mario Coppo:
A Completeness Theorem for Recursively Defined Types.
120-129 BibTeX
- Pierre-Louis Curien:
Categorial Combinatory Logic.
130-139 BibTeX
- J. W. de Bakker, Joost N. Kok:
Towards a Uniform Topological Treatment of Streams and Functions on Streams.
140-148 BibTeX
- J. W. de Bakker, John-Jules Ch. Meyer, Ernst-Rüdiger Olderog:
Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency.
149-157 BibTeX
- Paul De Bra:
Imposed-Functional Dependencies Inducing Horizontal Decompositions.
158-170 BibTeX
- Joost Engelfriet, Heiko Vogler:
Characterization of High Level Tree Transducers.
171-178 BibTeX
- Philippe Flajolet:
Ambiguity and Transcendence.
179-188 BibTeX
- Steven Fortune:
A Fast Algorithm for Polygon Containment by Translation (Extended Abstract).
189-198 BibTeX
- Martin Fürer:
Deterministic and Las Vegas Primality Testing Algorithms.
199-209 BibTeX
- Harold N. Gabow, Matthias F. M. Stallmann:
Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract).
210-220 BibTeX
- Joseph A. Goguen, Jean-Pierre Jouannaud, José Meseguer:
Operational Semantics for Order-Sorted Algebra.
221-231 BibTeX
- Carl A. Gunter:
A Universal Domain Technique for Profinite Posets.
232-243 BibTeX
- Georges Hansel:
A Simple Proof of the Skolem-Mahler-Lech Theorem.
244-249 BibTeX
- Juris Hartmanis, Neil Immerman:
On Complete Problems for NP$\cap$CoNP.
250-259 BibTeX
- Matthew Hennessy:
An Algebraic Theory of Fair Asynchronous Communicating Processes.
260-269 BibTeX
- Maria Teresa Hortalá-González, Mario Rodríguez-Artalejo:
Hoare's Logic for Nondeterministic Regular Programs: A Nonstandard Completeness Theorem.
270-280 BibTeX
- Karel Hrbacek:
Powerdomains as Algebraic Lattices (Preliminary Report).
281-289 BibTeX
- Mark Jerrum:
Random Generation of Combinatorial Structures from a Uniform Distribution (Extended Abstract).
290-299 BibTeX
- J. Howard Johnson:
Do Rational Equivalence Relations have Regular Cross-Sections?
300-309 BibTeX
- Hermann Jung:
On Probabilistic Time and Space.
310-317 BibTeX
- Rolf G. Karlsson, J. Ian Munro, Edward L. Robertson:
The Nearest Neighbor Problem on Bounded Domains.
318-327 BibTeX
- Michael Kaufmann, Kurt Mehlhorn:
Routing Through a Generalized Switchbox.
328-337 BibTeX
- Veikko Keränen:
On k-Repetition Free Words Generated by Length Uniform Morphisms Over a Binary Alphabet.
338-347 BibTeX
- Juha Kortelainen:
Every Commutative Quasirational Language is Regular.
348-355 BibTeX
- Thomas G. Kurtz, Udi Manber:
A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (Preliminary Version).
356-362 BibTeX
- Gad M. Landau, Mordechai M. Yung, Zvi Galil:
Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract).
363-372 BibTeX
- Kim Guldstrand Larsen:
A Context Dependent Equivalence between Processes.
373-382 BibTeX
- Ming Li:
Lower Bounds by Kolmogorov-Complexity (Extended Abstract).
383-393 BibTeX
- Michael Luby, Prabhakar Ragde:
A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version).
394-403 BibTeX
- Michael G. Main, Walter Bucher, David Haussler:
Applications of an Infinite Squarefree CO-CFL.
404-412 BibTeX
- Zohar Manna, Richard J. Waldinger:
Special Relations in Automated Deduction.
413-423 BibTeX
- Kurt Mehlhorn, Athanasios K. Tsakalidis:
Dynamic Interpolation Search.
424-434 BibTeX
- Pekka Orponen, David A. Russo, Uwe Schöning:
Polynomial Levelability and Maximal Complexity Cores.
435-444 BibTeX
- Jean-Eric Pin:
Finite Group Topology and p-Adic Topology for Free Monoids.
445-455 BibTeX
- Seppo Sippu, Eljas Soisalon-Soininen:
On the Use of Relational Expressions in the Design of Efficient Algorithms (Extended Abstract).
456-464 BibTeX
- A. Prasad Sistla, Moshe Y. Vardi, Pierre Wolper:
The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract).
465-474 BibTeX
- Colin Stirling:
A Complete Compositional Model Proof System for a Subset of CCS.
475-486 BibTeX
- Peter J. Varman, I. V. Ramakrishnan:
On Matrix Multiplication Using Array Processors.
487-496 BibTeX
- Uzi Vishkin:
Optimal Parallel Pattern Matching in Strings (Extended Summary).
497-508 BibTeX
- Job Zwiers, Willem P. de Roever, Peter van Emde Boas:
Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem.
509-519 BibTeX
Copyright © Sat May 16 23:16:04 2009
by Michael Ley (ley@uni-trier.de)
