Skip to content

International Colloquium on Automata Languages and Programming

ICALP

A*

CORE rank

CORE rank (raw)

A*

Fields of research

Theory of Computation

Papers indexed

4,916

1972–2026

Papers per year

1972193 peak2026

ICALP papers

4,916 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
1988Algorithms for Planar Geometric Models.Chandrajit L. Bajaj, Myung-Soo Kim
1988Serializability in Distributed Systems with Handshaking.Ralph-Johan Back, Reino Kurki-Suonio
1988Problems Easy for Tree-Decomposable Graphs (Extended Abstract).Stefan Arnborg, Jens Lagergren, Detlef Seese
1988Average Case Complexity Analysis of the Rete Multi-Pattern Match Algorithm.Luc Albert, Franois Fages
1988Communication Complexity of PRAMs (Preliminary Version).Alok Aggarwal, Ashok K. Chandra
1987Recent Developments in the Theory of Learning (Abstract).Leslie G. Valiant
1987The Nearest Common Ancestor in a Dynamic Tree.Athanasios K. Tsakalidis
1987Semantics for Nondeterministic Asynchronous Broadcast Networks.R. K. Shyamasundar, K. T. Narayana, Toniann Pitassi
1987On the Bivariate Function Minimization Problem And Its Applications to Motion Planning.Jacob T. Schwartz, Micha Sharir
1987Term Matching on Parallel Computers.R. Ramesh, Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan
1987Probability and Plurality for Aggregations of Learning Machines.Leonard Pitt, Carl H. Smith
1987On the Language Accepted by Finite Reversible Automata.Jean-Eric Pin
1987Approximating Integer Lattices by Lattices with Cyclic Factor Groups.Azaria Paz, Claus-Peter Schnorr
1987Uniform Computational Complexity of Taylor Series.Norbert Th. Mller
1987The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC Algorithms.Satoru Miyano
1987An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs.Yves Mtivier
1987A Lower Bound for the Complexity of the Union-Split-Find Problem.Kurt Mehlhorn, Stefan Nher, Helmut Alt
1987Efficient On-Line Algorithms for the Knapsack Problem (Extended Abstract).Alberto Marchetti-Spaccamela, Carlo Vercellis
1987A Modal Logic for a Subclass of Event Structures.Kamal Lodaya, P. S. Thiagarajan
1987The Probabilistic and Deterministic Parallel Complexity of Symmetric Functions.Ming Li, Yaacov Yesha
1987Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract).Christos Levcopoulos, Andrzej Lingas, Jrg-Rdiger Sack
1987Guessing Games and Distributed Computations in Synchronous Networks.Jan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks
1987Verifying a Protocol Using Relativized Bisimulation.Kim Guldstrand Larsen, Robin Milner
1987The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2.Klaus-Jrn Lange, Birgit Jenner, Bernd Kirsig
1987Parallel Construction of a Suffix Tree (Extended Abstract).Gad M. Landau, Baruch Schieber, Uzi Vishkin
4,2514,275 of 4,916← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.