default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID51st ICALP 2024: Tallinn, Estonia
- Karl Bringmann
, Martin Grohe, Gabriele Puppis, Ola Svensson:
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia. LIPIcs 297, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-322-5 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xl
- Anuj Dawar:
Limits of Symmetric Computation (Invited Talk). 1:1-1:8 - Edith Elkind:
Group Fairness: Multiwinner Voting and Beyond (Invited Talk). 2:1-2:1 - Danupon Nanongkai:
Cross-Paradigm Graph Algorithms (Invited Talk). 3:1-3:1 - Merav Parter:
Graphs Shortcuts: New Bounds and Algorithms (Invited Talk). 4:1-4:1 - Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jaroslaw Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely:
An O(loglog n)-Approximation for Submodular Facility Location. 5:1-5:20 - Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. 6:1-6:19 - Elie Abboud, Noga Ron-Zewi:
Finer-Grained Reductions in Fine-Grained Hardness of Approximation. 7:1-7:17 - Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese:
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. 8:1-8:20 - Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein:
Detecting Disjoint Shortest Paths in Linear Time and More. 9:1-9:17 - Emile Anand, Jan van den Brand, Mehrdad Ghadiri, Daniel J. Zhang:
The Bit Complexity of Dynamic Algebraic Formulas and Their Determinants. 10:1-10:20 - Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang:
Approximate Counting for Spin Systems in Sub-Quadratic Time. 11:1-11:20 - Noel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam:
From Proof Complexity to Circuit Complexity via Interactive Protocols. 12:1-12:20 - Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez, Carlos Palazuelos:
Learning Low-Degree Quantum Objects. 13:1-13:19 - Vikraman Arvind, Pushkar S. Joglekar:
A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results. 14:1-14:19 - Yossi Azar, Shahar Lewkowicz, Danny Vainstein:
List Update with Delays or Time Windows. 15:1-15:20 - Omkar Baraskar, Agrim Dewan, Chandan Saha, Pulkit Sinha:
NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support Polynomials. 16:1-16:21 - Surender Baswana, Koustav Bhanja:
Vital Edges for (s, t)-Mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity Oracles. 17:1-17:20 - MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki:
It's Hard to HAC Average Linkage! 18:1-18:18 - Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Sublinear Algorithms for TSP via Path Covers. 19:1-19:16 - Djamal Belazzougui, Gregory Kucherov, Stefan Walzer:
Better Space-Time-Robustness Trade-Offs for Set Reconciliation. 20:1-20:19 - Shalev Ben-David, Srijita Kundu:
Oracle Separation of QMA and QCMA with Bounded Adaptivity. 21:1-21:18 - Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen:
Two-Sets Cut-Uncut on Planar Graphs. 22:1-22:18 - Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
Splitting-Off in Hypergraphs. 23:1-23:20 - Somnath Bhattacharjee, Markus Bläser, Pranjal Dutta, Saswata Mukherjee:
Exponential Lower Bounds via Exponential Sums. 24:1-24:20 - Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar:
Random Separating Hyperplane Theorem and Learning Polytopes. 25:1-25:20 - Andreas Björklund, Petteri Kaski, Jesper Nederlof:
Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. 26:1-26:20 - Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, Chen Wang:
The Discrepancy of Shortest Paths. 27:1-27:20 - Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu:
Additive Spanner Lower Bounds with Optimal Inner Graph Structure. 28:1-28:17 - Narek Bojikian, Stefan Kratsch:
A Tight Monte-Carlo Algorithm for Steiner Tree Parameterized by Clique-Width. 29:1-29:18 - Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann:
Õptimal Dynamic Time Warping on Run-Length Encoded Strings. 30:1-30:17 - Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Tight Bounds on Adjacency Labels for Monotone Graph Classes. 31:1-31:20 - Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider, Simon Weber:
Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents. 32:1-32:18 - Marin Bougeret, Bart M. P. Jansen, Ignasi Sau:
Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. 33:1-33:20 - Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski:
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. 34:1-34:17 - Charlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi:
A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs. 35:1-35:18 - Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, Stéphan Thomassé:
Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems. 36:1-36:18 - Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams:
Fast Approximate Counting of Cycles. 37:1-37:20 - Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai:
The Group Access Bounds for Binary Search Trees. 38:1-38:18 - Panagiotis Charalampopoulos, Pawel Gawrychowski, Samah Ghazawi:
Optimal Bounds for Distinct Quartics. 39:1-39:17 - Shiri Chechik, Doron Mukhtar, Tianyi Zhang:
Streaming Edge Coloring with Subquadratic Palette Size. 40:1-40:12 - Shiri Chechik, Tianyi Zhang:
Faster Algorithms for Dual-Failure Replacement Paths. 41:1-41:20 - Shiri Chechik, Tianyi Zhang:
Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size. 42:1-42:18 - Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, Adrian Vetta:
Robot Positioning Using Torus Packing for Multisets. 43:1-43:18 - Junjie Chen, Minming Li, Haifeng Xu, Song Zuo:
Bayesian Calibrated Click-Through Auctions. 44:1-44:18 - Li Chen, Mingquan Ye:
High-Accuracy Multicommodity Flows via Iterative Refinement. 45:1-45:19 - Yu Chen, Michael Kapralov, Mikhail Makarov, Davide Mazzali:
On the Streaming Complexity of Expander Decomposition. 46:1-46:20 - Yu Chen, Zihan Tan:
Lower Bounds on 0-Extension with Steiner Nodes. 47:1-47:18 - Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand, Giovanna Varricchio:
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games. 48:1-48:18 - Mónika Csikós, Nabil H. Mustafa:
An Optimal Sparsification Lemma for Low-Crossing Matchings and Its Applications to Discrepancy and Approximations. 49:1-49:18 - Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Fully-Scalable MPC Algorithms for Clustering in High Dimension. 50:1-50:20 - Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic:
Computing Tree Decompositions with Small Independence Number. 51:1-51:18 - Sami Davies, Benjamin Moseley, Heather Newman:
Simultaneously Approximating All 𝓁p-Norms in Correlation Clustering. 52:1-52:20 - Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan:
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. 53:1-53:18 - Holger Dell, John Lapinskas, Kitty Meeks:
Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs. 54:1-54:17 - Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.:
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. 55:1-55:18 - Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Lower Bounds for Matroid Optimization Problems with a Linear Constraint. 56:1-56:20 - Ilan Doron-Arad, Joseph (Seffi) Naor:
Non-Linear Paging. 57:1-57:19 - Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos:
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. 58:1-58:19 - Aditi Dudeja:
Decremental Matching in General Weighted Graphs. 59:1-59:20 - Talya Eden, Reut Levi, Dana Ron:
Testing C_k-Freeness in Bounded-Arboricity Graphs. 60:1-60:20 - Andreas Emil Feldmann, Michael Lampis:
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. 61:1-61:20 - Weiming Feng, Heng Guo:
An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs. 62:1-62:19 - Yuda Feng, Shi Li:
A Note on Approximating Weighted Nash Social Welfare with Additive Valuations. 63:1-63:9 - Nick Fischer, Leo Wennmann:
Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time. 64:1-64:15 - Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Optimal Electrical Oblivious Routing on Expanders. 65:1-65:19 - Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. 66:1-66:19 - Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma:
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. 67:1-67:19 - Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki:
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. 68:1-68:18 - Serge Gaspers, Jerry Zirui Li:
Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing Problems. 69:1-69:20 - Sevag Gharibian, Jonas Kamminga:
BQP, Meet NP: Search-To-Decision Reductions and Approximate Counting. 70:1-70:19 - Prantar Ghosh, Manuel Stoeckl:
Low-Memory Algorithms for Online Edge Coloring. 71:1-71:19 - Yiannis Giannakopoulos, Alexander Grosz, Themistoklis Melissourgos:
On the Smoothed Complexity of Combinatorial Local Search. 72:1-72:19 - Matan Gilboa:
A Characterization of Complexity in Public Goods Games. 73:1-73:19 - Guy Goldberg:
Linear Relaxed Locally Decodable and Correctable Codes Do Not Need Adaptivity and Two-Sided Error. 74:1-74:20 - Lucas Gretta, Eric Price:
Sharp Noisy Binary Search with Monotonic Probabilities. 75:1-75:19 - Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz:
Solution Discovery via Reconfiguration for Problems in P. 76:1-76:20 - Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski:
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters. 77:1-77:21 - Martin Grohe, Daniel Neuen:
Isomorphism for Tournaments of Small Twin Width. 78:1-78:20 - Leonid Gurvits, Nathan Klein, Jonathan Leake:
From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP. 79:1-79:20 - Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski:
Distributed Fast Crash-Tolerant Consensus with Nearly-Linear Quantum Communication. 80:1-80:19 - Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos:
Oracle-Augmented Prophet Inequalities. 81:1-81:19 - Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni:
Refuting Approaches to the Log-Rank Conjecture for XOR Functions. 82:1-82:11 - Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay:
No Polynomial Kernels for Knapsack. 83:1-83:17 - Sophia Heimann, Hung P. Hoang, Stefan Hougardy:
The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5. 84:1-84:18 - Shuichi Hirahara, Naoto Ohsaka:
Optimal PSPACE-Hardness of Approximating Set Cover Reconfiguration. 85:1-85:18 - Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz:
Problems on Group-Labeled Matroid Bases. 86:1-86:20 - Kevin Hua, Daniel Li, Jaewoo Park, Thatchaphol Saranurak:
Finding Most-Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time. 87:1-87:19 - Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. 88:1-88:18 - Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara:
Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. 89:1-89:19 - Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Dynamic PageRank: Algorithms and Lower Bounds. 90:1-90:19 - Agastya Vibhuti Jha, Akash Kumar:
A Sublinear Time Tester for Max-Cut on Clusterable Graphs. 91:1-91:17 - Shaofeng H.-C. Jiang, Wenqian Wang, Yubo Zhang, Yuhao Zhang:
Algorithms for the Generalized Poset Sorting Problem. 92:1-92:15 - Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian:
Streaming Algorithms for Connectivity Augmentation. 93:1-93:20 - Ce Jin, Hongxun Wu:
A Faster Algorithm for Pigeonhole Equal Sums. 94:1-94:11 - Adam Karczmarz, Marcin Smulewicz:
Fully Dynamic Strongly Connected Components in Planar Digraphs. 95:1-95:20 - Yasushi Kawase, Koichi Nishimura, Hanna Sumita:
Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets. 96:1-96:19 - Yotam Kenneth, Robert Krauthgamer:
Cut Sparsification and Succinct Representation of Submodular Hypergraphs. 97:1-97:17 - Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs. 98:1-98:17 - Boris Klemz, Marie Diana Sieper:
Constrained Level Planarity Is FPT with Respect to the Vertex Cover Number. 99:1-99:17 - Yusuke Kobayashi, Tatsuya Terao:
Subquadratic Submodular Maximization with a General Matroid Constraint. 100:1-100:19 - Tsvi Kopelowitz, Ariel Korin, Liam Roditty:
On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch. 101:1-101:18 - Soh Kumabe, Yuichi Yoshida:
Lipschitz Continuous Allocations for Optimization Games. 102:1-102:16 - William Kuszmaul, Zoe Xi:
Towards an Analysis of Quadratic Probing. 103:1-103:19 - Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, Or Zamir:
Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. 104:1-104:12 - Eunou Lee, Ojas Parekh:
An Improved Quantum Max Cut Approximation via Maximum Matching. 105:1-105:11 - Shi Li, Chenyang Xu, Ruilong Zhang:
Polylogarithmic Approximations for Robust s-t Path. 106:1-106:17 - Shuangle Li, Bingkai Lin, Yuwei Liu:
Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems Under ETH. 107:1-107:20 - Xin Li, Yan Zhong:
Two-Source and Affine Non-Malleable Extractors for Small Entropy. 108:1-108:15 - Yaowei Long, Yunfan Wang:
Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity. 109:1-109:20 - Zhenjian Lu, Rahul Santhanam:
Impagliazzo's Worlds Through the Lens of Conditional Kolmogorov Complexity. 110:1-110:17 - Yury Makarychev, Max Ovsiankin, Erasmo Tani:
Approximation Algorithms for 𝓁p-Shortest Path and 𝓁p-Group Steiner Tree. 111:1-111:20 - Augusto Modanese, Yuichi Yoshida:
Testing Spreading Behavior in Networks with Arbitrary Topologies. 112:1-112:20 - Naoto Ohsaka:
Alphabet Reduction for Reconfiguration Problems. 113:1-113:17 - Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces. 114:1-114:19 - Orestis Plevrakis, Seyoon Ragavan, S. Matthew Weinberg:
On the Cut-Query Complexity of Approximating Max-Cut. 115:1-115:20 - Vladimir V. Podolskii, Dmitrii Sluch:
One-Way Communication Complexity of Partial XOR Functions. 116:1-116:16 - Aaron Potechin, Aaron Zhang:
Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle. 117:1-117:20 - Kent Quanrud:
Adaptive Sparsification for Matroid Intersection. 118:1-118:20 - Sushant Sachdeva, Anvith Thudi, Yibin Zhao:
Better Sparsifiers for Directed Eulerian Graphs. 119:1-119:20 - Yaniv Sadeh, Haim Kaplan:
Caching Connections in Matchings. 120:1-120:20 - Mohammad Saneian, Soheil Behnezhad:
Streaming Edge Coloring with Asymptotically Optimal Colors. 121:1-121:20 - Niklas Schlomberg:
An Improved Integrality Gap for Disjoint Cycles in Planar Graphs. 122:1-122:15 - Kingsley Yung:
Limits of Sequential Local Algorithms on the Random k-XORSAT Problem. 123:1-123:20 - Rohan Acharya, Marcin Jurdzinski, Aditya Prakash:
Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata. 124:1-124:18 - C. Aiswarya, Amaldev Manuel, Saina Sunny:
Edit Distance of Finite State Transducers. 125:1-125:20 - Pascal Baumann, Eren Keskin, Roland Meyer, Georg Zetzsche:
Separability in Büchi VASS and Singly Non-Linear Systems of Inequalities. 126:1-126:19 - Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan:
Decidability of Graph Neural Networks via Logical Characterizations. 127:1-127:20 - Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Automata-Theoretic Characterisations of Branching-Time Temporal Logics. 128:1-128:20 - Manon Blanc, Olivier Bournez:
The Complexity of Computing in Continuous Time: Space Complexity Is Precision. 129:1-129:22 - Mikolaj Bojanczyk, Lê Thành Dung Nguyên, Rafal Stefanski:
Function Spaces for Orbit-Finite Sets. 130:1-130:20 - Arnaud Carayol, Lucien Charamond:
The Structure of Trees in the Pushdown Hierarchy. 131:1-131:18 - Dmitry Chistikov, Alessio Mansutti, Mikhail R. Starchak:
Integer Linear-Exponential Programming in NP by Quantifier Elimination. 132:1-132:20 - Mohan Dantam, Richard Mayr:
Finite-Memory Strategies for Almost-Sure Energy-MeanPayoff Objectives in MDPs. 133:1-133:17 - Julian Dörfler, Christian Ikenmeyer:
Functional Closure Properties of Finite ℕ-Weighted Automata. 134:1-134:18 - Amina Doumane, Samuel Humeau, Damien Pous:
A Finite Presentation of Graphs of Treewidth at Most Three. 135:1-135:18 - Yuxi Fu, Qizhe Yang, Yangluo Zheng:
Improved Algorithm for Reachability in d-VASS. 136:1-136:18 - Jakub Gajarský, Rose McCarty:
On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification. 137:1-137:20 - Paul Gallot, Sebastian Maneth, Keisuke Nakano, Charles Peyrat:
Deciding Linear Height and Linear Size-To-Height Increase of Macro Tree Transducers. 138:1-138:20 - Raphael Douglas Giles, Vincent Jackson, Christine Rizkallah:
T-Rex: Termination of Recursive Functions Using Lexicographic Linear Combinations. 139:1-139:19 - Quentin Guilmant, Engel Lefaucheux, Joël Ouaknine, James Worrell:
The 2-Dimensional Constraint Loop Problem Is Decidable. 140:1-140:21 - Roland Guttenberg:
Flattability of Priority Vector Addition Systems. 141:1-141:20 - Christoph Haase, Shankara Narayanan Krishna, Khushraj Madnani, Om Swostik Mishra, Georg Zetzsche:
An Efficient Quantifier Elimination Procedure for Presburger Arithmetic. 142:1-142:17 - Hashimoto Go, Daniel Gaina, Ionut Tutu:
Forcing, Transition Algebras, and Calculi. 143:1-143:17 - Pavol Kebis, Florian Luca, Joël Ouaknine, Andrew Scoones, James Worrell:
On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words. 144:1-144:15 - George Kenison:
The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters. 145:1-145:20 - Alberto Larrauri, Stanislav Zivný:
Solving Promise Equations over Monoids and Groups. 146:1-146:18 - Bruno Loff, Mateusz Skomra:
Smoothed Analysis of Deterministic Discounted and Mean-Payoff Games. 147:1-147:16 - Antoine Mottet, Tomás Nagy, Michael Pinsker:
An Order out of Nowhere: A New Algorithm for Infinite-Domain {CSP}s. 148:1-148:18 - Wojciech Rozowski:
A Complete Quantitative Axiomatisation of Behavioural Distance of Regular Expressions. 149:1-149:20 - Jakub Rydval:
Homogeneity and Homogenizability: Hard Problems for the Logic SNP. 150:1-150:20 - Jakub Rydval, Zaneta Semanisinová, Michal Wrona:
Identifying Tractable Quantified Temporal Constraints Within Ord-Horn. 151:1-151:20 - Benjamin Scheidt:
On Homomorphism Indistinguishability and Hypertree Depth. 152:1-152:18 - Sylvain Schmitz, Lia Schütze:
On the Length of Strongly Monotone Descending Chains over ℕ^d. 153:1-153:19 - Guillaume Theyssier:
FO Logic on Cellular Automata Orbits Equals MSO Logic. 154:1-154:20 - Yuya Uezato:
Regular Expressions with Backreferences and Lookaheads Capture NLOG. 155:1-155:20 - Steffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Corto Mascle, Nicolas Waldburger, Chana Weil-Kennedy:
Verification of Population Protocols with Unordered Data. 156:1-156:20 - Cheng Zhang, Arthur Azevedo de Amorim, Marco Gaboardi:
Domain Reasoning in TopKAT. 157:1-157:18
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-11-08 20:18 CET 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:
