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
2012An Automata-Theoretic Model of Idealized Algol - (Extended Abstract).Uday S. Reddy, Brian P. Dunphy
2012Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions.Michael O. Rabin, Yishay Mansour, S. Muthukrishnan, Moti Yung
2012Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation.Lukas Polacek, Ola Svensson
2012Distributed Algorithms for Network Diameter and Girth.David Peleg, Liam Roditty, Elad Tal
2012Two-Level Game Semantics, Intersection Types, and Recursion Schemes.C.-H. Luke Ong, Takeshi Tsukada
2012Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization.Marcel Ochel, Klaus Radke, Berthold Vcking
2012Algorithmic Games for Full Ground References.Andrzej S. Murawski, Nikos Tzevelekos
2012Geometry of Online Packing Linear Programs.Marco Molinaro, R. Ravi
2012The Power of Recourse for Online MST and TSP.Nicole Megow, Martin Skutella, Jos Verschae, Andreas Wiese
2012A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals.Dniel Marx
2012Assigning Sporadic Tasks to Unrelated Parallel Machines.Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster, Andreas Wiese
2012Converting Online Algorithms to Local Computation Algorithms.Yishay Mansour, Aviad Rubinstein, Shai Vardi, Ning Xie
2012Parameterized Tractability of Multiway Cut with Parity Constraints.Daniel Lokshtanov, M. S. Ramanujan
2012Coalgebraic Predicate Logic.Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schrder
2012The Parameterized Complexity of k-Edge Induced Subgraphs.Bingkai Lin, Yijia Chen
2012Testing Similar Means.Reut Levi, Dana Ron, Ronitt Rubinfeld
2012Classical and Quantum Partition Bound and Detector Inefficiency.Sophie Laplante, Virginie Lerays, Jrmie Roland
2012A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem.Bundit Laekhanukit, Shayan Oveis Gharan, Mohit Singh
2012On the Expressive Power of Cost Logics over Infinite Words.Denis Kuperberg, Michael Vanden Boom
2012Lattices of Logical Fragments over Words - (Extended Abstract).Manfred Kufleitner, Alexander Lauser
2012Online Mechanism Design (Randomized Rounding on the Fly).Piotr Krysta, Berthold Vcking
2012Preserving Terminal Distances Using Minors.Robert Krauthgamer, Tamar Zondiner
2012Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs.Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlstrm
2012Contention Issues in Congestion Games.Elias Koutsoupias, Katia Papakonstantinopoulou
2012k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth.Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan
2,1262,150 of 4,916← PreviousNext →

Comparable venues

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