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
1993The Product of Rational Languages.Imre Simon
1993An Effective Version of Stallings' Theorem in the Case of Context-Free Groups.Graud Snizergues
1993Fast Parallel Computation of Characteristic Polynomials by Leverrier's POwer Sum Method Adapted to Fields of Finite Characteristic.Arnold Schnhage
1993The Complexity of N-body Simulation.John H. Reif, Stephen R. Tate
1993On the Computational Power of Discrete Hopfield Nets.Pekka Orponen
1993On Regular Compatibility of Semi-Commutations.Edward Ochmanski, Pierre-Andr Wacrenier
1993If a D0L Language is k-Power Free then it is Circular.Filippo Mignosi, Patrice Sbold
1993Cobham's Ttheorem seen through Bchi's Theorem.Christian Michaux, Roger Villemaire
1993The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract).Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
1993The Approximation of Maximum Subgraph Problems.Carsten Lund, Mihalis Yannakakis
1993Decidability of a Partial Order Based Temporal Logic.Kamal Lodaya, P. S. Thiagarajan
1993On the Power of Periodic Iteration of Morphisms.Arto Lepist
1993Optimal Bounds for the Change-Making Problem.Dexter Kozen, Shmuel Zaks
1993Fast Parallel Constraint Satisfaction.Lefteris M. Kirousis
1993On Randomized Versus Deterministic Computation.Marek Karpinski, Rutger Verbeek
1993What is a Universal Higher-Order Programming Language?Ramarao Kanneganti, Robert Cartwright
1993Polynomially Bounded Minimization Problems which are Hard to Approximate.Viggo Kann
1993Constructing Competitive Tours From Local Information.Bala Kalyanasundaram, Kirk Pruhs
1993Computational Depth and Reducibility (Extended Abstract).David W. Juedes, James I. Lathrop, Jack H. Lutz
1993Inclusion is Undecidable for Pattern Languages.Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu
1993Deciding True Concurrency Equivalences on Finite Sate Nets (Preliminary Report).Lalita Jategaonkar, Albert R. Meyer
1993A Theory of Even Functionals and Their Algorithmic Applications.Jerzy W. Jaromczyk, Grzegorz Swiatek
1993Extended Transition Systems for Parametric Bisimulation.Paola Inverardi, Corrado Priami, Daniel Yankelevich
1993New Decidability Results Concerning Two-way Counter Machines and Applications.Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trn, Hui Wang
1993Local Model Checking for Context-Free Processes.Hardi Hungar, Bernhard Steffen
3,9263,950 of 4,916← PreviousNext →

Comparable venues

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