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
Most published authors
ICALP papers
4,916 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2019 | Bchi Objectives in Countable MDPs. | Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke |
| 2019 | An Improved FPTAS for 0-1 Knapsack. | Ce Jin |
| 2019 | Local Search Breaks 1.75 for Graph Balancing. | Klaus Jansen, Lars Rohwedder |
| 2019 | Near-Linear Time Algorithm for n-fold ILPs via Color Coding. | Klaus Jansen, Alexandra Lassota, Lars Rohwedder |
| 2019 | Matroid Coflow Scheduling. | Sungjin Im, Benjamin Moseley, Kirk Pruhs, Manish Purohit |
| 2019 | Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. | Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, Amir Yehudayoff |
| 2019 | Termination of Linear Loops over the Integers. | Mehran Hosseini, Jol Ouaknine, James Worrell |
| 2019 | On Adaptive Algorithms for Maximum Matching. | Falko Hegerfeld, Stefan Kratsch |
| 2019 | Retracting Graphs to Cycles. | Samuel Haney, Mehraneh Liaee, Bruce M. Maggs, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram |
| 2019 | Quantum Chebyshev's Inequality and Applications. | Yassine Hamoudi, Frdric Magniez |
| 2019 | Optimal Strategies for Patrolling Fences. | Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, Pascal Pfister |
| 2019 | Beating Fredman-Komls for Perfect k-Hashing. | Venkatesan Guruswami, Andrii Riazanov |
| 2019 | Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields. | Venkatesan Guruswami, Lingfei Jin, Chaoping Xing |
| 2019 | Stochastic Online Metric Matching. | Anupam Gupta, Guru Guruganesh, Binghui Peng, David Wajc |
| 2019 | A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus. | Martin Grohe, Sandra Kiefer |
| 2019 | Symmetry and Similarity (Invited Talk). | Martin Grohe |
| 2019 | A Simple Protocol for Verifiable Delegation of Quantum Computation in One Round. | Alex B. Grilo |
| 2019 | AC | Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal |
| 2019 | The Hairy Ball Problem is PPAD-Complete. | Paul W. Goldberg, Alexandros Hollender |
| 2019 | Distributed Arboricity-Dependent Graph Coloring via All-to-All Communication. | Mohsen Ghaffari, Ali Sayyadi |
| 2019 | A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. | Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal |
| 2019 | Determinant Equivalence Test over Finite Fields and over Q. | Ankit Garg, Nikhil Gupta, Neeraj Kayal, Chandan Saha |
| 2019 | FO = FO | Marie Fortin |
| 2019 | Decomposition of Map Graphs with Applications. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
1,126–1,150 of 4,916← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*STOCACM Symposium on Theory of Computing
- A*FOCSIEEE Symposium on Foundations of Computer Science
- AESAEuropean Symposium on Algorithms
- ASTACSInternational Symposium on Theoretical Aspects of Computer Science
- A*LICSIEEE Symposium on Logic in Computer Science
- AGDGraph Drawing
- AALENEXWorkshop on Algorithm Engineering and Experiments