@Proceedings{bansal_et_al:LIPIcs.ICALP.2021,
title = {{LIPIcs, Volume 198, ICALP 2021, Complete Volume}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {1--2622},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021},
URN = {urn:nbn:de:0030-drops-140687},
doi = {10.4230/LIPIcs.ICALP.2021},
annote = {Keywords: LIPIcs, Volume 198, ICALP 2021, Complete Volume}
}
@InProceedings{bansal_et_al:LIPIcs.ICALP.2021.0,
author = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {0:i--0:xxxviii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.0},
URN = {urn:nbn:de:0030-drops-140696},
doi = {10.4230/LIPIcs.ICALP.2021.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{baier_et_al:LIPIcs.ICALP.2021.1,
author = {Baier, Christel and Dubslaff, Clemens and Funke, Florian and Jantsch, Simon and Majumdar, Rupak and Piribauer, Jakob and Ziemek, Robin},
title = {{From Verification to Causality-Based Explications}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {1:1--1:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.1},
URN = {urn:nbn:de:0030-drops-140709},
doi = {10.4230/LIPIcs.ICALP.2021.1},
annote = {Keywords: Model Checking, Causality, Responsibility, Counterfactuals, Shapley value}
}
@InProceedings{bulatov:LIPIcs.ICALP.2021.2,
author = {Bulatov, Andrei A.},
title = {{Symmetries and Complexity}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {2:1--2:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.2},
URN = {urn:nbn:de:0030-drops-140717},
doi = {10.4230/LIPIcs.ICALP.2021.2},
annote = {Keywords: constraint problems, algebraic approach, dichotomy theorems}
}
@InProceedings{censorhillel:LIPIcs.ICALP.2021.3,
author = {Censor-Hillel, Keren},
title = {{Distributed Subgraph Finding: Progress and Challenges}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {3:1--3:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.3},
URN = {urn:nbn:de:0030-drops-140726},
doi = {10.4230/LIPIcs.ICALP.2021.3},
annote = {Keywords: distributed algorithms, subgraph finding, limited bandwidth}
}
@InProceedings{dunkelman_et_al:LIPIcs.ICALP.2021.4,
author = {Dunkelman, Orr and Geyzel, Zeev and Keller, Chaya and Keller, Nathan and Ronen, Eyal and Shamir, Adi and Tessler, Ran J.},
title = {{Error Resilient Space Partitioning}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {4:1--4:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.4},
URN = {urn:nbn:de:0030-drops-140731},
doi = {10.4230/LIPIcs.ICALP.2021.4},
annote = {Keywords: space partition, high-dimensional rounding, error resilience, sphere packing, Sperner’s lemma, Brunn-Minkowski theorem, \v{C}ech cohomology}
}
@InProceedings{pitassi:LIPIcs.ICALP.2021.5,
author = {Pitassi, Toniann},
title = {{Algebraic Proof Systems}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {5:1--5:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.5},
URN = {urn:nbn:de:0030-drops-140747},
doi = {10.4230/LIPIcs.ICALP.2021.5},
annote = {Keywords: complexity theory, proof complexity, algebraic circuits}
}
@InProceedings{woodruff:LIPIcs.ICALP.2021.6,
author = {Woodruff, David P.},
title = {{A Very Sketchy Talk}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {6:1--6:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.6},
URN = {urn:nbn:de:0030-drops-140755},
doi = {10.4230/LIPIcs.ICALP.2021.6},
annote = {Keywords: dimensionality reduction, optimization, randomized numerical linear algebra, sketching}
}
@InProceedings{abboud_et_al:LIPIcs.ICALP.2021.7,
author = {Abboud, Amir and Vassilevska Williams, Virginia},
title = {{Fine-Grained Hardness for Edit Distance to a Fixed Sequence}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {7:1--7:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.7},
URN = {urn:nbn:de:0030-drops-140768},
doi = {10.4230/LIPIcs.ICALP.2021.7},
annote = {Keywords: SAT, edit distance, fine-grained complexity, conditional lower bound, sequence alignment}
}
@InProceedings{achlioptas_et_al:LIPIcs.ICALP.2021.8,
author = {Achlioptas, Dimitris and Zampetakis, Kostas},
title = {{Local Approximations of the Independent Set Polynomial}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {8:1--8:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.8},
URN = {urn:nbn:de:0030-drops-140773},
doi = {10.4230/LIPIcs.ICALP.2021.8},
annote = {Keywords: Independent Set Polynomial, Lov\'{a}sz Local Lemma, Self-avoiding Walks}
}
@InProceedings{adil_et_al:LIPIcs.ICALP.2021.9,
author = {Adil, Deeksha and Bullins, Brian and Kyng, Rasmus and Sachdeva, Sushant},
title = {{Almost-Linear-Time Weighted 𝓁\underlinep-Norm Solvers in Slightly Dense Graphs via Sparsification}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {9:1--9:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.9},
URN = {urn:nbn:de:0030-drops-140782},
doi = {10.4230/LIPIcs.ICALP.2021.9},
annote = {Keywords: Weighted 𝓁\underlinep-norm, Sparsification, Spanners, Iterative Refinement}
}
@InProceedings{agarwal_et_al:LIPIcs.ICALP.2021.10,
author = {Agarwal, Pankaj K. and Steiger, Alex},
title = {{An Output-Sensitive Algorithm for Computing the Union of Cubes and Fat Boxes in 3D}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {10:1--10:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.10},
URN = {urn:nbn:de:0030-drops-140790},
doi = {10.4230/LIPIcs.ICALP.2021.10},
annote = {Keywords: union of cubes, fat boxes, plane-sweep}
}
@InProceedings{agarwal_et_al:LIPIcs.ICALP.2021.11,
author = {Agarwal, Pankaj K. and Hu, Xiao and Sintos, Stavros and Yang, Jun},
title = {{Dynamic Enumeration of Similarity Joins}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {11:1--11:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.11},
URN = {urn:nbn:de:0030-drops-140803},
doi = {10.4230/LIPIcs.ICALP.2021.11},
annote = {Keywords: dynamic enumeration, similarity joins, worst-case delay guarantee}
}
@InProceedings{akmal_et_al:LIPIcs.ICALP.2021.12,
author = {Akmal, Shyan and Jin, Ce},
title = {{Faster Algorithms for Bounded Tree Edit Distance}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {12:1--12:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.12},
URN = {urn:nbn:de:0030-drops-140819},
doi = {10.4230/LIPIcs.ICALP.2021.12},
annote = {Keywords: tree edit distance, edit distance, dynamic programming}
}
@InProceedings{akmal_et_al:LIPIcs.ICALP.2021.13,
author = {Akmal, Shyan and Vassilevska Williams, Virginia},
title = {{Improved Approximation for Longest Common Subsequence over Small Alphabets}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {13:1--13:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.13},
URN = {urn:nbn:de:0030-drops-140821},
doi = {10.4230/LIPIcs.ICALP.2021.13},
annote = {Keywords: approximation algorithms, longest common subsequence, subquadratic}
}
@InProceedings{alon_et_al:LIPIcs.ICALP.2021.14,
author = {Alon, Noga and Graur, Andrei},
title = {{Efficient Splitting of Necklaces}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {14:1--14:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.14},
URN = {urn:nbn:de:0030-drops-140832},
doi = {10.4230/LIPIcs.ICALP.2021.14},
annote = {Keywords: necklace splitting, necklace halving, approximation algorithms, online algorithms, discrepancy}
}
@InProceedings{anders_et_al:LIPIcs.ICALP.2021.15,
author = {Anders, Markus and Schweitzer, Pascal and Wetzels, Florian},
title = {{Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {15:1--15:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.15},
URN = {urn:nbn:de:0030-drops-140846},
doi = {10.4230/LIPIcs.ICALP.2021.15},
annote = {Keywords: Color refinement, Online algorithms, Graph isomorphism, Lower bounds}
}
@InProceedings{anders_et_al:LIPIcs.ICALP.2021.16,
author = {Anders, Markus and Schweitzer, Pascal},
title = {{Search Problems in Trees with Symmetries: Near Optimal Traversal Strategies for Individualization-Refinement Algorithms}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {16:1--16:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.16},
URN = {urn:nbn:de:0030-drops-140853},
doi = {10.4230/LIPIcs.ICALP.2021.16},
annote = {Keywords: Online algorithms, Graph isomorphism, Lower bounds}
}
@InProceedings{antoniadis_et_al:LIPIcs.ICALP.2021.17,
author = {Antoniadis, Antonios and Englert, Matthias and Matsakis, Nicolaos and Vesel\'{y}, Pavel},
title = {{Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {17:1--17:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.17},
URN = {urn:nbn:de:0030-drops-140864},
doi = {10.4230/LIPIcs.ICALP.2021.17},
annote = {Keywords: buffer management, online scheduling, online algorithms, longest queue drop}
}
@InProceedings{asadi_et_al:LIPIcs.ICALP.2021.18,
author = {Asadi, Vahid R. and Shinkar, Igor},
title = {{Relaxed Locally Correctable Codes with Improved Parameters}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {18:1--18:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.18},
URN = {urn:nbn:de:0030-drops-140878},
doi = {10.4230/LIPIcs.ICALP.2021.18},
annote = {Keywords: Algorithmic coding theory, consistency test using random walk, Reed-Muller code, relaxed locally decodable codes, relaxed locally correctable codes}
}
@InProceedings{assadi_et_al:LIPIcs.ICALP.2021.19,
author = {Assadi, Sepehr and Behnezhad, Soheil},
title = {{Beating Two-Thirds For Random-Order Streaming Matching}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {19:1--19:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.19},
URN = {urn:nbn:de:0030-drops-140887},
doi = {10.4230/LIPIcs.ICALP.2021.19},
annote = {Keywords: Maximum Matching, Streaming, Random-Order Streaming}
}
@InProceedings{bafna_et_al:LIPIcs.ICALP.2021.20,
author = {Bafna, Mitali and Vyas, Nikhil},
title = {{Optimal Fine-Grained Hardness of Approximation of Linear Equations}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {20:1--20:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.20},
URN = {urn:nbn:de:0030-drops-140894},
doi = {10.4230/LIPIcs.ICALP.2021.20},
annote = {Keywords: Linear Equations, Fine-Grained Complexity, Hardness of Approximation}
}
@InProceedings{bajpai_et_al:LIPIcs.ICALP.2021.21,
author = {Bajpai, Tanvi and Chakrabarty, Deeparnab and Chekuri, Chandra and Negahbani, Maryam},
title = {{Revisiting Priority k-Center: Fairness and Outliers}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {21:1--21:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.21},
URN = {urn:nbn:de:0030-drops-140909},
doi = {10.4230/LIPIcs.ICALP.2021.21},
annote = {Keywords: Fairness, Clustering, Approximation, Outliers}
}
@InProceedings{bamas_et_al:LIPIcs.ICALP.2021.22,
author = {Bamas, Etienne and Garg, Paritosh and Rohwedder, Lars},
title = {{The Submodular Santa Claus Problem in the Restricted Assignment Case}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {22:1--22:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.22},
URN = {urn:nbn:de:0030-drops-140912},
doi = {10.4230/LIPIcs.ICALP.2021.22},
annote = {Keywords: Scheduling, submodularity, approximation algorithm, hypergraph matching}
}
@InProceedings{bandyapadhyay_et_al:LIPIcs.ICALP.2021.23,
author = {Bandyapadhyay, Sayan and Fomin, Fedor V. and Simonov, Kirill},
title = {{On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {23:1--23:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.23},
URN = {urn:nbn:de:0030-drops-140923},
doi = {10.4230/LIPIcs.ICALP.2021.23},
annote = {Keywords: fair clustering, coresets, approximation algorithms}
}
@InProceedings{batziou_et_al:LIPIcs.ICALP.2021.24,
author = {Batziou, Eleni and Hansen, Kristoffer Arnsfelt and H{\o}gh, Kasper},
title = {{Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {24:1--24:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.24},
URN = {urn:nbn:de:0030-drops-140939},
doi = {10.4230/LIPIcs.ICALP.2021.24},
annote = {Keywords: Consensus halving, Computational Complexity, Borsuk-Ulam}
}
@InProceedings{benbasat_et_al:LIPIcs.ICALP.2021.25,
author = {Ben Basat, Ran and Mitzenmacher, Michael and Vargaftik, Shay},
title = {{How to Send a Real Number Using a Single Bit (And Some Shared Randomness)}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {25:1--25:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.25},
URN = {urn:nbn:de:0030-drops-140942},
doi = {10.4230/LIPIcs.ICALP.2021.25},
annote = {Keywords: Randomized Algorithms, Approximation Algorithms, Shared Randomness, Distributed Protocols, Estimation, Subtractive Dithering}
}
@InProceedings{bentert_et_al:LIPIcs.ICALP.2021.26,
author = {Bentert, Matthias and Nichterlein, Andr\'{e} and Renken, Malte and Zschoche, Philipp},
title = {{Using a Geometric Lens to Find k Disjoint Shortest Paths}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {26:1--26:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.26},
URN = {urn:nbn:de:0030-drops-140954},
doi = {10.4230/LIPIcs.ICALP.2021.26},
annote = {Keywords: graph algorithms, dynamic programming, W\lbrack1\rbrack-hardness, geometry}
}
@InProceedings{bhattacharya_et_al:LIPIcs.ICALP.2021.27,
author = {Bhattacharya, Sayan and Kiss, Peter},
title = {{Deterministic Rounding of Dynamic Fractional Matchings}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {27:1--27:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.27},
URN = {urn:nbn:de:0030-drops-140960},
doi = {10.4230/LIPIcs.ICALP.2021.27},
annote = {Keywords: Matching, Dynamic Algorithms, Data Structures}
}
@InProceedings{bienkowski_et_al:LIPIcs.ICALP.2021.28,
author = {Bienkowski, Marcin and Kraska, Artur and Liu, Hsiang-Hsuan},
title = {{Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {28:1--28:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.28},
URN = {urn:nbn:de:0030-drops-140977},
doi = {10.4230/LIPIcs.ICALP.2021.28},
annote = {Keywords: traveling repairperson problem, dial-a-ride, machine scheduling, unrelated machines, minimizing completion time, competitive analysis, factor-revealing LP}
}
@InProceedings{bjorklund_et_al:LIPIcs.ICALP.2021.29,
author = {Bj\"{o}rklund, Andreas and Kaski, Petteri},
title = {{Counting Short Vector Pairs by Inner Product and Relations to the Permanent}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {29:1--29:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.29},
URN = {urn:nbn:de:0030-drops-140988},
doi = {10.4230/LIPIcs.ICALP.2021.29},
annote = {Keywords: additive reconstruction, Chinese Remainder Theorem, counting, inner product, modular tomography, orthogonal vectors, permanent}
}
@InProceedings{blanc_et_al:LIPIcs.ICALP.2021.30,
author = {Blanc, Guy and Lange, Jane and Tan, Li-Yang},
title = {{Learning Stochastic Decision Trees}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {30:1--30:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.30},
URN = {urn:nbn:de:0030-drops-140994},
doi = {10.4230/LIPIcs.ICALP.2021.30},
annote = {Keywords: Learning theory, decision trees, proper learning algorithms, adversarial noise}
}
@InProceedings{blikstad:LIPIcs.ICALP.2021.31,
author = {Blikstad, Joakim},
title = {{Breaking O(nr) for Matroid Intersection}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {31:1--31:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.31},
URN = {urn:nbn:de:0030-drops-141004},
doi = {10.4230/LIPIcs.ICALP.2021.31},
annote = {Keywords: Matroid Intersection, Combinatorial Optimization, Approximation Algorithms}
}
@InProceedings{boker:LIPIcs.ICALP.2021.32,
author = {B\"{o}ker, Jan},
title = {{Graph Similarity and Homomorphism Densities}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {32:1--32:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.32},
URN = {urn:nbn:de:0030-drops-141014},
doi = {10.4230/LIPIcs.ICALP.2021.32},
annote = {Keywords: graph similarity, homomorphism densities, cut distance}
}
@InProceedings{bogdanov_et_al:LIPIcs.ICALP.2021.33,
author = {Bogdanov, Andrej and Prakriya, Gautam},
title = {{Direct Sum and Partitionability Testing over General Groups}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {33:1--33:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.33},
URN = {urn:nbn:de:0030-drops-141028},
doi = {10.4230/LIPIcs.ICALP.2021.33},
annote = {Keywords: Direct Sum Test, Function Partitionability, Hypercontractive Inequality, Property Testing}
}
@InProceedings{bonnet:LIPIcs.ICALP.2021.34,
author = {Bonnet, \'{E}douard},
title = {{4 vs 7 Sparse Undirected Unweighted Diameter is SETH-Hard at Time n^\{4/3\}}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {34:1--34:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.34},
URN = {urn:nbn:de:0030-drops-141034},
doi = {10.4230/LIPIcs.ICALP.2021.34},
annote = {Keywords: Diameter, inapproximability, SETH lower bounds, k-Orthogonal Vectors}
}
@InProceedings{bonnet_et_al:LIPIcs.ICALP.2021.35,
author = {Bonnet, \'{E}douard and Geniet, Colin and Kim, Eun Jung and Thomass\'{e}, St\'{e}phan and Watrigant, R\'{e}mi},
title = {{Twin-width III: Max Independent Set, Min Dominating Set, and Coloring}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {35:1--35:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.35},
URN = {urn:nbn:de:0030-drops-141044},
doi = {10.4230/LIPIcs.ICALP.2021.35},
annote = {Keywords: Twin-width, Max Independent Set, Min Dominating Set, Coloring, Parameterized Algorithms, Approximation Algorithms, Exact Algorithms}
}
@InProceedings{bouchard_et_al:LIPIcs.ICALP.2021.36,
author = {Bouchard, S\'{e}bastien and Dieudonn\'{e}, Yoann and Labourel, Arnaud and Pelc, Andrzej},
title = {{Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {36:1--36:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.36},
URN = {urn:nbn:de:0030-drops-141051},
doi = {10.4230/LIPIcs.ICALP.2021.36},
annote = {Keywords: treasure hunt, graph, mobile agent}
}
@InProceedings{brakensiek_et_al:LIPIcs.ICALP.2021.37,
author = {Brakensiek, Joshua and Guruswami, Venkatesan and Sandeep, Sai},
title = {{Conditional Dichotomy of Boolean Ordered Promise CSPs}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {37:1--37:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.37},
URN = {urn:nbn:de:0030-drops-141060},
doi = {10.4230/LIPIcs.ICALP.2021.37},
annote = {Keywords: promise constraint satisfaction, Boolean ordered PCSP, Shapley value, rich 2-to-1 conjecture, random minor}
}
@InProceedings{brand_et_al:LIPIcs.ICALP.2021.38,
author = {Brand, Cornelius and Pratt, Kevin},
title = {{Parameterized Applications of Symbolic Differentiation of (Totally) Multilinear Polynomials}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {38:1--38:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.38},
URN = {urn:nbn:de:0030-drops-141079},
doi = {10.4230/LIPIcs.ICALP.2021.38},
annote = {Keywords: Parameterized Algorithms, Algebraic Algorithms, Longest Cycle, Matroid Parity}
}
@InProceedings{bringmann_et_al:LIPIcs.ICALP.2021.39,
author = {Bringmann, Karl and Das, Debarati},
title = {{A Linear-Time n^\{0.4\}-Approximation for Longest Common Subsequence}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {39:1--39:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.39},
URN = {urn:nbn:de:0030-drops-141082},
doi = {10.4230/LIPIcs.ICALP.2021.39},
annote = {Keywords: approximation algorithm, longest common subsequence, string algorithm}
}
@InProceedings{bringmann_et_al:LIPIcs.ICALP.2021.40,
author = {Bringmann, Karl and Slusallek, Jasper},
title = {{Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {40:1--40:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.40},
URN = {urn:nbn:de:0030-drops-141095},
doi = {10.4230/LIPIcs.ICALP.2021.40},
annote = {Keywords: subgraph isomorphism, treewidth, fine-grained complexity, hyperclique}
}
@InProceedings{bringmann_et_al:LIPIcs.ICALP.2021.41,
author = {Bringmann, Karl and Nakos, Vasileios},
title = {{Fast n-Fold Boolean Convolution via Additive Combinatorics}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {41:1--41:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.41},
URN = {urn:nbn:de:0030-drops-141108},
doi = {10.4230/LIPIcs.ICALP.2021.41},
annote = {Keywords: convolution, sumset computation, modular subset sum, output sensitive}
}
@InProceedings{buchem_et_al:LIPIcs.ICALP.2021.42,
author = {Buchem, Moritz and Rohwedder, Lars and Vredeveld, Tjark and Wiese, Andreas},
title = {{Additive Approximation Schemes for Load Balancing Problems}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {42:1--42:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.42},
URN = {urn:nbn:de:0030-drops-141116},
doi = {10.4230/LIPIcs.ICALP.2021.42},
annote = {Keywords: Load balancing, Approximation schemes, Parallel machine scheduling}
}
@InProceedings{cairo_et_al:LIPIcs.ICALP.2021.43,
author = {Cairo, Massimo and Rizzi, Romeo and Tomescu, Alexandru I. and Zirondelli, Elia C.},
title = {{Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {43:1--43:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.43},
URN = {urn:nbn:de:0030-drops-141122},
doi = {10.4230/LIPIcs.ICALP.2021.43},
annote = {Keywords: Graph algorithm, strong connectivity, reachability under failures}
}
@InProceedings{carmosino_et_al:LIPIcs.ICALP.2021.44,
author = {Carmosino, Marco and Hoover, Kenneth and Impagliazzo, Russell and Kabanets, Valentine and Kolokolova, Antonina},
title = {{Lifting for Constant-Depth Circuits and Applications to MCSP}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {44:1--44:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.44},
URN = {urn:nbn:de:0030-drops-141135},
doi = {10.4230/LIPIcs.ICALP.2021.44},
annote = {Keywords: circuit complexity, constant-depth circuits, lifting theorems, Minimum Circuit Size Problem, reductions, Switching Lemma}
}
@InProceedings{cen_et_al:LIPIcs.ICALP.2021.45,
author = {Cen, Ruoxu and Cheng, Yu and Panigrahi, Debmalya and Sun, Kevin},
title = {{Sparsification of Directed Graphs via Cut Balance}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {45:1--45:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.45},
URN = {urn:nbn:de:0030-drops-141143},
doi = {10.4230/LIPIcs.ICALP.2021.45},
annote = {Keywords: Graph sparsification, directed graphs, cut sketches, space complexity}
}
@InProceedings{censorhillel_et_al:LIPIcs.ICALP.2021.46,
author = {Censor-Hillel, Keren and Marelly, Noa and Schwartz, Roy and Tonoyan, Tigran},
title = {{Fault Tolerant Max-Cut}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {46:1--46:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.46},
URN = {urn:nbn:de:0030-drops-141158},
doi = {10.4230/LIPIcs.ICALP.2021.46},
annote = {Keywords: fault-tolerance, max-cut, approximation}
}
@InProceedings{chan_et_al:LIPIcs.ICALP.2021.47,
author = {Chan, Timothy M. and Vassilevska Williams, Virginia and Xu, Yinzhan},
title = {{Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {47:1--47:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.47},
URN = {urn:nbn:de:0030-drops-141166},
doi = {10.4230/LIPIcs.ICALP.2021.47},
annote = {Keywords: All-Pairs Shortest Paths, Fine-Grained Complexity, Graph Algorithm}
}
@InProceedings{charalampopoulos_et_al:LIPIcs.ICALP.2021.48,
author = {Charalampopoulos, Panagiotis and Gawrychowski, Pawe{\l} and Mozes, Shay and Weimann, Oren},
title = {{An Almost Optimal Edit Distance Oracle}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {48:1--48:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.48},
URN = {urn:nbn:de:0030-drops-141175},
doi = {10.4230/LIPIcs.ICALP.2021.48},
annote = {Keywords: longest common subsequence, edit distance, planar graphs, Voronoi diagrams}
}
@InProceedings{chekuri_et_al:LIPIcs.ICALP.2021.49,
author = {Chekuri, Chandra and Quanrud, Kent},
title = {{Faster Algorithms for Rooted Connectivity in Directed Graphs}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {49:1--49:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.49},
URN = {urn:nbn:de:0030-drops-141187},
doi = {10.4230/LIPIcs.ICALP.2021.49},
annote = {Keywords: rooted connectivity, directed graph, fast algorithm, sparsification}
}
@InProceedings{chekuri_et_al:LIPIcs.ICALP.2021.50,
author = {Chekuri, Chandra and Quanrud, Kent},
title = {{Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {50:1--50:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.50},
URN = {urn:nbn:de:0030-drops-141199},
doi = {10.4230/LIPIcs.ICALP.2021.50},
annote = {Keywords: cuts, vertex connectivity, hypergraphs, fast algorithms, submodularity, bisumodularity, lattices, isolating cuts, element connectivity}
}
@InProceedings{chen_et_al:LIPIcs.ICALP.2021.51,
author = {Chen, Lijie and Lu, Zhenjian and Lyu, Xin and Oliveira, Igor C.},
title = {{Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {51:1--51:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.51},
URN = {urn:nbn:de:0030-drops-141202},
doi = {10.4230/LIPIcs.ICALP.2021.51},
annote = {Keywords: circuit complexity, average-case hardness, complexity lower bounds}
}
@InProceedings{chen_et_al:LIPIcs.ICALP.2021.52,
author = {Chen, Lijie and Kol, Gillat and Paramonov, Dmitry and Saxena, Raghuvansh R. and Song, Zhao and Yu, Huacheng},
title = {{Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {52:1--52:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.52},
URN = {urn:nbn:de:0030-drops-141218},
doi = {10.4230/LIPIcs.ICALP.2021.52},
annote = {Keywords: streaming algorithms, random walk sampling}
}
@InProceedings{chen_et_al:LIPIcs.ICALP.2021.53,
author = {Chen, Yu and Khanna, Sanjeev and Nagda, Ansh},
title = {{Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {53:1--53:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.53},
URN = {urn:nbn:de:0030-drops-141227},
doi = {10.4230/LIPIcs.ICALP.2021.53},
annote = {Keywords: hypergraphs, graph sparsification, cut queries}
}
@InProceedings{cheng_et_al:LIPIcs.ICALP.2021.54,
author = {Cheng, Kuan and Farhadi, Alireza and Hajiaghayi, MohammadTaghi and Jin, Zhengzhong and Li, Xin and Rubinstein, Aviad and Seddighin, Saeed and Zheng, Yu},
title = {{Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {54:1--54:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.54},
URN = {urn:nbn:de:0030-drops-141236},
doi = {10.4230/LIPIcs.ICALP.2021.54},
annote = {Keywords: Edit Distance, Longest Common Subsequence, Longest Increasing Subsequence, Space Efficient Algorithm, Approximation Algorithm}
}
@InProceedings{childs_et_al:LIPIcs.ICALP.2021.55,
author = {Childs, Andrew M. and Hung, Shih-Han and Li, Tongyang},
title = {{Quantum Query Complexity with Matrix-Vector Products}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {55:1--55:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.55},
URN = {urn:nbn:de:0030-drops-141242},
doi = {10.4230/LIPIcs.ICALP.2021.55},
annote = {Keywords: Quantum algorithms, quantum query complexity, matrix-vector products}
}
@InProceedings{christodoulou_et_al:LIPIcs.ICALP.2021.56,
author = {Christodoulou, George and Koutsoupias, Elias and Kov\'{a}cs, Annam\'{a}ria},
title = {{Truthful Allocation in Graphs and Hypergraphs}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {56:1--56:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.56},
URN = {urn:nbn:de:0030-drops-141256},
doi = {10.4230/LIPIcs.ICALP.2021.56},
annote = {Keywords: Algorithmic Game Theory, Scheduling Unrelated Machines, Mechanism Design}
}
@InProceedings{coester_et_al:LIPIcs.ICALP.2021.57,
author = {Coester, Christian and Koutsoupias, Elias},
title = {{Towards the k-Server Conjecture: A Unifying Potential, Pushing the Frontier to the Circle}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {57:1--57:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.57},
URN = {urn:nbn:de:0030-drops-141263},
doi = {10.4230/LIPIcs.ICALP.2021.57},
annote = {Keywords: Online algorithms, competitive analysis, k-server, work function algorithm}
}
@InProceedings{czumaj_et_al:LIPIcs.ICALP.2021.58,
author = {Czumaj, Artur and Kontogeorgiou, George and Paterson, Mike},
title = {{Haystack Hunting Hints and Locker Room Communication}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {58:1--58:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.58},
URN = {urn:nbn:de:0030-drops-141270},
doi = {10.4230/LIPIcs.ICALP.2021.58},
annote = {Keywords: Random permutations, Search, Communication complexity}
}
@InProceedings{dangelo_et_al:LIPIcs.ICALP.2021.59,
author = {D'Angelo, Gianlorenzo and Poddar, Debashmita and Vinci, Cosimo},
title = {{Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {59:1--59:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.59},
URN = {urn:nbn:de:0030-drops-141282},
doi = {10.4230/LIPIcs.ICALP.2021.59},
annote = {Keywords: Adaptive Optimization, Influence Maximization, Submodular Optimization, Stochastic Optimization}
}
@InProceedings{dalirrooyfard_et_al:LIPIcs.ICALP.2021.60,
author = {Dalirrooyfard, Mina and Kaufmann, Jenny},
title = {{Approximation Algorithms for Min-Distance Problems in DAGs}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {60:1--60:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.60},
URN = {urn:nbn:de:0030-drops-141293},
doi = {10.4230/LIPIcs.ICALP.2021.60},
annote = {Keywords: Fine-grained complexity, Graph algorithms, Diameter, Radius, Eccentricities}
}
@InProceedings{damerius_et_al:LIPIcs.ICALP.2021.61,
author = {Damerius, Christoph and Kaaser, Dominik and Kling, Peter and Schneider, Florian},
title = {{On Greedily Packing Anchored Rectangles}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {61:1--61:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.61},
URN = {urn:nbn:de:0030-drops-141306},
doi = {10.4230/LIPIcs.ICALP.2021.61},
annote = {Keywords: lower-left anchored rectangle packing, greedy algorithm, charging scheme}
}
@InProceedings{davies_et_al:LIPIcs.ICALP.2021.62,
author = {Davies, Ewan and Perkins, Will},
title = {{Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {62:1--62:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.62},
URN = {urn:nbn:de:0030-drops-141310},
doi = {10.4230/LIPIcs.ICALP.2021.62},
annote = {Keywords: approximate counting, independent sets, Markov chains}
}
@InProceedings{ellert_et_al:LIPIcs.ICALP.2021.63,
author = {Ellert, Jonas and Fischer, Johannes},
title = {{Linear Time Runs Over General Ordered Alphabets}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {63:1--63:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.63},
URN = {urn:nbn:de:0030-drops-141322},
doi = {10.4230/LIPIcs.ICALP.2021.63},
annote = {Keywords: String algorithms, Lyndon array, runs, squares, longest common extension, general ordered alphabets, combinatorics on words}
}
@InProceedings{evald_et_al:LIPIcs.ICALP.2021.64,
author = {Evald, Jacob and Fredslund-Hansen, Viktor and Gutenberg, Maximilian Probst and Wulff-Nilsen, Christian},
title = {{Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {64:1--64:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.64},
URN = {urn:nbn:de:0030-drops-141337},
doi = {10.4230/LIPIcs.ICALP.2021.64},
annote = {Keywords: Dynamic Graph Algorithm, Data Structure, Shortest Paths}
}
@InProceedings{fotakis_et_al:LIPIcs.ICALP.2021.65,
author = {Fotakis, Dimitris and Kostopanagiotis, Panagiotis and Nakos, Vasileios and Piliouras, Georgios and Skoulakis, Stratis},
title = {{On the Approximability of Multistage Min-Sum Set Cover}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {65:1--65:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.65},
URN = {urn:nbn:de:0030-drops-141341},
doi = {10.4230/LIPIcs.ICALP.2021.65},
annote = {Keywords: Approximation Algorithms, Multistage Min-Sum Set Cover, Multistage Optimization Problems}
}
@InProceedings{friedrich_et_al:LIPIcs.ICALP.2021.66,
author = {Friedrich, Tobias and G\"{o}bel, Andreas and Krejca, Martin S. and Pappik, Marcus},
title = {{A Spectral Independence View on Hard Spheres via Block Dynamics}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {66:1--66:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.66},
URN = {urn:nbn:de:0030-drops-141353},
doi = {10.4230/LIPIcs.ICALP.2021.66},
annote = {Keywords: Hard-sphere Model, Markov Chain, Partition Function, Gibbs Distribution, Approximate Counting, Spectral Independence}
}
@InProceedings{friggstad_et_al:LIPIcs.ICALP.2021.67,
author = {Friggstad, Zachary and Swamy, Chaitanya},
title = {{Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {67:1--67:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.67},
URN = {urn:nbn:de:0030-drops-141369},
doi = {10.4230/LIPIcs.ICALP.2021.67},
annote = {Keywords: Approximation algorithms, Vehicle routing problems, Deadline TSP, Orienteering}
}
@InProceedings{fu_et_al:LIPIcs.ICALP.2021.68,
author = {Fu, Hu and Tang, Zhihao Gavin and Wu, Hongxun and Wu, Jinzhao and Zhang, Qianfan},
title = {{Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {68:1--68:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.68},
URN = {urn:nbn:de:0030-drops-141376},
doi = {10.4230/LIPIcs.ICALP.2021.68},
annote = {Keywords: Matching, Contention Resolution Scheme, Price of Information, Query-Commit}
}
@InProceedings{gartner_et_al:LIPIcs.ICALP.2021.69,
author = {G\"{a}rtner, Bernd and Haslebacher, Sebastian and Hoang, Hung P.},
title = {{A Subexponential Algorithm for ARRIVAL}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {69:1--69:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.69},
URN = {urn:nbn:de:0030-drops-141387},
doi = {10.4230/LIPIcs.ICALP.2021.69},
annote = {Keywords: Pseudorandom walks, reachability, graph games, switching systems}
}
@InProceedings{ganesh_et_al:LIPIcs.ICALP.2021.70,
author = {Ganesh, Arun and Maggs, Bruce M. and Panigrahi, Debmalya},
title = {{Universal Algorithms for Clustering Problems}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {70:1--70:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.70},
URN = {urn:nbn:de:0030-drops-141397},
doi = {10.4230/LIPIcs.ICALP.2021.70},
annote = {Keywords: universal algorithms, clustering, k-median, k-means, k-center}
}
@InProceedings{ganguly_et_al:LIPIcs.ICALP.2021.71,
author = {Ganguly, Arnab and Patel, Dhrumil and Shah, Rahul and Thankachan, Sharma V.},
title = {{LF Successor: Compact Space Indexing for Order-Isomorphic Pattern Matching}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {71:1--71:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.71},
URN = {urn:nbn:de:0030-drops-141400},
doi = {10.4230/LIPIcs.ICALP.2021.71},
annote = {Keywords: Succinct data structures, Pattern Matching}
}
@InProceedings{ganian_et_al:LIPIcs.ICALP.2021.72,
author = {Ganian, Robert and Hamm, Thekla and Klute, Fabian and Parada, Irene and Vogtenhuber, Birgit},
title = {{Crossing-Optimal Extension of Simple Drawings}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {72:1--72:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.72},
URN = {urn:nbn:de:0030-drops-141412},
doi = {10.4230/LIPIcs.ICALP.2021.72},
annote = {Keywords: Simple drawings, Extension problems, Crossing minimization, FPT-algorithms}
}
@InProceedings{girish_et_al:LIPIcs.ICALP.2021.73,
author = {Girish, Uma and Raz, Ran and Zhan, Wei},
title = {{Quantum Logspace Algorithm for Powering Matrices with Bounded Norm}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {73:1--73:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.73},
URN = {urn:nbn:de:0030-drops-141426},
doi = {10.4230/LIPIcs.ICALP.2021.73},
annote = {Keywords: BQL, Matrix Powering, Quantum Circuit, Reversible Computation}
}
@InProceedings{gravin_et_al:LIPIcs.ICALP.2021.74,
author = {Gravin, Nick and Tang, Zhihao Gavin and Wang, Kangning},
title = {{Online Stochastic Matching with Edge Arrivals}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {74:1--74:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.74},
URN = {urn:nbn:de:0030-drops-141438},
doi = {10.4230/LIPIcs.ICALP.2021.74},
annote = {Keywords: online matching, graph algorithms, prophet inequality}
}
@InProceedings{gu_et_al:LIPIcs.ICALP.2021.75,
author = {Gu, Yuzhou and Polak, Adam and Vassilevska Williams, Virginia and Xu, Yinzhan},
title = {{Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {75:1--75:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.75},
URN = {urn:nbn:de:0030-drops-141440},
doi = {10.4230/LIPIcs.ICALP.2021.75},
annote = {Keywords: APSP, Min-Plus Product, Range Mode, Single-Source Replacement Paths}
}
@InProceedings{gu_et_al:LIPIcs.ICALP.2021.76,
author = {Gu, Yong and Ren, Hanlin},
title = {{Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {76:1--76:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.76},
URN = {urn:nbn:de:0030-drops-141450},
doi = {10.4230/LIPIcs.ICALP.2021.76},
annote = {Keywords: graph theory, shortest paths, distance sensitivity oracles}
}
@InProceedings{gupta_et_al:LIPIcs.ICALP.2021.77,
author = {Gupta, Anupam and Moseley, Benjamin and Zhou, Rudy},
title = {{Structural Iterative Rounding for Generalized k-Median Problems}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {77:1--77:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.77},
URN = {urn:nbn:de:0030-drops-141465},
doi = {10.4230/LIPIcs.ICALP.2021.77},
annote = {Keywords: approximation algorithms, clustering, linear programming}
}
@InProceedings{haeupler_et_al:LIPIcs.ICALP.2021.78,
author = {Haeupler, Bernhard and Hershkowitz, D. Ellis and Wajc, David},
title = {{Near-Optimal Schedules for Simultaneous Multicasts}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {78:1--78:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.78},
URN = {urn:nbn:de:0030-drops-141471},
doi = {10.4230/LIPIcs.ICALP.2021.78},
annote = {Keywords: Packet routing, multicast, scheduling algorithms}
}
@InProceedings{hartmann_et_al:LIPIcs.ICALP.2021.79,
author = {Hartmann, Maria and Kozma, L\'{a}szl\'{o} and Sinnamon, Corwin and Tarjan, Robert E.},
title = {{Analysis of Smooth Heaps and Slim Heaps}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {79:1--79:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.79},
URN = {urn:nbn:de:0030-drops-141482},
doi = {10.4230/LIPIcs.ICALP.2021.79},
annote = {Keywords: data structure, heap, priority queue, amortized analysis, self-adjusting}
}
@InProceedings{huang_et_al:LIPIcs.ICALP.2021.80,
author = {Huang, Chien-Chung and Mari, Mathieu and Mathieu, Claire and Vygen, Jens},
title = {{Approximating Maximum Integral Multiflows on Bounded Genus Graphs}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {80:1--80:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.80},
URN = {urn:nbn:de:0030-drops-141491},
doi = {10.4230/LIPIcs.ICALP.2021.80},
annote = {Keywords: Multi-commodity flows, approximation algorithms, bounded genus graphs}
}
@InProceedings{ibrahimpur_et_al:LIPIcs.ICALP.2021.81,
author = {Ibrahimpur, Sharat and Swamy, Chaitanya},
title = {{Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {81:1--81:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.81},
URN = {urn:nbn:de:0030-drops-141504},
doi = {10.4230/LIPIcs.ICALP.2021.81},
annote = {Keywords: Approximation algorithms, Load balancing, Minimum-norm optimization, LP rounding}
}
@InProceedings{jee_et_al:LIPIcs.ICALP.2021.82,
author = {Jee, Hyejung H. and Sparaciari, Carlo and Fawzi, Omar and Berta, Mario},
title = {{Quasi-Polynomial Time Algorithms for Free Quantum Games in Bounded Dimension}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {82:1--82:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.82},
URN = {urn:nbn:de:0030-drops-141514},
doi = {10.4230/LIPIcs.ICALP.2021.82},
annote = {Keywords: non-local game, semidefinite programming, quantum correlation, approximation algorithm, Lasserre hierarchy, de Finetti theorem}
}
@InProceedings{karczmarz:LIPIcs.ICALP.2021.83,
author = {Karczmarz, Adam},
title = {{Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {83:1--83:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.83},
URN = {urn:nbn:de:0030-drops-141521},
doi = {10.4230/LIPIcs.ICALP.2021.83},
annote = {Keywords: Dynamic graph algorithms, minimum weight cycle, dynamic shortest paths}
}
@InProceedings{kaufman_et_al:LIPIcs.ICALP.2021.84,
author = {Kaufman, Tali and Oppenheim, Izhar},
title = {{Coboundary and Cosystolic Expansion from Strong Symmetry}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {84:1--84:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.84},
URN = {urn:nbn:de:0030-drops-141539},
doi = {10.4230/LIPIcs.ICALP.2021.84},
annote = {Keywords: High dimensional expanders, Cosystolic expansion, Coboundary expansion}
}
@InProceedings{kavitha:LIPIcs.ICALP.2021.85,
author = {Kavitha, Telikepalli},
title = {{Maximum Matchings and Popularity}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {85:1--85:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.85},
URN = {urn:nbn:de:0030-drops-141548},
doi = {10.4230/LIPIcs.ICALP.2021.85},
annote = {Keywords: Bipartite graphs, Popular matchings, Stable matchings, Dual certificates}
}
@InProceedings{kawarabayashi_et_al:LIPIcs.ICALP.2021.86,
author = {Kawarabayashi, Ken-ichi and Mohar, Bojan and Nedela, Roman and Zeman, Peter},
title = {{Automorphisms and Isomorphisms of Maps in Linear Time}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {86:1--86:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.86},
URN = {urn:nbn:de:0030-drops-141558},
doi = {10.4230/LIPIcs.ICALP.2021.86},
annote = {Keywords: maps on surfaces, automorphisms, isomorphisms, algorithm}
}
@InProceedings{korhonen:LIPIcs.ICALP.2021.87,
author = {Korhonen, Tuukka},
title = {{Lower Bounds on Dynamic Programming for Maximum Weight Independent Set}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {87:1--87:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.87},
URN = {urn:nbn:de:0030-drops-141562},
doi = {10.4230/LIPIcs.ICALP.2021.87},
annote = {Keywords: Maximum weight independent set, Treewidth, Tropical circuits, Dynamic programming, Treedepth, Monotone circuit complexity}
}
@InProceedings{koucky_et_al:LIPIcs.ICALP.2021.88,
author = {Kouck\'{y}, Michal and Kr\'{a}l, Karel},
title = {{Sorting Short Integers}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {88:1--88:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.88},
URN = {urn:nbn:de:0030-drops-141577},
doi = {10.4230/LIPIcs.ICALP.2021.88},
annote = {Keywords: sorting, small integers, boolean circuits}
}
@InProceedings{kozik:LIPIcs.ICALP.2021.89,
author = {Kozik, Jakub},
title = {{Improving Gebauer’s Construction of 3-Chromatic Hypergraphs with Few Edges}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {89:1--89:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.89},
URN = {urn:nbn:de:0030-drops-141587},
doi = {10.4230/LIPIcs.ICALP.2021.89},
annote = {Keywords: Property B, Hypergraph Coloring, Deterministic Constructions}
}
@InProceedings{kurpisz_et_al:LIPIcs.ICALP.2021.90,
author = {Kurpisz, Adam and Potechin, Aaron and Wirth, Elias Samuel},
title = {{SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {90:1--90:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.90},
URN = {urn:nbn:de:0030-drops-141595},
doi = {10.4230/LIPIcs.ICALP.2021.90},
annote = {Keywords: symmetric quadratic functions, SoS certificate, hypercube optimization, semidefinite programming}
}
@InProceedings{lagodzinski_et_al:LIPIcs.ICALP.2021.91,
author = {Lagodzinski, J. A. Gregor and G\"{o}bel, Andreas and Casel, Katrin and Friedrich, Tobias},
title = {{On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {91:1--91:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.91},
URN = {urn:nbn:de:0030-drops-141608},
doi = {10.4230/LIPIcs.ICALP.2021.91},
annote = {Keywords: Algorithms, Theory, Quantum Graphs, Bipartite Graphs, Graph Homomorphisms, Modular Counting, Complexity Dichotomy}
}
@InProceedings{lampis:LIPIcs.ICALP.2021.92,
author = {Lampis, Michael},
title = {{Minimum Stable Cut and Treewidth}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {92:1--92:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.92},
URN = {urn:nbn:de:0030-drops-141616},
doi = {10.4230/LIPIcs.ICALP.2021.92},
annote = {Keywords: Treewidth, Local Max-Cut, Nash Stability}
}
@InProceedings{levi:LIPIcs.ICALP.2021.93,
author = {Levi, Reut},
title = {{Testing Triangle Freeness in the General Model in Graphs with Arboricity O(√n)}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {93:1--93:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.93},
URN = {urn:nbn:de:0030-drops-141626},
doi = {10.4230/LIPIcs.ICALP.2021.93},
annote = {Keywords: Property Testing, Triangle-Freeness}
}
@InProceedings{lu_et_al:LIPIcs.ICALP.2021.94,
author = {Lu, Zhenjian and Oliveira, Igor C.},
title = {{An Efficient Coding Theorem via Probabilistic Representations and Its Applications}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {94:1--94:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.94},
URN = {urn:nbn:de:0030-drops-141630},
doi = {10.4230/LIPIcs.ICALP.2021.94},
annote = {Keywords: computational complexity, randomized algorithms, Kolmogorov complexity}
}
@InProceedings{marx_et_al:LIPIcs.ICALP.2021.95,
author = {Marx, D\'{a}niel and Sankar, Govind S. and Schepper, Philipp},
title = {{Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {95:1--95:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.95},
URN = {urn:nbn:de:0030-drops-141647},
doi = {10.4230/LIPIcs.ICALP.2021.95},
annote = {Keywords: General Factor, General Matching, Treewidth, Cutwidth}
}
@InProceedings{mckenzie_et_al:LIPIcs.ICALP.2021.96,
author = {McKenzie, Theo and Mohanty, Sidhanth},
title = {{High-Girth Near-Ramanujan Graphs with Lossy Vertex Expansion}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {96:1--96:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.96},
URN = {urn:nbn:de:0030-drops-141655},
doi = {10.4230/LIPIcs.ICALP.2021.96},
annote = {Keywords: expander graphs, Ramanujan graphs, vertex expansion, girth}
}
@InProceedings{moseley_et_al:LIPIcs.ICALP.2021.97,
author = {Moseley, Benjamin and Pruhs, Kirk and Samadian, Alireza and Wang, Yuyan},
title = {{Relational Algorithms for k-Means Clustering}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {97:1--97:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.97},
URN = {urn:nbn:de:0030-drops-141668},
doi = {10.4230/LIPIcs.ICALP.2021.97},
annote = {Keywords: k-means, clustering, approximation, big-data, databases}
}
@InProceedings{nakar_et_al:LIPIcs.ICALP.2021.98,
author = {Nakar, Yonatan and Ron, Dana},
title = {{Testing Dynamic Environments: Back to Basics}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {98:1--98:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.98},
URN = {urn:nbn:de:0030-drops-141672},
doi = {10.4230/LIPIcs.ICALP.2021.98},
annote = {Keywords: Property Testing}
}
@InProceedings{neumann_et_al:LIPIcs.ICALP.2021.99,
author = {Neumann, Eike and Ouaknine, Jo\"{e}l and Worrell, James},
title = {{Decision Problems for Second-Order Holonomic Recurrences}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {99:1--99:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.99},
URN = {urn:nbn:de:0030-drops-141682},
doi = {10.4230/LIPIcs.ICALP.2021.99},
annote = {Keywords: holonomic sequences, Positivity Problem, Skolem Problem}
}
@InProceedings{newman_et_al:LIPIcs.ICALP.2021.100,
author = {Newman, Ilan and Varma, Nithin},
title = {{New Sublinear Algorithms and Lower Bounds for LIS Estimation}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {100:1--100:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.100},
URN = {urn:nbn:de:0030-drops-141699},
doi = {10.4230/LIPIcs.ICALP.2021.100},
annote = {Keywords: longest increasing subsequence, monotonicity, distance estimation, sublinear algorithms}
}
@InProceedings{nishimoto_et_al:LIPIcs.ICALP.2021.101,
author = {Nishimoto, Takaaki and Tabei, Yasuo},
title = {{Optimal-Time Queries on BWT-Runs Compressed Indexes}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {101:1--101:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.101},
URN = {urn:nbn:de:0030-drops-141702},
doi = {10.4230/LIPIcs.ICALP.2021.101},
annote = {Keywords: Compressed text indexes, Burrows-Wheeler transform, highly repetitive text collections}
}
@InProceedings{parekh_et_al:LIPIcs.ICALP.2021.102,
author = {Parekh, Ojas and Thompson, Kevin},
title = {{Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation Algorithms}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {102:1--102:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.102},
URN = {urn:nbn:de:0030-drops-141718},
doi = {10.4230/LIPIcs.ICALP.2021.102},
annote = {Keywords: Quantum Max Cut, Quantum Approximation Algorithms, Lasserre Hierarchy, Local Hamiltonian, Heisenberg model}
}
@InProceedings{peserico_et_al:LIPIcs.ICALP.2021.103,
author = {Peserico, Enoch and Scquizzato, Michele},
title = {{Matching on the Line Admits No o(√log n)-Competitive Algorithm}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {103:1--103:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.103},
URN = {urn:nbn:de:0030-drops-141720},
doi = {10.4230/LIPIcs.ICALP.2021.103},
annote = {Keywords: Metric matching, online algorithms, competitive analysis}
}
@InProceedings{pettie_et_al:LIPIcs.ICALP.2021.104,
author = {Pettie, Seth and Wang, Dingyu and Yin, Longhui},
title = {{Non-Mergeable Sketching for Cardinality Estimation}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {104:1--104:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.104},
URN = {urn:nbn:de:0030-drops-141731},
doi = {10.4230/LIPIcs.ICALP.2021.104},
annote = {Keywords: Cardinality Estimation, Sketching}
}
@InProceedings{pettie_et_al:LIPIcs.ICALP.2021.105,
author = {Pettie, Seth and Yin, Longhui},
title = {{The Structure of Minimum Vertex Cuts}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {105:1--105:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.105},
URN = {urn:nbn:de:0030-drops-141746},
doi = {10.4230/LIPIcs.ICALP.2021.105},
annote = {Keywords: Graph theory, vertex connectivity, data structures}
}
@InProceedings{polak_et_al:LIPIcs.ICALP.2021.106,
author = {Polak, Adam and Rohwedder, Lars and W\k{e}grzycki, Karol},
title = {{Knapsack and Subset Sum with Small Items}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {106:1--106:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.106},
URN = {urn:nbn:de:0030-drops-141752},
doi = {10.4230/LIPIcs.ICALP.2021.106},
annote = {Keywords: Knapsack, Subset Sum, Proximity, Additive Combinatorics, Multiset}
}
@InProceedings{rivera_et_al:LIPIcs.ICALP.2021.107,
author = {Rivera, Nicol\'{a}s and Sauerwald, Thomas and Sylvester, John},
title = {{Multiple Random Walks on Graphs: Mixing Few to Cover Many}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {107:1--107:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.107},
URN = {urn:nbn:de:0030-drops-141764},
doi = {10.4230/LIPIcs.ICALP.2021.107},
annote = {Keywords: Multiple Random walks, Markov Chains, Random Walks, Cover Time}
}
@InProceedings{roth_et_al:LIPIcs.ICALP.2021.108,
author = {Roth, Marc and Schmitt, Johannes and Wellnitz, Philip},
title = {{Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {108:1--108:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.108},
URN = {urn:nbn:de:0030-drops-141778},
doi = {10.4230/LIPIcs.ICALP.2021.108},
annote = {Keywords: Counting complexity, parameterized complexity, Tutte polynomial}
}
@InProceedings{saberi_et_al:LIPIcs.ICALP.2021.109,
author = {Saberi, Amin and Wajc, David},
title = {{The Greedy Algorithm Is not Optimal for On-Line Edge Coloring}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {109:1--109:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.109},
URN = {urn:nbn:de:0030-drops-141786},
doi = {10.4230/LIPIcs.ICALP.2021.109},
annote = {Keywords: Online algorithms, edge coloring, greedy, online matching}
}
@InProceedings{vanapeldoorn_et_al:LIPIcs.ICALP.2021.110,
author = {van Apeldoorn, Joran and Gribling, Sander and Li, Yinan and Nieuwboer, Harold and Walter, Michael and de Wolf, Ronald},
title = {{Quantum Algorithms for Matrix Scaling and Matrix Balancing}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {110:1--110:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.110},
URN = {urn:nbn:de:0030-drops-141793},
doi = {10.4230/LIPIcs.ICALP.2021.110},
annote = {Keywords: Matrix scaling, matrix balancing, quantum algorithms}
}
@InProceedings{viola:LIPIcs.ICALP.2021.111,
author = {Viola, Emanuele},
title = {{Fourier Conjectures, Correlation Bounds, and Majority}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {111:1--111:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.111},
URN = {urn:nbn:de:0030-drops-141806},
doi = {10.4230/LIPIcs.ICALP.2021.111},
annote = {Keywords: Fourier analysis, polynomials, Majority, correlation, lower bound, conjectures}
}
@InProceedings{woodruff_et_al:LIPIcs.ICALP.2021.112,
author = {Woodruff, David P. and Zhou, Samson},
title = {{Separations for Estimating Large Frequency Moments on Data Streams}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {112:1--112:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.112},
URN = {urn:nbn:de:0030-drops-141810},
doi = {10.4230/LIPIcs.ICALP.2021.112},
annote = {Keywords: streaming algorithms, frequency moments, random order, lower bounds}
}
@InProceedings{zamir:LIPIcs.ICALP.2021.113,
author = {Zamir, Or},
title = {{Breaking the 2ⁿ Barrier for 5-Coloring and 6-Coloring}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {113:1--113:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.113},
URN = {urn:nbn:de:0030-drops-141825},
doi = {10.4230/LIPIcs.ICALP.2021.113},
annote = {Keywords: Algorithms, Graph Algorithms, Graph Coloring}
}
@InProceedings{zhang:LIPIcs.ICALP.2021.114,
author = {Zhang, Tianyi},
title = {{Deterministic Maximum Flows in Simple Graphs}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {114:1--114:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.114},
URN = {urn:nbn:de:0030-drops-141832},
doi = {10.4230/LIPIcs.ICALP.2021.114},
annote = {Keywords: graph algorithms, maximum flows, dynamic data structures}
}
@InProceedings{abramsky_et_al:LIPIcs.ICALP.2021.115,
author = {Abramsky, Samson and Reggio, Luca},
title = {{Arboreal Categories and Resources}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {115:1--115:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.115},
URN = {urn:nbn:de:0030-drops-141845},
doi = {10.4230/LIPIcs.ICALP.2021.115},
annote = {Keywords: factorisation system, embedding, comonad, coalgebra, open maps, bisimulation, game, resources, relational structures, finite model theory}
}
@InProceedings{amarilli_et_al:LIPIcs.ICALP.2021.116,
author = {Amarilli, Antoine and Jachiet, Louis and Paperman, Charles},
title = {{Dynamic Membership for Regular Languages}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {116:1--116:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.116},
URN = {urn:nbn:de:0030-drops-141850},
doi = {10.4230/LIPIcs.ICALP.2021.116},
annote = {Keywords: regular language, membership, RAM model, updates, dynamic}
}
@InProceedings{baldan_et_al:LIPIcs.ICALP.2021.117,
author = {Baldan, Paolo and Ranzato, Francesco and Zhang, Linpeng},
title = {{A Rice’s Theorem for Abstract Semantics}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {117:1--117:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.117},
URN = {urn:nbn:de:0030-drops-141860},
doi = {10.4230/LIPIcs.ICALP.2021.117},
annote = {Keywords: Computability Theory, Recursive Function, Rice’s Theorem, Kleene’s Second Recursion Theorem, Program Analysis, Affine Program Invariants}
}
@InProceedings{balle_et_al:LIPIcs.ICALP.2021.118,
author = {Balle, Borja and Lacroce, Clara and Panangaden, Prakash and Precup, Doina and Rabusseau, Guillaume},
title = {{Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {118:1--118:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.118},
URN = {urn:nbn:de:0030-drops-141873},
doi = {10.4230/LIPIcs.ICALP.2021.118},
annote = {Keywords: Weighted finite automata, approximate minimization, Hankel matrices, AAK Theory}
}
@InProceedings{bathie_et_al:LIPIcs.ICALP.2021.119,
author = {Bathie, Gabriel and Starikovskaya, Tatiana},
title = {{Property Testing of Regular Languages with Applications to Streaming Property Testing of Visibly Pushdown Languages}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {119:1--119:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.119},
URN = {urn:nbn:de:0030-drops-141881},
doi = {10.4230/LIPIcs.ICALP.2021.119},
annote = {Keywords: property testing, regular languages, streaming algorithms, visibly pushdown languages}
}
@InProceedings{bodirsky_et_al:LIPIcs.ICALP.2021.120,
author = {Bodirsky, Manuel and Kn\"{a}uer, Simon and Rudolph, Sebastian},
title = {{Datalog-Expressibility for Monadic and Guarded Second-Order Logic}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {120:1--120:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.120},
URN = {urn:nbn:de:0030-drops-141897},
doi = {10.4230/LIPIcs.ICALP.2021.120},
annote = {Keywords: Monadic Second-order Logic, Guarded Second-order Logic, Datalog, constraint satisfaction, homomorphism-closed, conjunctive query, primitive positive formula, pebble game, \omega-categoricity}
}
@InProceedings{brandts_et_al:LIPIcs.ICALP.2021.121,
author = {Brandts, Alex and \v{Z}ivn\'{y}, Stanislav},
title = {{Beyond PCSP(1-in-3, NAE)}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {121:1--121:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.121},
URN = {urn:nbn:de:0030-drops-141902},
doi = {10.4230/LIPIcs.ICALP.2021.121},
annote = {Keywords: promise constraint satisfaction, PCSP, polymorphisms, algebraic approach}
}
@InProceedings{callard_et_al:LIPIcs.ICALP.2021.122,
author = {Callard, Antonin and Vanier, Pascal},
title = {{Computational Characterization of Surface Entropies for \mathbb{Z}² Subshifts of Finite Type}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {122:1--122:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.122},
URN = {urn:nbn:de:0030-drops-141914},
doi = {10.4230/LIPIcs.ICALP.2021.122},
annote = {Keywords: surface entropy, arithmetical hierarchy of real numbers, 2D subshifts, symbolic dynamics}
}
@InProceedings{casares_et_al:LIPIcs.ICALP.2021.123,
author = {Casares, Antonio and Colcombet, Thomas and Fijalkow, Nathana\"{e}l},
title = {{Optimal Transformations of Games and Automata Using Muller Conditions}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {123:1--123:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.123},
URN = {urn:nbn:de:0030-drops-141928},
doi = {10.4230/LIPIcs.ICALP.2021.123},
annote = {Keywords: Automata over infinite words, Omega regular languages, Determinisation of automata}
}
@InProceedings{chatterjee_et_al:LIPIcs.ICALP.2021.124,
author = {Chatterjee, Krishnendu and Henzinger, Monika and Kale, Sagar Sudhir and Svozil, Alexander},
title = {{Faster Algorithms for Bounded Liveness in Graphs and Game Graphs}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {124:1--124:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.124},
URN = {urn:nbn:de:0030-drops-141930},
doi = {10.4230/LIPIcs.ICALP.2021.124},
annote = {Keywords: Graphs, Game Graphs, B\"{u}chi}
}
@InProceedings{ciccone_et_al:LIPIcs.ICALP.2021.125,
author = {Ciccone, Luca and Padovani, Luca},
title = {{Inference Systems with Corules for Fair Subtyping and Liveness Properties of Binary Session Types}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {125:1--125:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.125},
URN = {urn:nbn:de:0030-drops-141941},
doi = {10.4230/LIPIcs.ICALP.2021.125},
annote = {Keywords: Inference systems, session types, safety, liveness, induction, coinduction}
}
@InProceedings{clemente_et_al:LIPIcs.ICALP.2021.126,
author = {Clemente, Lorenzo and Skrzypczak, Micha{\l}},
title = {{Deterministic and Game Separability for Regular Languages of Infinite Trees}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {126:1--126:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.126},
URN = {urn:nbn:de:0030-drops-141952},
doi = {10.4230/LIPIcs.ICALP.2021.126},
annote = {Keywords: separation, infinite trees, regular languages, deterministic automata, game automata}
}
@InProceedings{colcombet_et_al:LIPIcs.ICALP.2021.127,
author = {Colcombet, Thomas and Jaquard, Arthur},
title = {{A Complexity Approach to Tree Algebras: the Bounded Case}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {127:1--127:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.127},
URN = {urn:nbn:de:0030-drops-141966},
doi = {10.4230/LIPIcs.ICALP.2021.127},
annote = {Keywords: Tree algebra, infinite tree, language theory}
}
@InProceedings{czerwinski_et_al:LIPIcs.ICALP.2021.128,
author = {Czerwi\'{n}ski, Wojciech and Lasota, S{\l}awomir and Orlikowski, {\L}ukasz},
title = {{Improved Lower Bounds for Reachability in Vector Addition Systems}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {128:1--128:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.128},
URN = {urn:nbn:de:0030-drops-141973},
doi = {10.4230/LIPIcs.ICALP.2021.128},
annote = {Keywords: Petri nets, vector addition systems, reachability problem}
}
@InProceedings{czerwinski_et_al:LIPIcs.ICALP.2021.129,
author = {Czerwi\'{n}ski, Wojciech and Mottet, Antoine and Quaas, Karin},
title = {{New Techniques for Universality in Unambiguous Register Automata}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {129:1--129:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.129},
URN = {urn:nbn:de:0030-drops-141983},
doi = {10.4230/LIPIcs.ICALP.2021.129},
annote = {Keywords: Register Automata, Data Languages, Unambiguity, Unambiguous, Universality, Containment, Language Inclusion, Equivalence}
}
@InProceedings{freydenberger_et_al:LIPIcs.ICALP.2021.130,
author = {Freydenberger, Dominik D. and Peterfreund, Liat},
title = {{The Theory of Concatenation over Finite Models}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {130:1--130:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.130},
URN = {urn:nbn:de:0030-drops-141997},
doi = {10.4230/LIPIcs.ICALP.2021.130},
annote = {Keywords: finite model theory, word equations, descriptive complexity, model checking, document spanners}
}
@InProceedings{goncharov:LIPIcs.ICALP.2021.131,
author = {Goncharov, Sergey},
title = {{Uniform Elgot Iteration in Foundations}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {131:1--131:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.131},
URN = {urn:nbn:de:0030-drops-142007},
doi = {10.4230/LIPIcs.ICALP.2021.131},
annote = {Keywords: Elgot monad, partiality monad, delay monad, restriction category}
}
@InProceedings{goy_et_al:LIPIcs.ICALP.2021.132,
author = {Goy, Alexandre and Petri\c{s}an, Daniela and Aiguier, Marc},
title = {{Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {132:1--132:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.132},
URN = {urn:nbn:de:0030-drops-142016},
doi = {10.4230/LIPIcs.ICALP.2021.132},
annote = {Keywords: Egli-Milner relation, weak extension, weak distributive law, weak lifting, powerset monad, Vietoris monad, topos, alternating automaton, generalized determinization}
}
@InProceedings{gradel_et_al:LIPIcs.ICALP.2021.133,
author = {Gr\"{a}del, Erich and Mrkonji\'{c}, Lovro},
title = {{Elementary Equivalence Versus Isomorphism in Semiring Semantics}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {133:1--133:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.133},
URN = {urn:nbn:de:0030-drops-142022},
doi = {10.4230/LIPIcs.ICALP.2021.133},
annote = {Keywords: Semiring semantics, elementary equivalence, axiomatisability}
}
@InProceedings{grohe_et_al:LIPIcs.ICALP.2021.134,
author = {Grohe, Martin and Kiefer, Sandra},
title = {{Logarithmic Weisfeiler-Leman Identifies All Planar Graphs}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {134:1--134:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.134},
URN = {urn:nbn:de:0030-drops-142035},
doi = {10.4230/LIPIcs.ICALP.2021.134},
annote = {Keywords: Weisfeiler-Leman algorithm, finite-variable logic, isomorphism testing, planar graphs, quantifier depth, iteration number}
}
@InProceedings{istrate_et_al:LIPIcs.ICALP.2021.135,
author = {Istrate, Gabriel and Bonchi\c{s}, Cosmin and Cr\u{a}ciun, Adrian},
title = {{Kernelization, Proof Complexity and Social Choice}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {135:1--135:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.135},
URN = {urn:nbn:de:0030-drops-142043},
doi = {10.4230/LIPIcs.ICALP.2021.135},
annote = {Keywords: Kernelization, Frege proofs, Kneser-Lov\'{a}sz Theorem, Arrow’s theorem, Gibbard-Satterthwaite theorem}
}
@InProceedings{li_et_al:LIPIcs.ICALP.2021.136,
author = {Li, Yangjia and Unruh, Dominique},
title = {{Quantum Relational Hoare Logic with Expectations}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {136:1--136:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.136},
URN = {urn:nbn:de:0030-drops-142058},
doi = {10.4230/LIPIcs.ICALP.2021.136},
annote = {Keywords: Quantum cryptography, Hoare logics, formal verification}
}
@InProceedings{monmege_et_al:LIPIcs.ICALP.2021.137,
author = {Monmege, Benjamin and Parreaux, Julie and Reynier, Pierre-Alain},
title = {{Playing Stochastically in Weighted Timed Games to Emulate Memory}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {137:1--137:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.137},
URN = {urn:nbn:de:0030-drops-142066},
doi = {10.4230/LIPIcs.ICALP.2021.137},
annote = {Keywords: Weighted timed games, Algorithmic game theory, Randomisation}
}
@InProceedings{mottet_et_al:LIPIcs.ICALP.2021.138,
author = {Mottet, Antoine and Nagy, Tom\'{a}\v{s} and Pinsker, Michael and Wrona, Micha{\l}},
title = {{Smooth Approximations and Relational Width Collapses}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {138:1--138:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.138},
URN = {urn:nbn:de:0030-drops-142075},
doi = {10.4230/LIPIcs.ICALP.2021.138},
annote = {Keywords: local consistency, bounded width, constraint satisfaction problems, polymorphisms, smooth approximations}
}
@InProceedings{nguyen_et_al:LIPIcs.ICALP.2021.139,
author = {Nguy\~{ê}n, L\^{e} Th\`{a}nh D\~{u}ng (Tito) and No\^{u}s, Camille and Pradic, Pierre},
title = {{Comparison-Free Polyregular Functions}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {139:1--139:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.139},
URN = {urn:nbn:de:0030-drops-142087},
doi = {10.4230/LIPIcs.ICALP.2021.139},
annote = {Keywords: pebble transducers, HDT0L systems, polyregular functions}
}
@InProceedings{parys:LIPIcs.ICALP.2021.140,
author = {Parys, Pawe{\l}},
title = {{Higher-Order Model Checking Step by Step}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {140:1--140:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.140},
URN = {urn:nbn:de:0030-drops-142098},
doi = {10.4230/LIPIcs.ICALP.2021.140},
annote = {Keywords: Higher-order recursion schemes, Parity automata, Model-checking, Transformation, Order reduction}
}
@InProceedings{pratthartmann:LIPIcs.ICALP.2021.141,
author = {Pratt-Hartmann, Ian},
title = {{Fluted Logic with Counting}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {141:1--141:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.141},
URN = {urn:nbn:de:0030-drops-142101},
doi = {10.4230/LIPIcs.ICALP.2021.141},
annote = {Keywords: Fluted fragment, counting quantifiers, satisfiability, complexity}
}
@InProceedings{schmid_et_al:LIPIcs.ICALP.2021.142,
author = {Schmid, Todd and Kapp\'{e}, Tobias and Kozen, Dexter and Silva, Alexandra},
title = {{Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {142:1--142:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.142},
URN = {urn:nbn:de:0030-drops-142118},
doi = {10.4230/LIPIcs.ICALP.2021.142},
annote = {Keywords: Kleene algebra, program equivalence, completeness, coequations}
}
@InProceedings{xu_et_al:LIPIcs.ICALP.2021.143,
author = {Xu, Han and Hu, Zhenjiang},
title = {{Analytical Differential Calculus with Integration}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {143:1--143:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.143},
URN = {urn:nbn:de:0030-drops-142127},
doi = {10.4230/LIPIcs.ICALP.2021.143},
annote = {Keywords: Differential Calculus, Integration, Lambda Calculus, Incremental Computation, Adaptive Computing}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing