default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th ICALP 1985: Nafplion, Greece
- Wilfried Brauer:
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 - László Lovász:
Vertex Packing Algorithms. 1-14 - Amir Pnueli:
Linear and Branching Structures in the Semantics and Logics of Reactive Systems. 15-32 - Danièle Beauquier, Maurice Nivat:
About Rational Sets of Factors of a Bi-Infinite Word. 33-42 - Michael Ben-Or
, Oded Goldreich, Silvio Micali, Ronald L. Rivest:
A Fair Protocol for Signing Contracts (Extended Abstract). 43-52 - Gianfranco Bilardi, Franco P. Preparata:
The Influence of Key Length on the Area-Time Complexity of Sorting. 53-62 - Luc Bougé:
Repeated Synchronous Snapshots and Their Implementation in CSP (Extended Abstract). 63-70 - Walter Bucher, Andrzej Ehrenfeucht, David Haussler:
On Total Regulators Generated by Derivation Relations. 71-79 - Bernard Chazelle, Herbert Edelsbrunner:
Optimal Solutions for a Class of Point Retrieval Problems. 80-89 - Bernard Chazelle, Leonidas J. Guibas:
Fractional Cascading: A Data Structuring Technique with Geometric Applications. 90-100 - Marek Chrobak:
Hierarchies of One-Way Multihead Automata Languages. 101-110 - Richard Cole:
Partitioning Point Sets in 4 Dimensions. 111-119 - Mario Coppo:
A Completeness Theorem for Recursively Defined Types. 120-129 - Pierre-Louis Curien:
Categorial Combinatory Logic. 130-139 - J. W. de Bakker, Joost N. Kok:
Towards a Uniform Topological Treatment of Streams and Functions on Streams. 140-148 - 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 - Paul De Bra:
Imposed-Functional Dependencies Inducing Horizontal Decompositions. 158-170 - Joost Engelfriet, Heiko Vogler:
Characterization of High Level Tree Transducers. 171-178 - Philippe Flajolet:
Ambiguity and Transcendence. 179-188 - Steven Fortune:
A Fast Algorithm for Polygon Containment by Translation (Extended Abstract). 189-198 - Martin Fürer:
Deterministic and Las Vegas Primality Testing Algorithms. 199-209 - Harold N. Gabow, Matthias F. M. Stallmann:
Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract). 210-220 - Joseph A. Goguen, Jean-Pierre Jouannaud, José Meseguer:
Operational Semantics for Order-Sorted Algebra. 221-231 - Carl A. Gunter:
A Universal Domain Technique for Profinite Posets. 232-243 - Georges Hansel:
A Simple Proof of the Skolem-Mahler-Lech Theorem. 244-249 - Juris Hartmanis, Neil Immerman:
On Complete Problems for NP$\cap$CoNP. 250-259 - Matthew Hennessy:
An Algebraic Theory of Fair Asynchronous Communicating Processes. 260-269 - Maria Teresa Hortalá-González, Mario Rodríguez-Artalejo:
Hoare's Logic for Nondeterministic Regular Programs: A Nonstandard Completeness Theorem. 270-280 - Karel Hrbacek:
Powerdomains as Algebraic Lattices (Preliminary Report). 281-289 - Mark Jerrum:
Random Generation of Combinatorial Structures from a Uniform Distribution (Extended Abstract). 290-299 - J. Howard Johnson:
Do Rational Equivalence Relations have Regular Cross-Sections? 300-309 - Hermann Jung:
On Probabilistic Time and Space. 310-317 - Rolf G. Karlsson, J. Ian Munro, Edward L. Robertson:
The Nearest Neighbor Problem on Bounded Domains. 318-327 - Michael Kaufmann, Kurt Mehlhorn:
Routing Through a Generalized Switchbox. 328-337 - Veikko Keränen:
On k-Repetition Free Words Generated by Length Uniform Morphisms Over a Binary Alphabet. 338-347 - Juha Kortelainen:
Every Commutative Quasirational Language is Regular. 348-355 - Thomas G. Kurtz, Udi Manber:
A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (Preliminary Version). 356-362 - Gad M. Landau, Mordechai M. Yung, Zvi Galil:
Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract). 363-372 - Kim Guldstrand Larsen:
A Context Dependent Equivalence between Processes. 373-382 - Ming Li:
Lower Bounds by Kolmogorov-Complexity (Extended Abstract). 383-393 - Michael Luby, Prabhakar Ragde:
A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version). 394-403 - Michael G. Main, Walter Bucher, David Haussler:
Applications of an Infinite Squarefree CO-CFL. 404-412 - Zohar Manna, Richard J. Waldinger:
Special Relations in Automated Deduction. 413-423 - Kurt Mehlhorn, Athanasios K. Tsakalidis:
Dynamic Interpolation Search. 424-434 - Pekka Orponen, David A. Russo, Uwe Schöning:
Polynomial Levelability and Maximal Complexity Cores. 435-444 - Jean-Eric Pin:
Finite Group Topology and p-Adic Topology for Free Monoids. 445-455 - Seppo Sippu, Eljas Soisalon-Soininen:
On the Use of Relational Expressions in the Design of Efficient Algorithms (Extended Abstract). 456-464 - A. Prasad Sistla, Moshe Y. Vardi, Pierre Wolper:
The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract). 465-474 - Colin Stirling:
A Complete Compositional Model Proof System for a Subset of CCS. 475-486 - Peter J. Varman, I. V. Ramakrishnan:
On Matrix Multiplication Using Array Processors. 487-496 - Uzi Vishkin:
Optimal Parallel Pattern Matching in Strings (Extended Summary). 497-508 - Job Zwiers, Willem P. de Roever, Peter van Emde Boas:
Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem. 509-519
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-26 23:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
