Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID48th ICALP 2021: Glasgow, Scotland (Virtual Conference)
- Nikhil Bansal, Emanuela Merelli
, James Worrell:
48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference). LIPIcs 198, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-195-5 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:38
- Christel Baier, Clemens Dubslaff, Florian Funke, Simon Jantsch, Rupak Majumdar, Jakob Piribauer, Robin Ziemek:
From Verification to Causality-Based Explications (Invited Talk). 1:1-1:20 - Andrei A. Bulatov:
Symmetries and Complexity (Invited Talk). 2:1-2:17 - Keren Censor-Hillel:
Distributed Subgraph Finding: Progress and Challenges (Invited Talk). 3:1-3:14 - Orr Dunkelman, Zeev Geyzel, Chaya Keller, Nathan Keller, Eyal Ronen, Adi Shamir, Ran J. Tessler:
Error Resilient Space Partitioning (Invited Talk). 4:1-4:22 - Toniann Pitassi:
Algebraic Proof Systems (Invited Talk). 5:1-5:1 - David P. Woodruff:
A Very Sketchy Talk (Invited Talk). 6:1-6:8 - Amir Abboud, Virginia Vassilevska Williams:
Fine-Grained Hardness for Edit Distance to a Fixed Sequence. 7:1-7:14 - Dimitris Achlioptas, Kostas Zampetakis:
Local Approximations of the Independent Set Polynomial. 8:1-8:16 - Deeksha Adil, Brian Bullins, Rasmus Kyng, Sushant Sachdeva:
Almost-Linear-Time Weighted 𝓁p-Norm Solvers in Slightly Dense Graphs via Sparsification. 9:1-9:15 - Pankaj K. Agarwal, Alex Steiger:
An Output-Sensitive Algorithm for Computing the Union of Cubes and Fat Boxes in 3D. 10:1-10:20 - Pankaj K. Agarwal, Xiao Hu, Stavros Sintos, Jun Yang:
Dynamic Enumeration of Similarity Joins. 11:1-11:19 - Shyan Akmal, Ce Jin:
Faster Algorithms for Bounded Tree Edit Distance. 12:1-12:15 - Shyan Akmal, Virginia Vassilevska Williams:
Improved Approximation for Longest Common Subsequence over Small Alphabets. 13:1-13:18 - Noga Alon, Andrei Graur:
Efficient Splitting of Necklaces. 14:1-14:17 - Markus Anders, Pascal Schweitzer, Florian Wetzels:
Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case. 15:1-15:15 - Markus Anders, Pascal Schweitzer:
Search Problems in Trees with Symmetries: Near Optimal Traversal Strategies for Individualization-Refinement Algorithms. 16:1-16:21 - Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop. 17:1-17:20 - Vahid R. Asadi, Igor Shinkar:
Relaxed Locally Correctable Codes with Improved Parameters. 18:1-18:12 - Sepehr Assadi, Soheil Behnezhad:
Beating Two-Thirds For Random-Order Streaming Matching. 19:1-19:13 - Mitali Bafna, Nikhil Vyas:
Optimal Fine-Grained Hardness of Approximation of Linear Equations. 20:1-20:19 - Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani:
Revisiting Priority k-Center: Fairness and Outliers. 21:1-21:20 - Étienne Bamas, Paritosh Garg, Lars Rohwedder:
The Submodular Santa Claus Problem in the Restricted Assignment Case. 22:1-22:18 - Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov:
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. 23:1-23:15 - Eleni Batziou, Kristoffer Arnsfelt Hansen, Kasper Høgh:
Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem. 24:1-24:20 - Ran Ben Basat, Michael Mitzenmacher, Shay Vargaftik:
How to Send a Real Number Using a Single Bit (And Some Shared Randomness). 25:1-25:20 - Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche:
Using a Geometric Lens to Find k Disjoint Shortest Paths. 26:1-26:14 - Sayan Bhattacharya, Peter Kiss:
Deterministic Rounding of Dynamic Fractional Matchings. 27:1-27:14 - Marcin Bienkowski, Artur Kraska, Hsiang-Hsuan Liu:
Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times. 28:1-28:20 - Andreas Björklund, Petteri Kaski:
Counting Short Vector Pairs by Inner Product and Relations to the Permanent. 29:1-29:21 - Guy Blanc, Jane Lange, Li-Yang Tan:
Learning Stochastic Decision Trees. 30:1-30:16 - Joakim Blikstad:
Breaking O(nr) for Matroid Intersection. 31:1-31:17 - Jan Böker:
Graph Similarity and Homomorphism Densities. 32:1-32:17 - Andrej Bogdanov, Gautam Prakriya:
Direct Sum and Partitionability Testing over General Groups. 33:1-33:19 - Édouard Bonnet:
4 vs 7 Sparse Undirected Unweighted Diameter is SETH-Hard at Time n^{4/3}. 34:1-34:15 - Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width III: Max Independent Set, Min Dominating Set, and Coloring. 35:1-35:20 - Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. 36:1-36:20 - Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
Conditional Dichotomy of Boolean Ordered Promise CSPs. 37:1-37:15 - Cornelius Brand, Kevin Pratt:
Parameterized Applications of Symbolic Differentiation of (Totally) Multilinear Polynomials. 38:1-38:19 - Karl Bringmann, Debarati Das:
A Linear-Time n0.4-Approximation for Longest Common Subsequence. 39:1-39:20 - Karl Bringmann, Jasper Slusallek:
Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal. 40:1-40:16 - Karl Bringmann, Vasileios Nakos:
Fast n-Fold Boolean Convolution via Additive Combinatorics. 41:1-41:17 - Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese:
Additive Approximation Schemes for Load Balancing Problems. 42:1-42:17 - Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli:
Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. 43:1-43:18 - Marco Carmosino, Kenneth Hoover, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
Lifting for Constant-Depth Circuits and Applications to MCSP. 44:1-44:20 - Ruoxu Cen, Yu Cheng, Debmalya Panigrahi, Kevin Sun:
Sparsification of Directed Graphs via Cut Balance. 45:1-45:21 - Keren Censor-Hillel, Noa Marelly, Roy Schwartz, Tigran Tonoyan:
Fault Tolerant Max-Cut. 46:1-46:20 - Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu:
Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths. 47:1-47:21 - Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
An Almost Optimal Edit Distance Oracle. 48:1-48:20 - Chandra Chekuri, Kent Quanrud:
Faster Algorithms for Rooted Connectivity in Directed Graphs. 49:1-49:16 - Chandra Chekuri, Kent Quanrud:
Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity. 50:1-50:20 - Lijie Chen, Zhenjian Lu, Xin Lyu, Igor C. Oliveira:
Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹. 51:1-51:20 - Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu:
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. 52:1-52:19 - Yu Chen, Sanjeev Khanna, Ansh Nagda:
Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries. 53:1-53:21 - Kuan Cheng, Alireza Farhadi, MohammadTaghi Hajiaghayi, Zhengzhong Jin, Xin Li, Aviad Rubinstein, Saeed Seddighin, Yu Zheng:
Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence. 54:1-54:20 - Andrew M. Childs, Shih-Han Hung, Tongyang Li:
Quantum Query Complexity with Matrix-Vector Products. 55:1-55:19 - George Christodoulou, Elias Koutsoupias, Annamária Kovács:
Truthful Allocation in Graphs and Hypergraphs. 56:1-56:20 - Christian Coester, Elias Koutsoupias:
Towards the k-Server Conjecture: A Unifying Potential, Pushing the Frontier to the Circle. 57:1-57:20 - Artur Czumaj, George Kontogeorgiou, Mike Paterson:
Haystack Hunting Hints and Locker Room Communication. 58:1-58:20 - Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci:
Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies. 59:1-59:19 - Mina Dalirrooyfard, Jenny Kaufmann:
Approximation Algorithms for Min-Distance Problems in DAGs. 60:1-60:17 - Christoph Damerius, Dominik Kaaser, Peter Kling, Florian Schneider:
On Greedily Packing Anchored Rectangles. 61:1-61:20 - Ewan Davies, Will Perkins:
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. 62:1-62:18 - Jonas Ellert, Johannes Fischer:
Linear Time Runs Over General Ordered Alphabets. 63:1-63:16 - Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary. 64:1-64:20 - Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis:
On the Approximability of Multistage Min-Sum Set Cover. 65:1-65:19 - Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik:
A Spectral Independence View on Hard Spheres via Block Dynamics. 66:1-66:15 - Zachary Friggstad, Chaitanya Swamy:
Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime. 67:1-67:21 - Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang:
Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications. 68:1-68:20 - Bernd Gärtner, Sebastian Haslebacher, Hung P. Hoang:
A Subexponential Algorithm for ARRIVAL. 69:1-69:14 - Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi:
Universal Algorithms for Clustering Problems. 70:1-70:20 - Arnab Ganguly, Dhrumil Patel, Rahul Shah, Sharma V. Thankachan:
LF Successor: Compact Space Indexing for Order-Isomorphic Pattern Matching. 71:1-71:19 - Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber:
Crossing-Optimal Extension of Simple Drawings. 72:1-72:17 - Uma Girish, Ran Raz, Wei Zhan:
Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. 73:1-73:20 - Nick Gravin, Zhihao Gavin Tang, Kangning Wang:
Online Stochastic Matching with Edge Arrivals. 74:1-74:20 - Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. 75:1-75:20 - Yong Gu, Hanlin Ren:
Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time. 76:1-76:20 - Anupam Gupta, Benjamin Moseley, Rudy Zhou:
Structural Iterative Rounding for Generalized k-Median Problems. 77:1-77:18 - Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc:
Near-Optimal Schedules for Simultaneous Multicasts. 78:1-78:19 - Maria Hartmann, László Kozma, Corwin Sinnamon, Robert E. Tarjan:
Analysis of Smooth Heaps and Slim Heaps. 79:1-79:20 - Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen:
Approximating Maximum Integral Multiflows on Bounded Genus Graphs. 80:1-80:18 - Sharat Ibrahimpur, Chaitanya Swamy:
Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan. 81:1-81:20 - Hyejung H. Jee, Carlo Sparaciari, Omar Fawzi, Mario Berta:
Quasi-Polynomial Time Algorithms for Free Quantum Games in Bounded Dimension. 82:1-82:20 - Adam Karczmarz:
Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems. 83:1-83:20 - Tali Kaufman, Izhar Oppenheim:
Coboundary and Cosystolic Expansion from Strong Symmetry. 84:1-84:16 - Telikepalli Kavitha:
Maximum Matchings and Popularity. 85:1-85:21 - Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman:
Automorphisms and Isomorphisms of Maps in Linear Time. 86:1-86:15 - Tuukka Korhonen:
Lower Bounds on Dynamic Programming for Maximum Weight Independent Set. 87:1-87:14 - Michal Koucký, Karel Král:
Sorting Short Integers. 88:1-88:17 - Jakub Kozik:
Improving Gebauer's Construction of 3-Chromatic Hypergraphs with Few Edges. 89:1-89:9 - Adam Kurpisz, Aaron Potechin, Elias Samuel Wirth:
SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization. 90:1-90:20 - J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel, Tobias Friedrich:
On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order. 91:1-91:15 - Michael Lampis:
Minimum Stable Cut and Treewidth. 92:1-92:16 - Reut Levi:
Testing Triangle Freeness in the General Model in Graphs with Arboricity O(√n). 93:1-93:13 - Zhenjian Lu, Igor C. Oliveira:
An Efficient Coding Theorem via Probabilistic Representations and Its Applications. 94:1-94:20 - Dániel Marx, Govind S. Sankar, Philipp Schepper:
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. 95:1-95:20 - Theo McKenzie, Sidhanth Mohanty:
High-Girth Near-Ramanujan Graphs with Lossy Vertex Expansion. 96:1-96:15 - Benjamin Moseley, Kirk Pruhs, Alireza Samadian, Yuyan Wang:
Relational Algorithms for k-Means Clustering. 97:1-97:21 - Yonatan Nakar, Dana Ron:
Testing Dynamic Environments: Back to Basics. 98:1-98:20 - Eike Neumann, Joël Ouaknine, James Worrell:
Decision Problems for Second-Order Holonomic Recurrences. 99:1-99:20 - Ilan Newman, Nithin Varma:
New Sublinear Algorithms and Lower Bounds for LIS Estimation. 100:1-100:20 - Takaaki Nishimoto, Yasuo Tabei:
Optimal-Time Queries on BWT-Runs Compressed Indexes. 101:1-101:15 - Ojas Parekh, Kevin Thompson:
Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation Algorithms. 102:1-102:20 - Enoch Peserico, Michele Scquizzato:
Matching on the Line Admits No o(√log n)-Competitive Algorithm. 103:1-103:3 - Seth Pettie, Dingyu Wang, Longhui Yin:
Non-Mergeable Sketching for Cardinality Estimation. 104:1-104:20 - Seth Pettie, Longhui Yin:
The Structure of Minimum Vertex Cuts. 105:1-105:20 - Adam Polak, Lars Rohwedder, Karol Wegrzycki:
Knapsack and Subset Sum with Small Items. 106:1-106:19 - Nicolás Rivera, Thomas Sauerwald, John Sylvester:
Multiple Random Walks on Graphs: Mixing Few to Cover Many. 107:1-107:16 - Marc Roth, Johannes Schmitt, Philip Wellnitz:
Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. 108:1-108:16 - Amin Saberi, David Wajc:
The Greedy Algorithm Is not Optimal for On-Line Edge Coloring. 109:1-109:18 - Joran van Apeldoorn, Sander Gribling, Yinan Li, Harold Nieuwboer, Michael Walter, Ronald de Wolf:
Quantum Algorithms for Matrix Scaling and Matrix Balancing. 110:1-110:17 - Emanuele Viola:
Fourier Conjectures, Correlation Bounds, and Majority. 111:1-111:15 - David P. Woodruff, Samson Zhou:
Separations for Estimating Large Frequency Moments on Data Streams. 112:1-112:21 - Or Zamir:
Breaking the 2ⁿ Barrier for 5-Coloring and 6-Coloring. 113:1-113:20 - Tianyi Zhang:
Deterministic Maximum Flows in Simple Graphs. 114:1-114:16 - Samson Abramsky, Luca Reggio:
Arboreal Categories and Resources. 115:1-115:20 - Antoine Amarilli, Louis Jachiet, Charles Paperman:
Dynamic Membership for Regular Languages. 116:1-116:17 - Paolo Baldan, Francesco Ranzato, Linpeng Zhang:
A Rice's Theorem for Abstract Semantics. 117:1-117:19 - Borja Balle, Clara Lacroce, Prakash Panangaden, Doina Precup, Guillaume Rabusseau:
Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata. 118:1-118:20 - Gabriel Bathie, Tatiana Starikovskaya:
Property Testing of Regular Languages with Applications to Streaming Property Testing of Visibly Pushdown Languages. 119:1-119:17 - Manuel Bodirsky, Simon Knäuer, Sebastian Rudolph:
Datalog-Expressibility for Monadic and Guarded Second-Order Logic. 120:1-120:17 - Alex Brandts, Stanislav Zivný:
Beyond PCSP(1-in-3, NAE). 121:1-121:14 - Antonin Callard, Pascal Vanier:
Computational Characterization of Surface Entropies for ℤ² Subshifts of Finite Type. 122:1-122:20 - Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow:
Optimal Transformations of Games and Automata Using Muller Conditions. 123:1-123:14 - Krishnendu Chatterjee, Monika Henzinger, Sagar Kale, Alexander Svozil:
Faster Algorithms for Bounded Liveness in Graphs and Game Graphs. 124:1-124:21 - Luca Ciccone, Luca Padovani:
Inference Systems with Corules for Fair Subtyping and Liveness Properties of Binary Session Types. 125:1-125:16 - Lorenzo Clemente, Michal Skrzypczak:
Deterministic and Game Separability for Regular Languages of Infinite Trees. 126:1-126:15 - Thomas Colcombet, Arthur Jaquard:
A Complexity Approach to Tree Algebras: the Bounded Case. 127:1-127:13 - Wojciech Czerwinski, Slawomir Lasota, Lukasz Orlikowski:
Improved Lower Bounds for Reachability in Vector Addition Systems. 128:1-128:15 - Wojciech Czerwinski, Antoine Mottet, Karin Quaas:
New Techniques for Universality in Unambiguous Register Automata. 129:1-129:16 - Dominik D. Freydenberger, Liat Peterfreund:
The Theory of Concatenation over Finite Models. 130:1-130:17 - Sergey Goncharov:
Uniform Elgot Iteration in Foundations. 131:1-131:16 - Alexandre Goy, Daniela Petrisan, Marc Aiguier:
Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces. 132:1-132:14 - Erich Grädel, Lovro Mrkonjic:
Elementary Equivalence Versus Isomorphism in Semiring Semantics. 133:1-133:20 - Martin Grohe, Sandra Kiefer:
Logarithmic Weisfeiler-Leman Identifies All Planar Graphs. 134:1-134:20 - Gabriel Istrate, Cosmin Bonchis, Adrian Craciun:
Kernelization, Proof Complexity and Social Choice. 135:1-135:21 - Yangjia Li, Dominique Unruh:
Quantum Relational Hoare Logic with Expectations. 136:1-136:20 - Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Playing Stochastically in Weighted Timed Games to Emulate Memory. 137:1-137:17 - Antoine Mottet, Tomás Nagy, Michael Pinsker, Michal Wrona:
Smooth Approximations and Relational Width Collapses. 138:1-138:20 - Lê Thành Dung Nguyên, Camille Noûs, Cécilia Pradic:
Comparison-Free Polyregular Functions. 139:1-139:20 - Pawel Parys:
Higher-Order Model Checking Step by Step. 140:1-140:16 - Ian Pratt-Hartmann:
Fluted Logic with Counting. 141:1-141:17 - Todd Schmid, Tobias Kappé, Dexter Kozen, Alexandra Silva:
Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness. 142:1-142:14 - Han Xu, Zhenjiang Hu:
Analytical Differential Calculus with Integration. 143:1-143:20
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-29 21:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
