International Colloquium on Automata Languages and Programming

ICALP

CORE rank

CORE rank (raw)

Fields of research

Theory of Computation

Papers indexed

4,916

1972–2026

Best Theory of Computation conferences

Papers per year

1972193 peak2026

Most published authors

ICALP papers

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

Year	Title	Authors
2011	Modular Markovian Logic.	Luca Cardelli, Kim G. Larsen, Radu Mardare
2011	On Tree-Constrained Matchings and Generalizations.	Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Klau, Julin Mestre
2011	Sorting by Transpositions Is Difficult.	Laurent Bulteau, Guillaume Fertin, Irena Rusu
2011	Constraint Satisfaction Parameterized by Solution Size.	Andrei A. Bulatov, Dniel Marx
2011	Dynamic Planar Range Maxima Queries.	Gerth Stlting Brodal, Konstantinos Tsakalidis
2011	On Reachability for Hybrid Automata over Bounded Time.	Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Jol Ouaknine, Jean-Franois Raskin, James Worrell
2011	Runtime Analysis of Probabilistic Programs with Unbounded Recursion.	Toms Brzdil, Stefan Kiefer, Antonn Kucera, Ivana Hutarov Varekov
2011	Approximating the Termination Value of One-Counter MDPs and Stochastic Games.	Toms Brzdil, Vclav Brozek, Kousha Etessami, Antonn Kucera
2011	Generic Expression Hardness Results for Primitive Positive Formula Comparison.	Simone Bova, Hubie Chen, Matthew Valeriote
2011	Deciding Robustness against Total Store Ordering.	Ahmed Bouajjani, Roland Meyer, Eike Mhlmann
2011	Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes.	Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey
2011	Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width.	Magnus Bordewich, Ross J. Kang
2011	Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization.	Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2011	On the Advice Complexity of the k-Server Problem.	Hans-Joachim Bckenhauer, Dennis Komm, Rastislav Krlovic, Richard Krlovic
2011	Parameterized Bounded-Depth Frege Is Not Optimal.	Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov
2011	Emptiness and Universality Problems in Timed Automata with Positive Frequency.	Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amlie Stainer
2011	Improved Approximation for the Directed Spanner Problem.	Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev
2011	Steiner Transitive-Closure Spanners of Low-Dimensional Posets.	Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev
2011	The Cost of Traveling between Languages.	Michael Benedikt, Gabriele Puppis, Cristian Riveros
2011	Algebraic Independence and Blackbox Identity Testing.	Malte Beecken, Johannes Mittmann, Nitin Saxena
2011	Guarded Negation.	Vince Brny, Balder ten Cate, Luc Segoufin
2011	A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem.	Per Austrin, Subhash Khot
2011	New Algorithms for Learning in Presence of Errors.	Sanjeev Arora, Rong Ge
2011	Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates.	Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin
2011	Meeting Deadlines: How Much Speed Suffices?	S. Anand, Naveen Garg, Nicole Megow

2,326–2,350 of 4,916← Previous Next →

Comparable venues

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