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 |
|---|---|---|
| 2010 | Alternation Removal in Bchi Automata. | Udi Boker, Orna Kupferman, Adin Rosenberg |
| 2010 | Efficient Evaluation of Nondeterministic Automata Using Factorization Forests. | Mikolaj Bojanczyk, Pawel Parys |
| 2010 | On | Norbert Blum |
| 2010 | Resolving the Complexity of Some Data Privacy Problems. | Jeremiah Blocki, Ryan Williams |
| 2010 | The Serializability of Network Codes. | Anna Blasiak, Robert D. Kleinberg |
| 2010 | Covering and Packing in Linear Space. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2010 | On Approximate Horn Formula Minimization. | Amitava Bhattacharya, Bhaskar DasGupta, Dhruv Mubayi, Gyrgy Turn |
| 2010 | Efficient Information Exchange in the Random Phone-Call Model. | Petra Berenbrink, Jurek Czyzowicz, Robert Elssser, Leszek Gasieniec |
| 2010 | Choosing, Agreeing, and Eliminating in Communication Complexity. | Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb |
| 2010 | The Cooperative Game Theory Foundations of Network Bargaining Games. | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Nicole Immorlica, Hamid Mahini |
| 2010 | Better Scalable Algorithms for Broadcast Scheduling. | Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan |
| 2010 | Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems. | Nikhil Bansal, Subhash Khot |
| 2010 | Approximation Algorithms for Diversified Search Ranking. | Nikhil Bansal, Kamal Jain, Anna Kazeykina, Joseph Naor |
| 2010 | Metrical Task Systems and the | Nikhil Bansal, Niv Buchbinder, Joseph Naor |
| 2010 | Mean-Payoff Games and Propositional Proofs. | Albert Atserias, Elitza N. Maneva |
| 2010 | From Secrecy to Soundness: Efficient Verification via Secure Computation. | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
| 2010 | Online Network Design with Outliers. | Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski |
| 2010 | Cycle Detection and Correction. | Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira |
| 2010 | Weak Completeness Notions for Exponential Time. | Klaus Ambos-Spies, Timur Bakibayev |
| 2010 | How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange). | Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Morteza Zadimoghaddam |
| 2010 | Parameterized Modal Satisfiability. | Antonis Achilleos, Michael Lampis, Valia Mitsou |
| 2009 | Proportional Response Dynamics in the Fisher Market. | Li Zhang |
| 2009 | Elimination Graphs. | Yuli Ye, Allan Borodin |
| 2009 | Computing the Girth of a Planar Graph in | Oren Weimann, Raphael Yuster |
| 2009 | The Number of Symbol Comparisons in QuickSort and QuickSelect. | Brigitte Valle, Julien Clment, James Allen Fill, Philippe Flajolet |
2,451–2,475 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