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
2019Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction.Andreas Bjrklund, Petteri Kaski, Ryan Williams
2019Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar Vectors.Andreas Bjrklund, Ryan Williams
2019Finding Tutte Paths in Linear Time.Therese Biedl, Philipp Kindermann
2019The Complexity of Approximating the Matching Polynomial in the Complex Plane.Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2019Polynomially Ambiguous Probabilistic Automata on Restricted Languages.Paul C. Bell
2019Covering Metric Spaces by Few Trees.Yair Bartal, Nova Fandina, Ofer Neiman
2019Monadic Decomposability of Regular Relations.Pablo Barcel, Chih-Duo Hong, Xuan Bach Le, Anthony W. Lin, Reino Niskanen
2019Boundedness of Conjunctive Regular Path Queries.Pablo Barcel, Diego Figueira, Miguel Romero
2019On the Complexity of Value Iteration.Nikhil Balaji, Stefan Kiefer, Petr Novotn, Guillermo A. Prez, Mahsa Shirmohammadi
2019A Type System for Interactive JSON Schema Inference (Extended Abstract).Mohamed-Amine Baazizi, Dario Colazzo, Giorgio Ghelli, Carlo Sartiani
2019Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms.Kyriakos Axiotis, Christos Tzamos
2019Robust Communication-Optimal Distributed Clustering Algorithms.Pranjal Awasthi, Ainesh Bakshi, Maria-Florina Balcan, Colin White, David P. Woodruff
2019When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time.Sepehr Assadi, Shay Solomon
2019Two New Results About Quantum Exact Learning.Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf
2019Improvements in Quantum SDP-Solving with Applications.Joran van Apeldoorn, Andrs Gilyn
2019Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity.Alexandr Andoni, Clifford Stein, Peilin Zhong
2019Two Party Distribution Testing: Communication and Security.Alexandr Andoni, Tal Malkin, Negev Shekel Nosatzki
2019Algorithms and Hardness for Diameter in Dynamic Graphs.Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein
2019Stochastic Graph Exploration.Aris Anagnostopoulos, Ilan Reuven Cohen, Stefano Leonardi, Jakub Lacki
2019Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles.Noga Alon, Shiri Chechik, Sarel Cohen
2019How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev
2019Path Contraction Faster Than 2Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2019Lower Bounds for Multiplication via Network Coding.Peyman Afshani, Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen
2019Geometric Multicut.Mikkel Abrahamsen, Panos Giannopoulos, Maarten Lffler, Gnter Rote
2019Faster Algorithms for All-Pairs Bounded Min-Cuts.Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, Daniel Wolleb-Graf
1,2011,225 of 4,916← PreviousNext →

Comparable venues

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