@Proceedings{czumaj_et_al:LIPIcs.ICALP.2020,
title = {{LIPIcs, Volume 168, ICALP 2020, Complete Volume}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {1--2446},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020},
URN = {urn:nbn:de:0030-drops-124067},
doi = {10.4230/LIPIcs.ICALP.2020},
annote = {Keywords: LIPIcs, Volume 168, ICALP 2020, Complete Volume}
}
@InProceedings{czumaj_et_al:LIPIcs.ICALP.2020.0,
author = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {0:i--0:xxxvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.0},
URN = {urn:nbn:de:0030-drops-124075},
doi = {10.4230/LIPIcs.ICALP.2020.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{yao:LIPIcs.ICALP.2020.1,
author = {Yao, Andrew Chi chih},
title = {{An Incentive Analysis of Some Bitcoin Fee Designs}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {1:1--1:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.1},
URN = {urn:nbn:de:0030-drops-124087},
doi = {10.4230/LIPIcs.ICALP.2020.1},
annote = {Keywords: Bitcoin, blockchain, incentive compatibility, maximum revenue, mechanism design}
}
@InProceedings{krauthgamer:LIPIcs.ICALP.2020.2,
author = {Krauthgamer, Robert},
title = {{Sketching Graphs and Combinatorial Optimization}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.2},
URN = {urn:nbn:de:0030-drops-124090},
doi = {10.4230/LIPIcs.ICALP.2020.2},
annote = {Keywords: Sketching, edge sparsification, vertex sparsification, Gomory-Hu tree, mimicking networks, graph sampling, succinct data structures}
}
@InProceedings{kiefer_et_al:LIPIcs.ICALP.2020.3,
author = {Kiefer, Stefan and Mayr, Richard and Shirmohammadi, Mahsa and Totzke, Patrick and Wojtczak, Dominik},
title = {{How to Play in Infinite MDPs}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {3:1--3:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.3},
URN = {urn:nbn:de:0030-drops-124103},
doi = {10.4230/LIPIcs.ICALP.2020.3},
annote = {Keywords: Markov decision processes}
}
@InProceedings{abboud_et_al:LIPIcs.ICALP.2020.4,
author = {Abboud, Amir and Bringmann, Karl and Hermelin, Danny and Shabtay, Dvir},
title = {{Scheduling Lower Bounds via AND Subset Sum}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {4:1--4:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.4},
URN = {urn:nbn:de:0030-drops-124119},
doi = {10.4230/LIPIcs.ICALP.2020.4},
annote = {Keywords: SETH, fine grained complexity, Subset Sum, scheduling}
}
@InProceedings{abboud_et_al:LIPIcs.ICALP.2020.5,
author = {Abboud, Amir and Feller, Shon and Weimann, Oren},
title = {{On the Fine-Grained Complexity of Parity Problems}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {5:1--5:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.5},
URN = {urn:nbn:de:0030-drops-124127},
doi = {10.4230/LIPIcs.ICALP.2020.5},
annote = {Keywords: All-pairs shortest paths, Fine-grained complexity, Diameter, Distance product, Min-plus convolution, Parity problems}
}
@InProceedings{alaluf_et_al:LIPIcs.ICALP.2020.6,
author = {Alaluf, Naor and Ene, Alina and Feldman, Moran and Nguyen, Huy L. and Suh, Andrew},
title = {{Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {6:1--6:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.6},
URN = {urn:nbn:de:0030-drops-124137},
doi = {10.4230/LIPIcs.ICALP.2020.6},
annote = {Keywords: Submodular maximization, streaming algorithms, cardinality constraint}
}
@InProceedings{alistarh_et_al:LIPIcs.ICALP.2020.7,
author = {Alistarh, Dan and Nadiradze, Giorgi and Sabour, Amirmojtaba},
title = {{Dynamic Averaging Load Balancing on Cycles}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {7:1--7:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.7},
URN = {urn:nbn:de:0030-drops-124142},
doi = {10.4230/LIPIcs.ICALP.2020.7},
annote = {Keywords: Algorithms, Load Balancing}
}
@InProceedings{bahrani_et_al:LIPIcs.ICALP.2020.8,
author = {Bahrani, Maryam and Immorlica, Nicole and Mohan, Divyarthi and Weinberg, S. Matthew},
title = {{Asynchronous Majority Dynamics in Preferential Attachment Trees}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {8:1--8:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.8},
URN = {urn:nbn:de:0030-drops-124156},
doi = {10.4230/LIPIcs.ICALP.2020.8},
annote = {Keywords: Opinion Dynamics, Information Cascades, Preferential Attachment, Majority Dynamics, non-Bayesian Asynchronous Learning, Stochastic Processes}
}
@InProceedings{bassilakis_et_al:LIPIcs.ICALP.2020.9,
author = {Bassilakis, Andrew and Drucker, Andrew and G\"{o}\"{o}s, Mika and Hu, Lunjia and Ma, Weiyun and Tan, Li-Yang},
title = {{The Power of Many Samples in Query Complexity}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {9:1--9:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.9},
URN = {urn:nbn:de:0030-drops-124163},
doi = {10.4230/LIPIcs.ICALP.2020.9},
annote = {Keywords: Query complexity, Composition theorems}
}
@InProceedings{beneteau_et_al:LIPIcs.ICALP.2020.10,
author = {B\'{e}n\'{e}teau, Laurine and Chalopin, J\'{e}r\'{e}mie and Chepoi, Victor and Vax\`{e}s, Yann},
title = {{Medians in Median Graphs and Their Cube Complexes in Linear Time}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {10:1--10:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.10},
URN = {urn:nbn:de:0030-drops-124171},
doi = {10.4230/LIPIcs.ICALP.2020.10},
annote = {Keywords: Median Graph, CAT(0) Cube Complex, Median Problem, Linear Time Algorithm, LexBFS}
}
@InProceedings{bera_et_al:LIPIcs.ICALP.2020.11,
author = {Bera, Suman K. and Chakrabarti, Amit and Ghosh, Prantar},
title = {{Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {11:1--11:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.11},
URN = {urn:nbn:de:0030-drops-124182},
doi = {10.4230/LIPIcs.ICALP.2020.11},
annote = {Keywords: Data streaming, Graph coloring, Sublinear algorithms, Massively parallel communication, Distributed algorithms}
}
@InProceedings{bernstein:LIPIcs.ICALP.2020.12,
author = {Bernstein, Aaron},
title = {{Improved Bounds for Matching in Random-Order Streams}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {12:1--12:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.12},
URN = {urn:nbn:de:0030-drops-124194},
doi = {10.4230/LIPIcs.ICALP.2020.12},
annote = {Keywords: Graph Algorithms, Sublinear Algorithms, Matching, Streaming}
}
@InProceedings{bienkowski_et_al:LIPIcs.ICALP.2020.13,
author = {Bienkowski, Marcin and Pacut, Maciej and Piecuch, Krzysztof},
title = {{An Optimal Algorithm for Online Multiple Knapsack}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {13:1--13:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.13},
URN = {urn:nbn:de:0030-drops-124207},
doi = {10.4230/LIPIcs.ICALP.2020.13},
annote = {Keywords: online knapsack, multiple knapsacks, bin packing, competitive analysis}
}
@InProceedings{bille_et_al:LIPIcs.ICALP.2020.14,
author = {Bille, Philip and Ellert, Jonas and Fischer, Johannes and G{\o}rtz, Inge Li and Kurpicz, Florian and Munro, J. Ian and Rotenberg, Eva},
title = {{Space Efficient Construction of Lyndon Arrays in Linear Time}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {14:1--14:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.14},
URN = {urn:nbn:de:0030-drops-124211},
doi = {10.4230/LIPIcs.ICALP.2020.14},
annote = {Keywords: String algorithms, string suffixes, succinct data structures, Lyndon word, Lyndon array, nearest smaller values, nearest smaller suffixes}
}
@InProceedings{bodwin_et_al:LIPIcs.ICALP.2020.15,
author = {Bodwin, Greg and Choudhary, Keerti and Parter, Merav and Shahar, Noa},
title = {{New Fault Tolerant Subset Preservers}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {15:1--15:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.15},
URN = {urn:nbn:de:0030-drops-124222},
doi = {10.4230/LIPIcs.ICALP.2020.15},
annote = {Keywords: Subset Preservers, Distances, Fault-tolerance}
}
@InProceedings{bougeret_et_al:LIPIcs.ICALP.2020.16,
author = {Bougeret, Marin and Jansen, Bart M. P. and Sau, Ignasi},
title = {{Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {16:1--16:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.16},
URN = {urn:nbn:de:0030-drops-124238},
doi = {10.4230/LIPIcs.ICALP.2020.16},
annote = {Keywords: vertex cover, parameterized complexity, polynomial kernel, structural parameterization, bridge-depth}
}
@InProceedings{brandts_et_al:LIPIcs.ICALP.2020.17,
author = {Brandts, Alex and Wrochna, Marcin and \v{Z}ivn\'{y}, Stanislav},
title = {{The Complexity of Promise SAT on Non-Boolean Domains}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {17:1--17:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.17},
URN = {urn:nbn:de:0030-drops-124241},
doi = {10.4230/LIPIcs.ICALP.2020.17},
annote = {Keywords: promise constraint satisfaction, PCSP, polymorphisms, algebraic approach, label cover}
}
@InProceedings{brankovic_et_al:LIPIcs.ICALP.2020.18,
author = {Brankovic, Milutin and Grujic, Nikola and van Renssen, Andr\'{e} and Seybold, Martin P.},
title = {{A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {18:1--18:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.18},
URN = {urn:nbn:de:0030-drops-124253},
doi = {10.4230/LIPIcs.ICALP.2020.18},
annote = {Keywords: Dynamization, Trapezoidal Search Tree, Trapezoidal Search DAG, Backward Analysis, Point Location, Planar Subdivision, Treap, Order-maintenance}
}
@InProceedings{bringmann_et_al:LIPIcs.ICALP.2020.19,
author = {Bringmann, Karl and Fischer, Nick and Hermelin, Danny and Shabtay, Dvir and Wellnitz, Philip},
title = {{Faster Minimization of Tardy Processing Time on a Single Machine}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {19:1--19:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.19},
URN = {urn:nbn:de:0030-drops-124269},
doi = {10.4230/LIPIcs.ICALP.2020.19},
annote = {Keywords: Weighted number of tardy jobs, sumsets, convolutions}
}
@InProceedings{buchin_et_al:LIPIcs.ICALP.2020.20,
author = {Buchin, Kevin and Fan, Chenglin and L\"{o}ffler, Maarten and Popov, Aleksandr and Raichel, Benjamin and Roeloffzen, Marcel},
title = {{Fr\'{e}chet Distance for Uncertain Curves}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {20:1--20:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.20},
URN = {urn:nbn:de:0030-drops-124276},
doi = {10.4230/LIPIcs.ICALP.2020.20},
annote = {Keywords: Curves, Uncertainty, Fr\'{e}chet Distance, Hardness}
}
@InProceedings{bulatov_et_al:LIPIcs.ICALP.2020.21,
author = {Bulatov, Andrei A. and Dadsetan, Amineh},
title = {{Counting Homomorphisms in Plain Exponential Time}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {21:1--21:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.21},
URN = {urn:nbn:de:0030-drops-124287},
doi = {10.4230/LIPIcs.ICALP.2020.21},
annote = {Keywords: graph homomorphisms, plain exponential time, clique width}
}
@InProceedings{cai_et_al:LIPIcs.ICALP.2020.22,
author = {Cai, Jin-Yi and Fu, Zhiguo and Shao, Shuai},
title = {{From Holant to Quantum Entanglement and Back}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {22:1--22:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.22},
URN = {urn:nbn:de:0030-drops-124298},
doi = {10.4230/LIPIcs.ICALP.2020.22},
annote = {Keywords: Holant problem, Quantum entanglement, SLOCC equivalence, Bell property}
}
@InProceedings{cai_et_al:LIPIcs.ICALP.2020.23,
author = {Cai, Jin-Yi and Liu, Tianyu},
title = {{Counting Perfect Matchings and the Eight-Vertex Model}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {23:1--23:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.23},
URN = {urn:nbn:de:0030-drops-124301},
doi = {10.4230/LIPIcs.ICALP.2020.23},
annote = {Keywords: Approximate complexity, the eight-vertex model, counting perfect matchings}
}
@InProceedings{cen_et_al:LIPIcs.ICALP.2020.24,
author = {Cen, Ruoxu and Duan, Ran and Gu, Yong},
title = {{Roundtrip Spanners with (2k-1) Stretch}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {24:1--24:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.24},
URN = {urn:nbn:de:0030-drops-124313},
doi = {10.4230/LIPIcs.ICALP.2020.24},
annote = {Keywords: Graph theory, Deterministic algorithm, Roundtrip spanners}
}
@InProceedings{chakraborty_et_al:LIPIcs.ICALP.2020.25,
author = {Chakraborty, Diptarka and Choudhary, Keerti},
title = {{New Extremal Bounds for Reachability and Strong-Connectivity Preservers Under Failures}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {25:1--25:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.25},
URN = {urn:nbn:de:0030-drops-124327},
doi = {10.4230/LIPIcs.ICALP.2020.25},
annote = {Keywords: Preservers, Strong-connectivity, Reachability, Fault-tolerant, Graph sparsification}
}
@InProceedings{chan_et_al:LIPIcs.ICALP.2020.26,
author = {Chan, Timothy F. N. and Cooper, Jacob W. and Kouteck\'{y}, Martin and Kr\'{a}l', Daniel and Pek\'{a}rkov\'{a}, Krist\'{y}na},
title = {{Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {26:1--26:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.26},
URN = {urn:nbn:de:0030-drops-124339},
doi = {10.4230/LIPIcs.ICALP.2020.26},
annote = {Keywords: Matroid algorithms, width parameters, integer programming, fixed parameter tractability, branch-width, branch-depth}
}
@InProceedings{charalampopoulos_et_al:LIPIcs.ICALP.2020.27,
author = {Charalampopoulos, Panagiotis and Gawrychowski, Pawe{\l} and Pokorski, Karol},
title = {{Dynamic Longest Common Substring in Polylogarithmic Time}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {27:1--27:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.27},
URN = {urn:nbn:de:0030-drops-124340},
doi = {10.4230/LIPIcs.ICALP.2020.27},
annote = {Keywords: string algorithms, dynamic algorithms, longest common substring}
}
@InProceedings{chatterjee_et_al:LIPIcs.ICALP.2020.28,
author = {Chatterjee, Rohit and Liang, Xiao and Pandey, Omkant},
title = {{Improved Black-Box Constructions of Composable Secure Computation}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {28:1--28:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.28},
URN = {urn:nbn:de:0030-drops-124351},
doi = {10.4230/LIPIcs.ICALP.2020.28},
annote = {Keywords: Secure Multi-Party Computation, Black-Box, Composable, Non-Malleable}
}
@InProceedings{chechik_et_al:LIPIcs.ICALP.2020.29,
author = {Chechik, Shiri and Nechushtan, Moran},
title = {{Simplifying and Unifying Replacement Paths Algorithms in Weighted Directed Graphs}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {29:1--29:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.29},
URN = {urn:nbn:de:0030-drops-124365},
doi = {10.4230/LIPIcs.ICALP.2020.29},
annote = {Keywords: Fault tolerance, Distance oracle, Planar graph}
}
@InProceedings{chen_et_al:LIPIcs.ICALP.2020.30,
author = {Chen, Yu and Kannan, Sampath and Khanna, Sanjeev},
title = {{Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {30:1--30:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.30},
URN = {urn:nbn:de:0030-drops-124372},
doi = {10.4230/LIPIcs.ICALP.2020.30},
annote = {Keywords: sublinear algorithms, TSP, streaming algorithms, query complexity}
}
@InProceedings{chiu_et_al:LIPIcs.ICALP.2020.31,
author = {Chiu, Man-Kwun and Choudhary, Aruni and Mulzer, Wolfgang},
title = {{Computational Complexity of the \alpha-Ham-Sandwich Problem}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {31:1--31:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.31},
URN = {urn:nbn:de:0030-drops-124382},
doi = {10.4230/LIPIcs.ICALP.2020.31},
annote = {Keywords: Ham-Sandwich Theorem, Computational Complexity, Continuous Local Search}
}
@InProceedings{christodoulou_et_al:LIPIcs.ICALP.2020.32,
author = {Christodoulou, George and Gairing, Martin and Giannakopoulos, Yiannis and Po\c{c}as, Diogo and Waldmann, Clara},
title = {{Existence and Complexity of Approximate Equilibria in Weighted Congestion Games}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {32:1--32:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.32},
URN = {urn:nbn:de:0030-drops-124392},
doi = {10.4230/LIPIcs.ICALP.2020.32},
annote = {Keywords: Atomic congestion games, existence of equilibria, pure Nash equilibria, approximate equilibria, hardness of equilibria}
}
@InProceedings{chuzhoy_et_al:LIPIcs.ICALP.2020.33,
author = {Chuzhoy, Julia and Parter, Merav and Tan, Zihan},
title = {{On Packing Low-Diameter Spanning Trees}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {33:1--33:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.33},
URN = {urn:nbn:de:0030-drops-124405},
doi = {10.4230/LIPIcs.ICALP.2020.33},
annote = {Keywords: Spanning tree, packing, edge-connectivity}
}
@InProceedings{cohen_et_al:LIPIcs.ICALP.2020.34,
author = {Cohen, Ilan and Im, Sungjin and Panigrahi, Debmalya},
title = {{Online Two-Dimensional Load Balancing}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {34:1--34:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.34},
URN = {urn:nbn:de:0030-drops-124415},
doi = {10.4230/LIPIcs.ICALP.2020.34},
annote = {Keywords: Online algorithms, scheduling, multi-dimensional}
}
@InProceedings{dalirrooyfard_et_al:LIPIcs.ICALP.2020.35,
author = {Dalirrooyfard, Mina and Vassilevska Williams, Virginia},
title = {{Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {35:1--35:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.35},
URN = {urn:nbn:de:0030-drops-124421},
doi = {10.4230/LIPIcs.ICALP.2020.35},
annote = {Keywords: Shortest cycle, Girth, Graph algorithms, Approximation algorithms, Fine-grained complexity, Roundtrip Spanner}
}
@InProceedings{dawar_et_al:LIPIcs.ICALP.2020.36,
author = {Dawar, Anuj and Wilsenach, Gregory},
title = {{Symmetric Arithmetic Circuits}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {36:1--36:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.36},
URN = {urn:nbn:de:0030-drops-124430},
doi = {10.4230/LIPIcs.ICALP.2020.36},
annote = {Keywords: arithmetic circuits, symmetric arithmetic circuits, Boolean circuits, symmetric circuits, permanent, determinant, counting width, Weisfeiler-Leman dimension, Cai-F\"{u}rer-Immerman constructions}
}
@InProceedings{de_et_al:LIPIcs.ICALP.2020.37,
author = {De, Anindya and Khanna, Sanjeev and Li, Huan and Nikpey, Hesam},
title = {{An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {37:1--37:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.37},
URN = {urn:nbn:de:0030-drops-124449},
doi = {10.4230/LIPIcs.ICALP.2020.37},
annote = {Keywords: Efficient PTAS, Makespan Minimization, Scheduling, Stochastic Load Balancing, Poisson Distribution}
}
@InProceedings{deligkas_et_al:LIPIcs.ICALP.2020.38,
author = {Deligkas, Argyrios and Fearnley, John and Savani, Rahul},
title = {{Tree Polymatrix Games Are PPAD-Hard}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {38:1--38:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.38},
URN = {urn:nbn:de:0030-drops-124458},
doi = {10.4230/LIPIcs.ICALP.2020.38},
annote = {Keywords: Nash Equilibria, Polymatrix Games, PPAD, Brouwer Fixed Points}
}
@InProceedings{doron_et_al:LIPIcs.ICALP.2020.39,
author = {Doron, Dean and Murtagh, Jack and Vadhan, Salil and Zuckerman, David},
title = {{Spectral Sparsification via Bounded-Independence Sampling}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {39:1--39:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.39},
URN = {urn:nbn:de:0030-drops-124462},
doi = {10.4230/LIPIcs.ICALP.2020.39},
annote = {Keywords: Spectral sparsification, Derandomization, Space complexity}
}
@InProceedings{dreier_et_al:LIPIcs.ICALP.2020.40,
author = {Dreier, Jan and Lotze, Henri and Rossmanith, Peter},
title = {{Hard Problems on Random Graphs}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {40:1--40:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.40},
URN = {urn:nbn:de:0030-drops-124477},
doi = {10.4230/LIPIcs.ICALP.2020.40},
annote = {Keywords: random graphs, average-case complexity, first-order model checking}
}
@InProceedings{duan_et_al:LIPIcs.ICALP.2020.41,
author = {Duan, Ran and He, Haoqing and Zhang, Tianyi},
title = {{A Scaling Algorithm for Weighted f-Factors in General Graphs}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {41:1--41:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.41},
URN = {urn:nbn:de:0030-drops-124487},
doi = {10.4230/LIPIcs.ICALP.2020.41},
annote = {Keywords: Scaling Algorithm, f-Factors, General Graphs}
}
@InProceedings{dughmi:LIPIcs.ICALP.2020.42,
author = {Dughmi, Shaddin},
title = {{The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {42:1--42:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.42},
URN = {urn:nbn:de:0030-drops-124496},
doi = {10.4230/LIPIcs.ICALP.2020.42},
annote = {Keywords: Contention Resolution, Secretary Problems, Matroids}
}
@InProceedings{eiben_et_al:LIPIcs.ICALP.2020.43,
author = {Eiben, Eduard and Ganian, Robert and Hamm, Thekla and Klute, Fabian and N\"{o}llenburg, Martin},
title = {{Extending Partial 1-Planar Drawings}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {43:1--43:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.43},
URN = {urn:nbn:de:0030-drops-124509},
doi = {10.4230/LIPIcs.ICALP.2020.43},
annote = {Keywords: Extension problems, 1-planarity, parameterized algorithms}
}
@InProceedings{feige_et_al:LIPIcs.ICALP.2020.44,
author = {Feige, Uriel and Grinberg, Vadim},
title = {{How to Hide a Clique?}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {44:1--44:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.44},
URN = {urn:nbn:de:0030-drops-124517},
doi = {10.4230/LIPIcs.ICALP.2020.44},
annote = {Keywords: planted clique, semi-random model, Lovasz theta function, random graphs}
}
@InProceedings{fichtenberger_et_al:LIPIcs.ICALP.2020.45,
author = {Fichtenberger, Hendrik and Gao, Mingze and Peng, Pan},
title = {{Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {45:1--45:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.45},
URN = {urn:nbn:de:0030-drops-124526},
doi = {10.4230/LIPIcs.ICALP.2020.45},
annote = {Keywords: Graph sampling, Graph algorithms, Sublinear-time algorithms}
}
@InProceedings{fielbaum_et_al:LIPIcs.ICALP.2020.46,
author = {Fielbaum, Andr\'{e}s and Morales, Ignacio and Verschae, Jos\'{e}},
title = {{A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {46:1--46:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.46},
URN = {urn:nbn:de:0030-drops-124531},
doi = {10.4230/LIPIcs.ICALP.2020.46},
annote = {Keywords: Knapsack-Cover Inequalities, Non-Linear Knapsack-Cover, Primal-Dual, Water-Filling Algorithm}
}
@InProceedings{filtser:LIPIcs.ICALP.2020.47,
author = {Filtser, Arnold},
title = {{Scattering and Sparse Partitions, and Their Applications}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {47:1--47:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.47},
URN = {urn:nbn:de:0030-drops-124547},
doi = {10.4230/LIPIcs.ICALP.2020.47},
annote = {Keywords: Scattering partitions, sparse partitions, sparse covers, Steiner point removal, Universal Steiner tree, Universal TSP}
}
@InProceedings{filtser_et_al:LIPIcs.ICALP.2020.48,
author = {Filtser, Arnold and Filtser, Omrit and Katz, Matthew J.},
title = {{Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {48:1--48:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.48},
URN = {urn:nbn:de:0030-drops-124555},
doi = {10.4230/LIPIcs.ICALP.2020.48},
annote = {Keywords: polygonal curves, Fr\'{e}chet distance, dynamic time warping, approximation algorithms, (asymmetric) approximate nearest neighbor, range counting}
}
@InProceedings{fomin_et_al:LIPIcs.ICALP.2020.49,
author = {Fomin, Fedor V. and Lokshtanov, Daniel and Mihajlin, Ivan and Saurabh, Saket and Zehavi, Meirav},
title = {{Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {49:1--49:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.49},
URN = {urn:nbn:de:0030-drops-124568},
doi = {10.4230/LIPIcs.ICALP.2020.49},
annote = {Keywords: Hadwiger Number, Exponential-Time Hypothesis, Exact Algorithms, Edge Contraction Problems}
}
@InProceedings{fotakis_et_al:LIPIcs.ICALP.2020.50,
author = {Fotakis, Dimitris and Kandiros, Vardis and Lianeas, Thanasis and Mouzakis, Nikos and Patsilinakos, Panagiotis and Skoulakis, Stratis},
title = {{Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {50:1--50:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.50},
URN = {urn:nbn:de:0030-drops-124573},
doi = {10.4230/LIPIcs.ICALP.2020.50},
annote = {Keywords: PLS-completeness, Local-Max-Cut, Weighted Congestion Games, Equilibrium Computation}
}
@InProceedings{fotakis_et_al:LIPIcs.ICALP.2020.51,
author = {Fotakis, Dimitris and Kavouras, Loukas and Koumoutsos, Grigorios and Skoulakis, Stratis and Vardas, Manolis},
title = {{The Online Min-Sum Set Cover Problem}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {51:1--51:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.51},
URN = {urn:nbn:de:0030-drops-124582},
doi = {10.4230/LIPIcs.ICALP.2020.51},
annote = {Keywords: Online Algorithms, Competitive Analysis, Min-Sum Set Cover}
}
@InProceedings{furer_et_al:LIPIcs.ICALP.2020.52,
author = {F\"{u}rer, Martin and Hoppen, Carlos and Trevisan, Vilmar},
title = {{Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {52:1--52:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.52},
URN = {urn:nbn:de:0030-drops-124590},
doi = {10.4230/LIPIcs.ICALP.2020.52},
annote = {Keywords: Treewidth, Diagonalization, Eigenvalues}
}
@InProceedings{galanis_et_al:LIPIcs.ICALP.2020.53,
author = {Galanis, Andreas and Goldberg, Leslie Ann and Guo, Heng and Yang, Kuan},
title = {{Counting Solutions to Random CNF Formulas}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {53:1--53:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.53},
URN = {urn:nbn:de:0030-drops-124603},
doi = {10.4230/LIPIcs.ICALP.2020.53},
annote = {Keywords: random CNF formulas, approximate counting}
}
@InProceedings{ganesh_et_al:LIPIcs.ICALP.2020.54,
author = {Ganesh, Arun and Maggs, Bruce M. and Panigrahi, Debmalya},
title = {{Robust Algorithms for TSP and Steiner Tree}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {54:1--54:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.54},
URN = {urn:nbn:de:0030-drops-124619},
doi = {10.4230/LIPIcs.ICALP.2020.54},
annote = {Keywords: Robust optimization, Steiner tree, traveling salesman problem}
}
@InProceedings{ganesh_et_al:LIPIcs.ICALP.2020.55,
author = {Ganesh, Chaya and Magri, Bernardo and Venturi, Daniele},
title = {{Cryptographic Reverse Firewalls for Interactive Proof Systems}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {55:1--55:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.55},
URN = {urn:nbn:de:0030-drops-124621},
doi = {10.4230/LIPIcs.ICALP.2020.55},
annote = {Keywords: Subversion, Algorithm substitution attacks, Cryptographic reverse firewalls, Interactive proofs, Zero knowledge}
}
@InProceedings{garg_et_al:LIPIcs.ICALP.2020.56,
author = {Garg, Paritosh and Kale, Sagar and Rohwedder, Lars and Svensson, Ola},
title = {{Robust Algorithms Under Adversarial Injections}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {56:1--56:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.56},
URN = {urn:nbn:de:0030-drops-124632},
doi = {10.4230/LIPIcs.ICALP.2020.56},
annote = {Keywords: Streaming algorithm, adversary, submodular maximization, matching}
}
@InProceedings{gawrychowski_et_al:LIPIcs.ICALP.2020.57,
author = {Gawrychowski, Pawe{\l} and Mozes, Shay and Weimann, Oren},
title = {{Minimum Cut in O(m log² n) Time}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {57:1--57:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.57},
URN = {urn:nbn:de:0030-drops-124646},
doi = {10.4230/LIPIcs.ICALP.2020.57},
annote = {Keywords: Minimum cut, Minimum 2-respecting cut}
}
@InProceedings{gilbert_et_al:LIPIcs.ICALP.2020.58,
author = {Gilbert, Anna and Gu, Albert and R\'{e}, Christopher and Rudra, Atri and Wootters, Mary},
title = {{Sparse Recovery for Orthogonal Polynomial Transforms}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {58:1--58:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.58},
URN = {urn:nbn:de:0030-drops-124653},
doi = {10.4230/LIPIcs.ICALP.2020.58},
annote = {Keywords: Orthogonal polynomials, Jacobi polynomials, sublinear algorithms, sparse recovery}
}
@InProceedings{goke_et_al:LIPIcs.ICALP.2020.59,
author = {G\"{o}ke, Alexander and Marx, D\'{a}niel and Mnich, Matthias},
title = {{Hitting Long Directed Cycles Is Fixed-Parameter Tractable}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {59:1--59:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.59},
URN = {urn:nbn:de:0030-drops-124664},
doi = {10.4230/LIPIcs.ICALP.2020.59},
annote = {Keywords: Directed graphs, directed feedback vertex set, circumference}
}
@InProceedings{gregor_et_al:LIPIcs.ICALP.2020.60,
author = {Gregor, Petr and Mi\v{c}ka, Ond\v{r}ej and M\"{u}tze, Torsten},
title = {{On the Central Levels Problem}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {60:1--60:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.60},
URN = {urn:nbn:de:0030-drops-124678},
doi = {10.4230/LIPIcs.ICALP.2020.60},
annote = {Keywords: Gray code, Hamilton cycle, hypercube, middle levels, symmetric chain decomposition}
}
@InProceedings{gurjar_et_al:LIPIcs.ICALP.2020.61,
author = {Gurjar, Rohit and Rathi, Rajat},
title = {{Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {61:1--61:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.61},
URN = {urn:nbn:de:0030-drops-124687},
doi = {10.4230/LIPIcs.ICALP.2020.61},
annote = {Keywords: Submodular Minimization, Parallel Algorithms, Derandomization, Algebraic Algorithms}
}
@InProceedings{guruswami_et_al:LIPIcs.ICALP.2020.62,
author = {Guruswami, Venkatesan and Sandeep, Sai},
title = {{d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {62:1--62:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.62},
URN = {urn:nbn:de:0030-drops-124694},
doi = {10.4230/LIPIcs.ICALP.2020.62},
annote = {Keywords: graph coloring, hardness of approximation}
}
@InProceedings{hakoniemi:LIPIcs.ICALP.2020.63,
author = {Hakoniemi, Tuomas},
title = {{Feasible Interpolation for Polynomial Calculus and Sums-Of-Squares}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {63:1--63:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.63},
URN = {urn:nbn:de:0030-drops-124707},
doi = {10.4230/LIPIcs.ICALP.2020.63},
annote = {Keywords: Proof Complexity, Feasible Interpolation, Sums-of-Squares, Polynomial Calculus}
}
@InProceedings{harpeled_et_al:LIPIcs.ICALP.2020.64,
author = {Har-Peled, Sariel and Jones, Mitchell and Rahul, Saladi},
title = {{Active Learning a Convex Body in Low Dimensions}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {64:1--64:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.64},
URN = {urn:nbn:de:0030-drops-124711},
doi = {10.4230/LIPIcs.ICALP.2020.64},
annote = {Keywords: Approximation algorithms, computational geometry, separation oracles, active learning}
}
@InProceedings{hirai_et_al:LIPIcs.ICALP.2020.65,
author = {Hirai, Hiroshi and Ikeda, Motoki},
title = {{Node-Connectivity Terminal Backup, Separately-Capacitated Multiflow, and Discrete Convexity}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {65:1--65:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.65},
URN = {urn:nbn:de:0030-drops-124725},
doi = {10.4230/LIPIcs.ICALP.2020.65},
annote = {Keywords: terminal backup problem, node-connectivity, separately-capacitated multiflow, discrete convex analysis}
}
@InProceedings{govorov_et_al:LIPIcs.ICALP.2020.66,
author = {Govorov, Artem and Cai, Jin-Yi and Dyer, Martin},
title = {{A Dichotomy for Bounded Degree Graph Homomorphisms with Nonnegative Weights}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {66:1--66:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.66},
URN = {urn:nbn:de:0030-drops-124733},
doi = {10.4230/LIPIcs.ICALP.2020.66},
annote = {Keywords: Graph homomorphism, Complexity dichotomy, Counting problems}
}
@InProceedings{izumi_et_al:LIPIcs.ICALP.2020.67,
author = {Izumi, Taisuke and Otachi, Yota},
title = {{Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {67:1--67:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.67},
URN = {urn:nbn:de:0030-drops-124745},
doi = {10.4230/LIPIcs.ICALP.2020.67},
annote = {Keywords: depth-first search, space complexity, treewidth}
}
@InProceedings{albers_et_al:LIPIcs.ICALP.2020.68,
author = {Albers, Susanne and Janke, Maximilian},
title = {{Scheduling in the Random-Order Model}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {68:1--68:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.68},
URN = {urn:nbn:de:0030-drops-124750},
doi = {10.4230/LIPIcs.ICALP.2020.68},
annote = {Keywords: Scheduling, makespan minimization, online algorithm, competitive analysis, lower bound, random-order}
}
@InProceedings{jiang_et_al:LIPIcs.ICALP.2020.69,
author = {Jiang, Zhihao and Panigrahi, Debmalya and Sun, Kevin},
title = {{Online Algorithms for Weighted Paging with Predictions}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {69:1--69:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.69},
URN = {urn:nbn:de:0030-drops-124761},
doi = {10.4230/LIPIcs.ICALP.2020.69},
annote = {Keywords: Online algorithms, paging}
}
@InProceedings{kavitha:LIPIcs.ICALP.2020.70,
author = {Kavitha, Telikepalli},
title = {{Popular Matchings with One-Sided Bias}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {70:1--70:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.70},
URN = {urn:nbn:de:0030-drops-124774},
doi = {10.4230/LIPIcs.ICALP.2020.70},
annote = {Keywords: Bipartite graphs, Stable matchings, Gale-Shapley algorithm, LP-duality}
}
@InProceedings{dekeijzer_et_al:LIPIcs.ICALP.2020.71,
author = {de Keijzer, Bart and Kyropoulou, Maria and Ventre, Carmine},
title = {{Obviously Strategyproof Single-Minded Combinatorial Auctions}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {71:1--71:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.71},
URN = {urn:nbn:de:0030-drops-124781},
doi = {10.4230/LIPIcs.ICALP.2020.71},
annote = {Keywords: OSP Mechanisms, Extensive-form Mechanisms, Single-minded Combinatorial Auctions, Greedy algorithms}
}
@InProceedings{kesselheim_et_al:LIPIcs.ICALP.2020.72,
author = {Kesselheim, Thomas and Molinaro, Marco},
title = {{Knapsack Secretary with Bursty Adversary}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {72:1--72:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.72},
URN = {urn:nbn:de:0030-drops-124798},
doi = {10.4230/LIPIcs.ICALP.2020.72},
annote = {Keywords: Beyond worst-case, secretary problem, random order, online algorithms, knapsack}
}
@InProceedings{kiefer_et_al:LIPIcs.ICALP.2020.73,
author = {Kiefer, Sandra and McKay, Brendan D.},
title = {{The Iteration Number of Colour Refinement}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {73:1--73:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.73},
URN = {urn:nbn:de:0030-drops-124801},
doi = {10.4230/LIPIcs.ICALP.2020.73},
annote = {Keywords: Colour Refinement, iteration number, Weisfeiler-Leman algorithm, quantifier depth}
}
@InProceedings{kopelowitz_et_al:LIPIcs.ICALP.2020.74,
author = {Kopelowitz, Tsvi and Vassilevska Williams, Virginia},
title = {{Towards Optimal Set-Disjointness and Set-Intersection Data Structures}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {74:1--74:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.74},
URN = {urn:nbn:de:0030-drops-124813},
doi = {10.4230/LIPIcs.ICALP.2020.74},
annote = {Keywords: Set-disjointness data structures, Triangle detection, Triangle enumeration, Fine-grained complexity, Fast matrix multiplication}
}
@InProceedings{korman_et_al:LIPIcs.ICALP.2020.75,
author = {Korman, Matias and van Renssen, Andr\'{e} and Roeloffzen, Marcel and Staals, Frank},
title = {{Kinetic Geodesic Voronoi Diagrams in a Simple Polygon}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {75:1--75:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.75},
URN = {urn:nbn:de:0030-drops-124820},
doi = {10.4230/LIPIcs.ICALP.2020.75},
annote = {Keywords: kinetic data structure, simple polygon, geodesic voronoi diagram}
}
@InProceedings{laarhoven:LIPIcs.ICALP.2020.76,
author = {Laarhoven, Thijs},
title = {{Polytopes, Lattices, and Spherical Codes for the Nearest Neighbor Problem}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {76:1--76:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.76},
URN = {urn:nbn:de:0030-drops-124834},
doi = {10.4230/LIPIcs.ICALP.2020.76},
annote = {Keywords: (approximate) nearest neighbor problem, spherical codes, polytopes, lattices, locality-sensitive hashing (LSH)}
}
@InProceedings{li_et_al:LIPIcs.ICALP.2020.77,
author = {Li, Yi and Nakos, Vasileios},
title = {{Deterministic Sparse Fourier Transform with an 𝓁\underline\{∞\} Guarantee}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {77:1--77:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.77},
URN = {urn:nbn:de:0030-drops-124844},
doi = {10.4230/LIPIcs.ICALP.2020.77},
annote = {Keywords: Fourier sparse recovery, derandomization, incoherent matrices}
}
@InProceedings{lincoln_et_al:LIPIcs.ICALP.2020.78,
author = {Lincoln, Andrea and Yedidia, Adam},
title = {{Faster Random k-CNF Satisfiability}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {78:1--78:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.78},
URN = {urn:nbn:de:0030-drops-124857},
doi = {10.4230/LIPIcs.ICALP.2020.78},
annote = {Keywords: Random k-SAT, Average-Case, Algorithms}
}
@InProceedings{liu_et_al:LIPIcs.ICALP.2020.79,
author = {Liu, Mingmou and Yin, Yitong and Yu, Huacheng},
title = {{Succinct Filters for Sets of Unknown Sizes}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {79:1--79:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.79},
URN = {urn:nbn:de:0030-drops-124867},
doi = {10.4230/LIPIcs.ICALP.2020.79},
annote = {Keywords: Bloom filters, Data structures, Approximate set membership, Dictionaries}
}
@InProceedings{lokshtanov_et_al:LIPIcs.ICALP.2020.80,
author = {Lokshtanov, Daniel and Misra, Pranabendu and Panolan, Fahad and Philip, Geevarghese and Saurabh, Saket},
title = {{A (2 + \epsilon)-Factor Approximation Algorithm for Split Vertex Deletion}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {80:1--80:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.80},
URN = {urn:nbn:de:0030-drops-124879},
doi = {10.4230/LIPIcs.ICALP.2020.80},
annote = {Keywords: Approximation Algorithms, Graph Algorithms, Split Vertex Deletion}
}
@InProceedings{chechik_et_al:LIPIcs.ICALP.2020.81,
author = {Chechik, Shiri and Magen, Ofer},
title = {{Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {81:1--81:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.81},
URN = {urn:nbn:de:0030-drops-124886},
doi = {10.4230/LIPIcs.ICALP.2020.81},
annote = {Keywords: Fault tolerance, Replacement Paths, Combinatorial algorithms, Conditional lower bounds}
}
@InProceedings{magniez_et_al:LIPIcs.ICALP.2020.82,
author = {Magniez, Fr\'{e}d\'{e}ric and Nayak, Ashwin},
title = {{Quantum Distributed Complexity of Set Disjointness on a Line}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {82:1--82:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.82},
URN = {urn:nbn:de:0030-drops-124892},
doi = {10.4230/LIPIcs.ICALP.2020.82},
annote = {Keywords: Quantum distributed computing, Set Disjointness, communication complexity, query complexity}
}
@InProceedings{mahmoody_et_al:LIPIcs.ICALP.2020.83,
author = {Mahmoody, Mohammad and Smith, Caleb and Wu, David J.},
title = {{Can Verifiable Delay Functions Be Based on Random Oracles?}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {83:1--83:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.83},
URN = {urn:nbn:de:0030-drops-124907},
doi = {10.4230/LIPIcs.ICALP.2020.83},
annote = {Keywords: verifiable delay function, lower bound, random oracle model}
}
@InProceedings{merino_et_al:LIPIcs.ICALP.2020.84,
author = {Merino, Arturo and Wiese, Andreas},
title = {{On the Two-Dimensional Knapsack Problem for Convex Polygons}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {84:1--84:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.84},
URN = {urn:nbn:de:0030-drops-124916},
doi = {10.4230/LIPIcs.ICALP.2020.84},
annote = {Keywords: Approximation algorithms, geometric knapsack problem, polygons, rotation}
}
@InProceedings{micha_et_al:LIPIcs.ICALP.2020.85,
author = {Micha, Evi and Shah, Nisarg},
title = {{Proportionally Fair Clustering Revisited}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {85:1--85:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.85},
URN = {urn:nbn:de:0030-drops-124923},
doi = {10.4230/LIPIcs.ICALP.2020.85},
annote = {Keywords: Fairness, Clustering, Facility location}
}
@InProceedings{momke_et_al:LIPIcs.ICALP.2020.86,
author = {M\"{o}mke, Tobias and Wiese, Andreas},
title = {{Breaking the Barrier of 2 for the Storage Allocation Problem}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {86:1--86:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.86},
URN = {urn:nbn:de:0030-drops-124931},
doi = {10.4230/LIPIcs.ICALP.2020.86},
annote = {Keywords: Approximation Algorithms, Resource Allocation, Dynamic Programming}
}
@InProceedings{mousavi_et_al:LIPIcs.ICALP.2020.87,
author = {Mousavi, Hamoon and Nezhadi, Seyed Sajjad and Yuen, Henry},
title = {{On the Complexity of Zero Gap MIP*}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {87:1--87:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.87},
URN = {urn:nbn:de:0030-drops-124940},
doi = {10.4230/LIPIcs.ICALP.2020.87},
annote = {Keywords: Quantum Complexity, Multiprover Interactive Proofs, Computability Theory}
}
@InProceedings{neuen:LIPIcs.ICALP.2020.88,
author = {Neuen, Daniel},
title = {{Hypergraph Isomorphism for Groups with Restricted Composition Factors}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {88:1--88:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.88},
URN = {urn:nbn:de:0030-drops-124959},
doi = {10.4230/LIPIcs.ICALP.2020.88},
annote = {Keywords: graph isomorphism, groups with restricted composition factors, hypergraphs, bounded genus graphs}
}
@InProceedings{oki:LIPIcs.ICALP.2020.89,
author = {Oki, Taihei},
title = {{On Solving (Non)commutative Weighted Edmonds' Problem}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {89:1--89:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.89},
URN = {urn:nbn:de:0030-drops-124963},
doi = {10.4230/LIPIcs.ICALP.2020.89},
annote = {Keywords: skew fields, Edmonds' problem, Dieudonn\'{e} determinant, degree computation, Smith - McMillan form, matrix expansion, discrete Legendre conjugacy}
}
@InProceedings{papp_et_al:LIPIcs.ICALP.2020.90,
author = {Papp, P\'{a}l Andr\'{a}s and Wattenhofer, Roger},
title = {{A General Stabilization Bound for Influence Propagation in Graphs}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {90:1--90:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.90},
URN = {urn:nbn:de:0030-drops-124978},
doi = {10.4230/LIPIcs.ICALP.2020.90},
annote = {Keywords: Minority process, Majority process}
}
@InProceedings{papp_et_al:LIPIcs.ICALP.2020.91,
author = {Papp, P\'{a}l Andr\'{a}s and Wattenhofer, Roger},
title = {{Network-Aware Strategies in Financial Systems}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {91:1--91:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.91},
URN = {urn:nbn:de:0030-drops-124988},
doi = {10.4230/LIPIcs.ICALP.2020.91},
annote = {Keywords: Financial network, credit default swap, creditor priority, clearing problem, prisoner’s dilemma, dollar auction}
}
@InProceedings{pitassi_et_al:LIPIcs.ICALP.2020.92,
author = {Pitassi, Toniann and Shirley, Morgan and Watson, Thomas},
title = {{Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {92:1--92:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.92},
URN = {urn:nbn:de:0030-drops-124992},
doi = {10.4230/LIPIcs.ICALP.2020.92},
annote = {Keywords: Boolean hierarchies, lifting theorems, query complexity}
}
@InProceedings{potukuchi:LIPIcs.ICALP.2020.93,
author = {Potukuchi, Aditya},
title = {{A Spectral Bound on Hypergraph Discrepancy}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {93:1--93:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.93},
URN = {urn:nbn:de:0030-drops-125002},
doi = {10.4230/LIPIcs.ICALP.2020.93},
annote = {Keywords: Hypergraph discrepancy, Spectral methods, Beck-Fiala conjecture}
}
@InProceedings{sandlund_et_al:LIPIcs.ICALP.2020.94,
author = {Sandlund, Bryce and Xu, Yinzhan},
title = {{Faster Dynamic Range Mode}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {94:1--94:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.94},
URN = {urn:nbn:de:0030-drops-125018},
doi = {10.4230/LIPIcs.ICALP.2020.94},
annote = {Keywords: Range Mode, Min-Plus Product}
}
@InProceedings{sau_et_al:LIPIcs.ICALP.2020.95,
author = {Sau, Ignasi and Stamoulis, Giannos and Thilikos, Dimitrios M.},
title = {{An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {95:1--95:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.95},
URN = {urn:nbn:de:0030-drops-125027},
doi = {10.4230/LIPIcs.ICALP.2020.95},
annote = {Keywords: Graph modification problems, irrelevant vertex technique, graph minors, parameterized algorithms}
}
@InProceedings{shao_et_al:LIPIcs.ICALP.2020.96,
author = {Shao, Shuai and Sun, Yuxin},
title = {{Contraction: A Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {96:1--96:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.96},
URN = {urn:nbn:de:0030-drops-125036},
doi = {10.4230/LIPIcs.ICALP.2020.96},
annote = {Keywords: 2-Spin system, Correlation decay, Zero-freeness, Phase transition, Contraction}
}
@InProceedings{shimizu_et_al:LIPIcs.ICALP.2020.97,
author = {Shimizu, Nobutaka and Shiraga, Takeharu},
title = {{Quasi-Majority Functional Voting on Expander Graphs}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {97:1--97:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.97},
URN = {urn:nbn:de:0030-drops-125042},
doi = {10.4230/LIPIcs.ICALP.2020.97},
annote = {Keywords: Distributed voting, consensus problem, expander graph, Markov chain}
}
@InProceedings{epstein_et_al:LIPIcs.ICALP.2020.98,
author = {Epstein, Rogers and Silwal, Sandeep},
title = {{Property Testing of LP-Type Problems}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {98:1--98:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.98},
URN = {urn:nbn:de:0030-drops-125056},
doi = {10.4230/LIPIcs.ICALP.2020.98},
annote = {Keywords: property pesting, LP-Type problems, random sampling}
}
@InProceedings{su_et_al:LIPIcs.ICALP.2020.99,
author = {Su, Hsin-Hao and Wein, Nicole},
title = {{Lower Bounds for Dynamic Distributed Task Allocation}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {99:1--99:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.99},
URN = {urn:nbn:de:0030-drops-125063},
doi = {10.4230/LIPIcs.ICALP.2020.99},
annote = {Keywords: distributed task allocation, combinatorics, lower bounds, multi-agent systems, low-distortion embedding, dynamic algorithms, biological distributed algorithms}
}
@InProceedings{sun_et_al:LIPIcs.ICALP.2020.100,
author = {Sun, Xiaoming and Sun, Yuan and Wang, Jiaheng and Wu, Kewen and Xia, Zhiyu and Zheng, Yufan},
title = {{On the Degree of Boolean Functions as Polynomials over \mathbb{Z}\underlinem}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {100:1--100:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.100},
URN = {urn:nbn:de:0030-drops-125070},
doi = {10.4230/LIPIcs.ICALP.2020.100},
annote = {Keywords: Boolean function, polynomial, modular degree, Ramsey theory}
}
@InProceedings{wahlstrom:LIPIcs.ICALP.2020.101,
author = {Wahlstr\"{o}m, Magnus},
title = {{On Quasipolynomial Multicut-Mimicking Networks and Kernelization of Multiway Cut Problems}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {101:1--101:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.101},
URN = {urn:nbn:de:0030-drops-125082},
doi = {10.4230/LIPIcs.ICALP.2020.101},
annote = {Keywords: Multiway Cut, Kernelization, Small Set Expansion, Mimicking Networks}
}
@InProceedings{wei:LIPIcs.ICALP.2020.102,
author = {Wei{\ss}, Armin},
title = {{Hardness of Equations over Finite Solvable Groups Under the Exponential Time Hypothesis}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {102:1--102:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.102},
URN = {urn:nbn:de:0030-drops-125093},
doi = {10.4230/LIPIcs.ICALP.2020.102},
annote = {Keywords: equations in groups, solvable groups, exponential time hypothesis}
}
@InProceedings{wiebking:LIPIcs.ICALP.2020.103,
author = {Wiebking, Daniel},
title = {{Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {103:1--103:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.103},
URN = {urn:nbn:de:0030-drops-125106},
doi = {10.4230/LIPIcs.ICALP.2020.103},
annote = {Keywords: Graph isomorphism, canonization, treewidth, hypergraphs}
}
@InProceedings{wlodarczyk:LIPIcs.ICALP.2020.104,
author = {W{\l}odarczyk, Micha{\l}},
title = {{Parameterized Inapproximability for Steiner Orientation by Gap Amplification}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {104:1--104:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.104},
URN = {urn:nbn:de:0030-drops-125110},
doi = {10.4230/LIPIcs.ICALP.2020.104},
annote = {Keywords: approximation algorithms, fixed-parameter tractability, hardness of approximation, gap amplification}
}
@InProceedings{wu:LIPIcs.ICALP.2020.105,
author = {Wu, Hongxun},
title = {{Near-Optimal Algorithm for Constructing Greedy Consensus Tree}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {105:1--105:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.105},
URN = {urn:nbn:de:0030-drops-125122},
doi = {10.4230/LIPIcs.ICALP.2020.105},
annote = {Keywords: phylogenetic trees, greedy consensus trees, splay tree}
}
@InProceedings{abokhamis_et_al:LIPIcs.ICALP.2020.106,
author = {Abo Khamis, Mahmoud and Kolaitis, Phokion G. and Ngo, Hung Q. and Suciu, Dan},
title = {{Decision Problems in Information Theory}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {106:1--106:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.106},
URN = {urn:nbn:de:0030-drops-125137},
doi = {10.4230/LIPIcs.ICALP.2020.106},
annote = {Keywords: Information theory, decision problems, arithmetical hierarchy, entropic functions}
}
@InProceedings{almagor_et_al:LIPIcs.ICALP.2020.107,
author = {Almagor, Shaull and Kelmendi, Edon and Ouaknine, Jo\"{e}l and Worrell, James},
title = {{Invariants for Continuous Linear Dynamical Systems}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {107:1--107:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.107},
URN = {urn:nbn:de:0030-drops-125141},
doi = {10.4230/LIPIcs.ICALP.2020.107},
annote = {Keywords: Invariants, continuous linear dynamical systems, continuous Skolem problem, safety, o-minimality}
}
@InProceedings{barak_et_al:LIPIcs.ICALP.2020.108,
author = {Barak, Boaz and Crubill\'{e}, Rapha\"{e}lle and Dal Lago, Ugo},
title = {{On Higher-Order Cryptography}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {108:1--108:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.108},
URN = {urn:nbn:de:0030-drops-125153},
doi = {10.4230/LIPIcs.ICALP.2020.108},
annote = {Keywords: Higher-order computation, probabilistic computation, game semantics, cryptography}
}
@InProceedings{barozzini_et_al:LIPIcs.ICALP.2020.109,
author = {Barozzini, David and Clemente, Lorenzo and Colcombet, Thomas and Parys, Pawe{\l}},
title = {{Cost Automata, Safe Schemes, and Downward Closures}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {109:1--109:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.109},
URN = {urn:nbn:de:0030-drops-125169},
doi = {10.4230/LIPIcs.ICALP.2020.109},
annote = {Keywords: Cost logics, cost automata, downward closures, higher-order recursion schemes, safe recursion schemes}
}
@InProceedings{barto_et_al:LIPIcs.ICALP.2020.110,
author = {Barto, Libor and Kozik, Marcin and Tan, Johnson and Valeriote, Matt},
title = {{Sensitive Instances of the Constraint Satisfaction Problem}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {110:1--110:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.110},
URN = {urn:nbn:de:0030-drops-125176},
doi = {10.4230/LIPIcs.ICALP.2020.110},
annote = {Keywords: Constraint satisfaction problem, bounded width, local consistency, near unanimity operation, loop lemma}
}
@InProceedings{baumann_et_al:LIPIcs.ICALP.2020.111,
author = {Baumann, Pascal and Majumdar, Rupak and Thinniyam, Ramanathan S. and Zetzsche, Georg},
title = {{The Complexity of Bounded Context Switching with Dynamic Thread Creation}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {111:1--111:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.111},
URN = {urn:nbn:de:0030-drops-125187},
doi = {10.4230/LIPIcs.ICALP.2020.111},
annote = {Keywords: Dynamic thread creation, Bounded context switching, Asynchronous Programs, Safety verification, State reachability, Petri nets, Complexity, Succinctness, Counter Programs}
}
@InProceedings{benedikt_et_al:LIPIcs.ICALP.2020.112,
author = {Benedikt, Michael and Kostylev, Egor V. and Tan, Tony},
title = {{Two Variable Logic with Ultimately Periodic Counting}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {112:1--112:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.112},
URN = {urn:nbn:de:0030-drops-125197},
doi = {10.4230/LIPIcs.ICALP.2020.112},
annote = {Keywords: Presburger Arithmetic, Two-variable logic}
}
@InProceedings{bojanczyk_et_al:LIPIcs.ICALP.2020.113,
author = {Boja\'{n}czyk, Miko{\l}aj and Stefa\'{n}ski, Rafa{\l}},
title = {{Single-Use Automata and Transducers for Infinite Alphabets}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {113:1--113:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.113},
URN = {urn:nbn:de:0030-drops-125200},
doi = {10.4230/LIPIcs.ICALP.2020.113},
annote = {Keywords: Automata, semigroups, data words, orbit-finite sets}
}
@InProceedings{bostan_et_al:LIPIcs.ICALP.2020.114,
author = {Bostan, Alin and Carayol, Arnaud and Koechlin, Florent and Nicaud, Cyril},
title = {{Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {114:1--114:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.114},
URN = {urn:nbn:de:0030-drops-125212},
doi = {10.4230/LIPIcs.ICALP.2020.114},
annote = {Keywords: generating series, holonomicity, ambiguity, reversal bounded counter machine, Parikh automata}
}
@InProceedings{bumpus_et_al:LIPIcs.ICALP.2020.115,
author = {Bumpus, Georgina and Haase, Christoph and Kiefer, Stefan and Stoienescu, Paul-Ioan and Tanner, Jonathan},
title = {{On the Size of Finite Rational Matrix Semigroups}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {115:1--115:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.115},
URN = {urn:nbn:de:0030-drops-125226},
doi = {10.4230/LIPIcs.ICALP.2020.115},
annote = {Keywords: Matrix semigroups, Burnside problem, weighted automata, vector addition systems}
}
@InProceedings{cadilhac_et_al:LIPIcs.ICALP.2020.116,
author = {Cadilhac, Micha\"{e}l and Chistikov, Dmitry and Zetzsche, Georg},
title = {{Rational Subsets of Baumslag-Solitar Groups}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {116:1--116:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.116},
URN = {urn:nbn:de:0030-drops-125238},
doi = {10.4230/LIPIcs.ICALP.2020.116},
annote = {Keywords: Rational subsets, Baumslag-Solitar groups, decidability, regular languages, pointed expansion}
}
@InProceedings{cadilhac_et_al:LIPIcs.ICALP.2020.117,
author = {Cadilhac, Micha\"{e}l and Mazowiecki, Filip and Paperman, Charles and Pilipczuk, Micha{\l} and S\'{e}nizergues, G\'{e}raud},
title = {{On Polynomial Recursive Sequences}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {117:1--117:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.117},
URN = {urn:nbn:de:0030-drops-125240},
doi = {10.4230/LIPIcs.ICALP.2020.117},
annote = {Keywords: recursive sequences, expressive power, weighted automata, higher-order pushdown automata}
}
@InProceedings{carette_et_al:LIPIcs.ICALP.2020.118,
author = {Carette, Titouan and Jeandel, Emmanuel},
title = {{A Recipe for Quantum Graphical Languages}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {118:1--118:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.118},
URN = {urn:nbn:de:0030-drops-125250},
doi = {10.4230/LIPIcs.ICALP.2020.118},
annote = {Keywords: Categorical Quantum Mechanics, Quantum Computing, Category Theory}
}
@InProceedings{chistikov_et_al:LIPIcs.ICALP.2020.119,
author = {Chistikov, Dmitry and Haase, Christoph},
title = {{On the Power of Ordering in Linear Arithmetic Theories}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {119:1--119:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.119},
URN = {urn:nbn:de:0030-drops-125265},
doi = {10.4230/LIPIcs.ICALP.2020.119},
annote = {Keywords: logical definability, linear arithmetic theories, semi linear sets, ultimately periodic sets, numerical semigroups}
}
@InProceedings{ciobanu_et_al:LIPIcs.ICALP.2020.120,
author = {Ciobanu, Laura and Logan, Alan D.},
title = {{The Post Correspondence Problem and Equalisers for Certain Free Group and Monoid Morphisms}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {120:1--120:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.120},
URN = {urn:nbn:de:0030-drops-125271},
doi = {10.4230/LIPIcs.ICALP.2020.120},
annote = {Keywords: Post Correspondence Problem, marked map, immersion, free group, free monoid}
}
@InProceedings{clemente_et_al:LIPIcs.ICALP.2020.121,
author = {Clemente, Lorenzo and Lasota, S{\l}awomir and Pi\'{o}rkowski, Rados{\l}aw},
title = {{Timed Games and Deterministic Separability}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {121:1--121:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.121},
URN = {urn:nbn:de:0030-drops-125282},
doi = {10.4230/LIPIcs.ICALP.2020.121},
annote = {Keywords: Timed automata, separability problems, timed games}
}
@InProceedings{datta_et_al:LIPIcs.ICALP.2020.122,
author = {Datta, Samir and Kumar, Pankaj and Mukherjee, Anish and Tawari, Anuj and Vortmeier, Nils and Zeume, Thomas},
title = {{Dynamic Complexity of Reachability: How Many Changes Can We Handle?}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {122:1--122:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.122},
URN = {urn:nbn:de:0030-drops-125291},
doi = {10.4230/LIPIcs.ICALP.2020.122},
annote = {Keywords: Dynamic complexity, reachability, complex changes}
}
@InProceedings{daviaud_et_al:LIPIcs.ICALP.2020.123,
author = {Daviaud, Laure and Jurdzi\'{n}ski, Marcin and Thejaswini, K. S.},
title = {{The Strahler Number of a Parity Game}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {123:1--123:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.123},
URN = {urn:nbn:de:0030-drops-125304},
doi = {10.4230/LIPIcs.ICALP.2020.123},
annote = {Keywords: parity game, attractor decomposition, progress measure, universal tree, Strahler number}
}
@InProceedings{day_et_al:LIPIcs.ICALP.2020.124,
author = {Day, Joel D. and Manea, Florin},
title = {{On the Structure of Solution Sets to Regular Word Equations}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {124:1--124:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.124},
URN = {urn:nbn:de:0030-drops-125314},
doi = {10.4230/LIPIcs.ICALP.2020.124},
annote = {Keywords: Quadratic Word Equations, Regular Word Equations, String Solving, NP}
}
@InProceedings{dennunzio_et_al:LIPIcs.ICALP.2020.125,
author = {Dennunzio, Alberto and Formenti, Enrico and Grinberg, Darij and Margara, Luciano},
title = {{From Linear to Additive Cellular Automata}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {125:1--125:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.125},
URN = {urn:nbn:de:0030-drops-125321},
doi = {10.4230/LIPIcs.ICALP.2020.125},
annote = {Keywords: Cellular Automata, Decidability, Symbolic Dynamics}
}
@InProceedings{figelius_et_al:LIPIcs.ICALP.2020.126,
author = {Figelius, Michael and Ganardi, Moses and Lohrey, Markus and Zetzsche, Georg},
title = {{The Complexity of Knapsack Problems in Wreath Products}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {126:1--126:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.126},
URN = {urn:nbn:de:0030-drops-125339},
doi = {10.4230/LIPIcs.ICALP.2020.126},
annote = {Keywords: algorithmic group theory, knapsack, wreath product}
}
@InProceedings{filiot_et_al:LIPIcs.ICALP.2020.127,
author = {Filiot, Emmanuel and Gentilini, Raffaella and Raskin, Jean-Fran\c{c}ois},
title = {{The Adversarial Stackelberg Value in Quantitative Games}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {127:1--127:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.127},
URN = {urn:nbn:de:0030-drops-125348},
doi = {10.4230/LIPIcs.ICALP.2020.127},
annote = {Keywords: Non-zero sum games, reactive synthesis, adversarial Stackelberg}
}
@InProceedings{fraigniaud_et_al:LIPIcs.ICALP.2020.128,
author = {Fraigniaud, Pierre and Paz, Ami},
title = {{The Topology of Local Computing in Networks}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {128:1--128:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.128},
URN = {urn:nbn:de:0030-drops-125358},
doi = {10.4230/LIPIcs.ICALP.2020.128},
annote = {Keywords: Distributed computing, distributed graph algorithms, combinatorial topology}
}
@InProceedings{gaboardi_et_al:LIPIcs.ICALP.2020.129,
author = {Gaboardi, Marco and Nissim, Kobbi and Purser, David},
title = {{The Complexity of Verifying Loop-Free Programs as Differentially Private}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {129:1--129:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.129},
URN = {urn:nbn:de:0030-drops-125362},
doi = {10.4230/LIPIcs.ICALP.2020.129},
annote = {Keywords: differential privacy, program verification, probabilistic programs}
}
@InProceedings{gazda_et_al:LIPIcs.ICALP.2020.130,
author = {Gazda, Maciej and Mousavi, Mohammad Reza},
title = {{Logical Characterisation of Hybrid Conformance}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {130:1--130:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.130},
URN = {urn:nbn:de:0030-drops-125377},
doi = {10.4230/LIPIcs.ICALP.2020.130},
annote = {Keywords: Logical Characterisation, Metric Temporal Logic, Conformance, Behavioural Equivalence, Hybrid Systems, Relaxation}
}
@InProceedings{gillibert_et_al:LIPIcs.ICALP.2020.131,
author = {Gillibert, Pierre and Jonu\v{s}as, Julius and Kompatscher, Michael and Mottet, Antoine and Pinsker, Michael},
title = {{Hrushovski’s Encoding and \omega-Categorical CSP Monsters}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {131:1--131:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.131},
URN = {urn:nbn:de:0030-drops-125387},
doi = {10.4230/LIPIcs.ICALP.2020.131},
annote = {Keywords: Constraint satisfaction problem, complexity, polymorphism, pointwise convergence topology, height 1 identity, \omega-categoricity, orbit growth}
}
@InProceedings{hoyrup:LIPIcs.ICALP.2020.132,
author = {Hoyrup, Mathieu},
title = {{Descriptive Complexity on Non-Polish Spaces II}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {132:1--132:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.132},
URN = {urn:nbn:de:0030-drops-125395},
doi = {10.4230/LIPIcs.ICALP.2020.132},
annote = {Keywords: Represented space, Computable analysis, Descriptive set theory, Scott topology}
}
@InProceedings{majumdar_et_al:LIPIcs.ICALP.2020.133,
author = {Majumdar, Rupak and Salamati, Mahmoud and Soudjani, Sadegh},
title = {{On Decidability of Time-Bounded Reachability in CTMDPs}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {133:1--133:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.133},
URN = {urn:nbn:de:0030-drops-125408},
doi = {10.4230/LIPIcs.ICALP.2020.133},
annote = {Keywords: CTMDP, Time bounded reachability, Continuous Skolem Problem, Schanuel’s Conjecture}
}
@InProceedings{maneth_et_al:LIPIcs.ICALP.2020.134,
author = {Maneth, Sebastian and Seidl, Helmut},
title = {{When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {134:1--134:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.134},
URN = {urn:nbn:de:0030-drops-125416},
doi = {10.4230/LIPIcs.ICALP.2020.134},
annote = {Keywords: Top-Down Tree Transducers, Earliest Transformation, Linear Transducers, Uniform-copying Transucers, Removal of Look-ahead, Removal of Inspection}
}
@InProceedings{nguyen_et_al:LIPIcs.ICALP.2020.135,
author = {Nguy\~{ê}n, L\^{e} Th\`{a}nh D\~{u}ng and Pradic, Pierre},
title = {{Implicit Automata in Typed \lambda-Calculi I: Aperiodicity in a Non-Commutative Logic}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {135:1--135:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.135},
URN = {urn:nbn:de:0030-drops-125426},
doi = {10.4230/LIPIcs.ICALP.2020.135},
annote = {Keywords: Church encodings, ordered linear types, star-free languages}
}
@InProceedings{niwinski_et_al:LIPIcs.ICALP.2020.136,
author = {Niwi\'{n}ski, Damian and Przyby{\l}ko, Marcin and Skrzypczak, Micha{\l}},
title = {{Computing Measures of Weak-MSO Definable Sets of Trees}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {136:1--136:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.136},
URN = {urn:nbn:de:0030-drops-125430},
doi = {10.4230/LIPIcs.ICALP.2020.136},
annote = {Keywords: infinite trees, weak alternating automata, coin-flipping measure}
}
@InProceedings{paul:LIPIcs.ICALP.2020.137,
author = {Paul, Erik},
title = {{Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {137:1--137:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.137},
URN = {urn:nbn:de:0030-drops-125447},
doi = {10.4230/LIPIcs.ICALP.2020.137},
annote = {Keywords: Weighted Tree Automata, Max-Plus Tree Automata, Finite Sequentiality, Decidability, Finite Ambiguity}
}
@InProceedings{piribauer_et_al:LIPIcs.ICALP.2020.138,
author = {Piribauer, Jakob and Baier, Christel},
title = {{On Skolem-Hardness and Saturation Points in Markov Decision Processes}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {138:1--138:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.138},
URN = {urn:nbn:de:0030-drops-125455},
doi = {10.4230/LIPIcs.ICALP.2020.138},
annote = {Keywords: Markov decision process, Skolem problem, stochastic shortest path, conditional expectation, conditional value-at-risk, model checking, frequency-LTL}
}
@InProceedings{remscrim:LIPIcs.ICALP.2020.139,
author = {Remscrim, Zachary},
title = {{The Power of a Single Qubit: Two-Way Quantum Finite Automata and the Word Problem}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {139:1--139:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.139},
URN = {urn:nbn:de:0030-drops-125468},
doi = {10.4230/LIPIcs.ICALP.2020.139},
annote = {Keywords: finite automata, quantum, word problem of a group}
}
@InProceedings{saarela:LIPIcs.ICALP.2020.140,
author = {Saarela, Aleksi},
title = {{Hardness Results for Constant-Free Pattern Languages and Word Equations}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {140:1--140:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.140},
URN = {urn:nbn:de:0030-drops-125472},
doi = {10.4230/LIPIcs.ICALP.2020.140},
annote = {Keywords: Combinatorics on words, pattern language, word equation}
}
@InProceedings{zhang_et_al:LIPIcs.ICALP.2020.141,
author = {Zhang, Wenbo and Yin, Qiang and Long, Huan and Xu, Xian},
title = {{Bisimulation Equivalence of Pushdown Automata Is Ackermann-Complete}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {141:1--141:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.141},
URN = {urn:nbn:de:0030-drops-125482},
doi = {10.4230/LIPIcs.ICALP.2020.141},
annote = {Keywords: PDA, Bisimulation, Equivalence checking}
}
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