Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Karl Bringmann, Vasileios Nakos |
Fast n-Fold Boolean Convolution via Additive Combinatorics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 41:1-41:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Enoch Peserico, Michele Scquizzato |
Matching on the Line Admits No o(√log n)-Competitive Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 103:1-103:3, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Borja Balle, Clara Lacroce, Prakash Panangaden, Doina Precup, Guillaume Rabusseau |
Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 118:1-118:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Christel Baier, Clemens Dubslaff, Florian Funke 0002, Simon Jantsch, Rupak Majumdar, Jakob Piribauer, Robin Ziemek |
From Verification to Causality-Based Explications (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 1:1-1:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc |
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 36:1-36:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Karl Bringmann, Debarati Das 0001 |
A Linear-Time n0.4-Approximation for Longest Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 39:1-39:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Tuukka Korhonen |
Lower Bounds on Dynamic Programming for Maximum Weight Independent Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 87:1-87:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Todd Schmid, Tobias Kappé, Dexter Kozen, Alexandra Silva 0001 |
Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 142:1-142:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow |
Optimal Transformations of Games and Automata Using Muller Conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 123:1-123:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Christian Coester, Elias Koutsoupias |
Towards the k-Server Conjecture: A Unifying Potential, Pushing the Frontier to the Circle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 57:1-57:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Hu Fu 0001, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang 0002 |
Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 68:1-68:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Telikepalli Kavitha |
Maximum Matchings and Popularity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 85:1-85:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Adam Karczmarz |
Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 83:1-83:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Marcin Bienkowski, Artur Kraska, Hsiang-Hsuan Liu |
Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 28:1-28:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Adam Polak 0001, Lars Rohwedder, Karol Wegrzycki |
Knapsack and Subset Sum with Small Items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 106:1-106:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Mitali Bafna, Nikhil Vyas 0001 |
Optimal Fine-Grained Hardness of Approximation of Linear Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 20:1-20:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Dominik D. Freydenberger, Liat Peterfreund |
The Theory of Concatenation over Finite Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 130:1-130:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci |
Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 59:1-59:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi |
Universal Algorithms for Clustering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 70:1-70:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Marin Bougeret, Bart M. P. Jansen, Ignasi Sau |
Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 16:1-16:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Wenbo Zhang 0004, Qiang Yin 0002, Huan Long, Xian Xu 0001 |
Bisimulation Equivalence of Pushdown Automata Is Ackermann-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 141:1-141:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Pascal Baumann 0001, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche |
The Complexity of Bounded Context Switching with Dynamic Thread Creation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 111:1-111:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Susanne Albers, Maximilian Janke |
Scheduling in the Random-Order Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 68:1-68:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Aaron Bernstein |
Improved Bounds for Matching in Random-Order Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 12:1-12:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Erik Paul |
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 137:1-137:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Michal Wlodarczyk 0001 |
Parameterized Inapproximability for Steiner Orientation by Gap Amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 104:1-104:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Shiri Chechik, Moran Nechushtan |
Simplifying and Unifying Replacement Paths Algorithms in Weighted Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 29:1-29:12, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Arnold Filtser |
Scattering and Sparse Partitions, and Their Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 47:1-47:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Martin Fürer, Carlos Hoppen, Vilmar Trevisan |
Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 52:1-52:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Taihei Oki |
On Solving (Non)commutative Weighted Edmonds' Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 89:1-89:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Laura Ciobanu, Alan D. Logan |
The Post Correspondence Problem and Equalisers for Certain Free Group and Monoid Morphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 120:1-120:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Suman K. Bera 0001, Amit Chakrabarti, Prantar Ghosh |
Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 11:1-11:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Titouan Carette, Emmanuel Jeandel |
A Recipe for Quantum Graphical Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 118:1-118:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Pál András Papp, Roger Wattenhofer |
Network-Aware Strategies in Financial Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 91:1-91:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Michael Benedikt, Egor V. Kostylev, Tony Tan |
Two Variable Logic with Ultimately Periodic Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 112:1-112:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Arturo I. Merino, Andreas Wiese |
On the Two-Dimensional Knapsack Problem for Convex Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 84:1-84:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Marco Gaboardi, Kobbi Nissim, David Purser |
The Complexity of Verifying Loop-Free Programs as Differentially Private. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 129:1-129:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Rupak Majumdar, Mahmoud Salamati, Sadegh Soudjani |
On Decidability of Time-Bounded Reachability in CTMDPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 133:1-133:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Rogers Epstein, Sandeep Silwal |
Property Testing of LP-Type Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 98:1-98:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | George Christodoulou 0001, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, Clara Waldmann |
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 32:1-32:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Panagiotis Charalampopoulos, Pawel Gawrychowski, Karol Pokorski |
Dynamic Longest Common Substring in Polylogarithmic Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 27:1-27:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Dimitris Fotakis 0001, Anthimos Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos, Stratis Skoulakis |
Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 50:1-50:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Toniann Pitassi, Morgan Shirley, Thomas Watson 0001 |
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 92:1-92:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Kevin Buchin, Chenglin Fan, Maarten Löffler, Aleksandr Popov 0001, Benjamin Raichel, Marcel Roeloffzen |
Fréchet Distance for Uncertain Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 20:1-20:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Gawrychowski, Shay Mozes, Oren Weimann |
Minimum Cut in O(m log² n) Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 57:1-57:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Argyrios Deligkas, John Fearnley, Rahul Savani |
Tree Polymatrix Games Are PPAD-Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 38:1-38:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Chaya Ganesh, Bernardo Magri, Daniele Venturi 0001 |
Cryptographic Reverse Firewalls for Interactive Proof Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 55:1-55:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Magnus Wahlström |
On Quasipolynomial Multicut-Mimicking Networks and Kernelization of Multiway Cut Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 101:1-101:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Zhihao Jiang, Debmalya Panigrahi, Kevin Sun 0001 |
Online Algorithms for Weighted Paging with Predictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 69:1-69:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 0:1-0:36, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 95:1-95:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Shuai Shao 0001, Yuxin Sun |
Contraction: A Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 96:1-96:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Lê Thành Dung Nguyên, Cécilia Pradic |
Implicit Automata in Typed λ-Calculi I: Aperiodicity in a Non-Commutative Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 135:1-135:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, Li-Yang Tan |
The Power of Many Samples in Query Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 9:1-9:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Samir Datta, Pankaj Kumar, Anish Mukherjee 0001, Anuj Tawari, Nils Vortmeier, Thomas Zeume |
Dynamic Complexity of Reachability: How Many Changes Can We Handle? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 122:1-122:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Andrew Chi-Chih Yao |
An Incentive Analysis of Some Bitcoin Fee Designs (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 1:1-1:12, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson |
Robust Algorithms Under Adversarial Injections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 56:1-56:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Libor Barto, Marcin Kozik, Johnson Tan, Matt Valeriote |
Sensitive Instances of the Constraint Satisfaction Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 110:1-110:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Tsvi Kopelowitz, Virginia Vassilevska Williams |
Towards Optimal Set-Disjointness and Set-Intersection Data Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 74:1-74:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Andrés Fielbaum, Ignacio Morales, José Verschae |
A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 46:1-46:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Zachary Remscrim |
The Power of a Single Qubit: Two-Way Quantum Finite Automata and the Word Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 139:1-139:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Aditya Potukuchi |
A Spectral Bound on Hypergraph Discrepancy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 93:1-93:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo 0001, Dan Suciu |
Decision Problems in Information Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 106:1-106:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz |
Faster Minimization of Tardy Processing Time on a Single Machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 19:1-19:12, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Tobias Mömke, Andreas Wiese |
Breaking the Barrier of 2 for the Storage Allocation Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 86:1-86:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Mikolaj Bojanczyk, Rafal Stefanski |
Single-Use Automata and Transducers for Infinite Alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 113:1-113:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Shaddin Dughmi |
The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 42:1-42:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay |
Scheduling Lower Bounds via AND Subset Sum. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 4:1-4:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Dimitris Fotakis 0001, Loukas Kavouras, Grigorios Koumoutsos, Stratis Skoulakis, Manolis Vardas |
The Online Min-Sum Set Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 51:1-51:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Galanis, Leslie Ann Goldberg, Heng Guo 0001, Kuan Yang |
Counting Solutions to Random CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 53:1-53:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Shiri Chechik, Ofer Magen |
Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 81:1-81:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Mina Dalirrooyfard, Virginia Vassilevska Williams |
Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 35:1-35:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Evi Micha, Nisarg Shah 0001 |
Proportionally Fair Clustering Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 85:1-85:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Hsin-Hao Su, Nicole Wein |
Lower Bounds for Dynamic Distributed Task Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 99:1-99:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Armin Weiß |
Hardness of Equations over Finite Solvable Groups Under the Exponential Time Hypothesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 102:1-102:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Mingmou Liu, Yitong Yin, Huacheng Yu |
Succinct Filters for Sets of Unknown Sizes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 79:1-79:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Alin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud |
Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 114:1-114:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini |
The Strahler Number of a Parity Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 123:1-123:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Amir Abboud, Shon Feller, Oren Weimann |
On the Fine-Grained Complexity of Parity Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 5:1-5:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Boaz Barak, Raphaëlle Crubillé, Ugo Dal Lago |
On Higher-Order Cryptography. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 108:1-108:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Naor Alaluf, Alina Ene, Moran Feldman, Huy L. Nguyen, Andrew Suh |
Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 6:1-6:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jan Dreier, Henri Lotze, Peter Rossmanith |
Hard Problems on Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 40:1-40:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Frédéric Magniez, Ashwin Nayak 0001 |
Quantum Distributed Complexity of Set Disjointness on a Line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 82:1-82:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke, Dominik Wojtczak |
How to Play in Infinite MDPs (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 3:1-3:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Anindya De, Sanjeev Khanna, Huan Li 0002, Hesam Nikpey |
An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 37:1-37:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Greg Bodwin, Keerti Choudhary, Merav Parter, Noa Shahar |
New Fault Tolerant Subset Preservers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 15:1-15:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys |
Cost Automata, Safe Schemes, and Downward Closures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 109:1-109:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Artem Govorov, Jin-Yi Cai, Martin E. Dyer |
A Dichotomy for Bounded Degree Graph Homomorphisms with Nonnegative Weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 66:1-66:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Damian Niwinski, Marcin Przybylko, Michal Skrzypczak |
Computing Measures of Weak-MSO Definable Sets of Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 136:1-136:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman |
Spectral Sparsification via Bounded-Independence Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 39:1-39:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Anuj Dawar, Gregory Wilsenach |
Symmetric Arithmetic Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 36:1-36:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Georgina Bumpus, Christoph Haase, Stefan Kiefer, Paul-Ioan Stoienescu, Jonathan Tanner |
On the Size of Finite Rational Matrix Semigroups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 115:1-115:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin |
The Adversarial Stackelberg Value in Quantitative Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 127:1-127:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker |
Hrushovski's Encoding and ω-Categorical CSP Monsters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 131:1-131:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Artur Czumaj, Anuj Dawar, Emanuela Merelli (eds.) |
47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2 The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
1 | Dan Alistarh, Giorgi Nadiradze, Amirmojtaba Sabour |
Dynamic Averaging Load Balancing on Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 7:1-7:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Sandra Kiefer, Brendan D. McKay |
The Iteration Number of Colour Refinement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 73:1-73:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Julia Chuzhoy, Merav Parter, Zihan Tan |
On Packing Low-Diameter Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 33:1-33:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Maryam Bahrani, Nicole Immorlica, Divyarthi Mohan, S. Matthew Weinberg |
Asynchronous Majority Dynamics in Preferential Attachment Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 8:1-8:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan Guruswami, Sai Sandeep |
d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 62:1-62:12, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|