Collection
International Colloquium on Automata, Languages and Programming (ICALP 2020)
- Submission status
- Closed
This collection contains expanded papers from the 47th International Colloquium on Automata, Languages and Programming (ICALP 2020), the main European conference in Theoretical Computer Science and annual meeting of the European Association for Theoretical Computer Science (EATCS).
Editors
-
Anuj Dawar
Anuj Dawar is Professor of Logic and Algorithms at the University of Cambridge. He serves as President of the European Association for Computer Science Logic (EACSL) and a member of the ACM SigLog Executive.
Articles (8 in this collection)
-
-
Minimum Cut in \(O(m\log ^2 n)\) Time
Authors
- Paweł Gawrychowski
- Shay Mozes
- Oren Weimann
- Content type: OriginalPaper
- Open Access
- Published: 12 June 2024
- Pages: 814 - 834
-
How to Hide a Clique?
Authors
- Uriel Feige
- Vadim Grinberg
- Content type: OriginalPaper
- Open Access
- Published: 05 April 2024
- Pages: 773 - 813
-
Improved Bounds for Matching in Random-Order Streams
Authors
- Aaron Bernstein
- Content type: OriginalPaper
- Published: 12 December 2023
- Pages: 758 - 772
-
Equation Satisfiability in Solvable Groups
Authors (first, second and last of 4)
- Paweł Idziak
- Piotr Kawałek
- Armin Weiß
- Content type: OriginalPaper
- Open Access
- Published: 04 July 2022
- Pages: 740 - 757
-
On the structure of solution-sets to regular word equations
Authors
- Joel D. Day
- Florin Manea
- Content type: OriginalPaper
- Open Access
- Published: 28 October 2021
- Pages: 662 - 739
-
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
Authors
- Erik Paul
- Content type: OriginalPaper
- Open Access
- Published: 28 October 2021
- Pages: 615 - 661
-
On Polynomial Recursive Sequences
Authors (first, second and last of 5)
- Michaël Cadilhac
- Filip Mazowiecki
- Géraud Sénizergues
- Content type: OriginalPaper
- Open Access
- Published: 02 June 2021
- Pages: 593 - 614