ICALP A*

50 papers

YearTitle / Authors
1987A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems.
Alain Finkel
1987A Lower Bound for the Complexity of the Union-Split-Find Problem.
Kurt Mehlhorn, Stefan Näher, Helmut Alt
1987A Modal Logic for a Subclass of Event Structures.
Kamal Lodaya, P. S. Thiagarajan
1987A Star-Height Problem in Free Monoids with Partial Communications.
Christian Choffrut, Christine Duboc
1987A Timed Failures Model for Extended Communicating Processes.
Rob Gerth, Andy Boucher
1987A Unification Algorithms for Confluent Theories.
Steffen Hölldobler
1987An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs.
Yves Métivier
1987Another Look at Abstraction in Process Algebra (Extended Abstract).
Jos C. M. Baeten, Rob J. van Glabbeek
1987Approximating Integer Lattices by Lattices with Cyclic Factor Groups.
Azaria Paz, Claus-Peter Schnorr
1987Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings
Thomas Ottmann
1987Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems.
Rodney R. Howell, Louis E. Rosier
1987Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree.
Thilo Hafer, Wolfgang Thomas
1987Decision Problems for Regular Trace Languages.
IJsbrand Jan Aalbersberg, Hendrik Jan Hoogeboom
1987Efficient On-Line Algorithms for the Knapsack Problem (Extended Abstract).
Alberto Marchetti-Spaccamela, Carlo Vercellis
1987Guessing Games and Distributed Computations in Synchronous Networks.
Jan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks
1987Inverse Image Analysis.
Peter Dybjer
1987Logic Programming with Ions.
M. A. Nait Abdallah
1987Lower Bounds for Sorting of Sums.
Martin Dietzfelbinger
1987Minimal Automaton of a Rational Cover.
Danièle Beauquier
1987Modelchecking of CTL Formulae under Liveness Assumptions.
Bernhard Josko
1987Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract).
Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack
1987Non-Uniform Automata Over Groups.
David A. Mix Barrington, Denis Thérien
1987On Recent Trends in Formal Language Theory.
Juhani Karhumäki
1987On Word Problems in Equational Theories.
Jieh Hsiang, Michaël Rusinowitch
1987On the Bivariate Function Minimization Problem And Its Applications to Motion Planning.
Jacob T. Schwartz, Micha Sharir
1987On the Complexity of Graph Critical Uncolorability.
Jin-Yi Cai, Gabriele E. Meyer
1987On the Computing Power of One-Way Cellular Arrays.
Oscar H. Ibarra, Tao Jiang
1987On the Knuth-Bendix Completion for Concurrent Processes.
Volker Diekert
1987On the Language Accepted by Finite Reversible Automata.
Jean-Eric Pin
1987Panic Mode without Panic.
Michal Chytil, Jirí Demner
1987Parallel 5-Colouring of Planar Graphs.
Torben Hagerup, Marek Chrobak, Krzysztof Diks
1987Parallel Construction of a Suffix Tree (Extended Abstract).
Gad M. Landau, Baruch Schieber, Uzi Vishkin
1987Partial Algebras Flow From Algebraic Specifications.
Hans-Jörg Kreowski
1987Posets, Boolean Representations and Quick Path Searching.
Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo
1987Probability and Plurality for Aggregations of Learning Machines.
Leonard Pitt, Carl H. Smith
1987Readiness Semantics for Regular Processes with Silent Actions.
Susanne Graf, Joseph Sifakis
1987Recent Developments in the Theory of Learning (Abstract).
Leslie G. Valiant
1987Semantics for Nondeterministic Asynchronous Broadcast Networks.
R. K. Shyamasundar, K. T. Narayana, Toniann Pitassi
1987Single-Valued Finite Transduction.
J. Howard Johnson
1987Term Matching on Parallel Computers.
R. Ramesh, Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan
1987Testing Membership in Commutative Transformation Semigroups.
Martin Beaudry
1987Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.
Herbert Edelsbrunner, Günter Rote, Emo Welzl
1987The I/O Complexity of Sorting and Related Problems (Extended Abstract).
Alok Aggarwal, Jeffrey Scott Vitter
1987The Kleene and the Parikh Theorem in Complete Semirings.
Werner Kuich
1987The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC Algorithms.
Satoru Miyano
1987The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2.
Klaus-Jörn Lange, Birgit Jenner, Bernd Kirsig
1987The Nearest Common Ancestor in a Dynamic Tree.
Athanasios K. Tsakalidis
1987The Probabilistic and Deterministic Parallel Complexity of Symmetric Functions.
Ming Li, Yaacov Yesha
1987Uniform Computational Complexity of Taylor Series.
Norbert Th. Müller
1987Verifying a Protocol Using Relativized Bisimulation.
Kim Guldstrand Larsen, Robin Milner