default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID40th STACS 2023: Hamburg, Germany
- Petra Berenbrink, Patricia Bouyer, Anuj Dawar, Mamadou Moustapha Kanté:
40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, Hamburg, Germany, March 7-9, 2023. LIPIcs 254, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-266-2 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:22
- Karoliina Lehtinen:
A Brief History of History-Determinism (Invited Talk). 1:1-1:2 - Eva Rotenberg
:
Amortised Analysis of Dynamic Data Structures (Invited Talk). 2:1-2:2 - Moshe Y. Vardi:
Logical Algorithmics: From Theory to Practice (Invited Talk). 3:1-3:1 - Erhard Aichinger, Simon Grünbacher:
The Complexity of Checking Quasi-Identities over Finite Algebras with a Mal'cev Term. 4:1-4:12 - Maxim Akhmedov, Maxim A. Babenko:
Packing Odd Walks and Trails in Multiterminal Networks. 5:1-5:19 - Cezar-Mihail Alexandru, Pavel Dvorák, Christian Konrad, Kheeran K. Naidu:
Improved Weighted Matching in the Sliding Window Model. 6:1-6:21 - Georgios Amanatidis, Pieter Kleer:
Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals. 7:1-7:23 - Antoine Amarilli, Mikaël Monet:
Enumerating Regular Languages with Bounded Delay. 8:1-8:18 - Pascal Baumann, Roland Meyer, Georg Zetzsche:
Regular Separability in Büchi VASS. 9:1-9:19 - Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant:
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. 10:1-10:15 - Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof:
Tight Lower Bounds for Problems Parameterized by Rank-Width. 11:1-11:17 - Markus Bläser, Hendrik Mayer, Devansh Shringi:
On the Multilinear Complexity of Associative Algebras. 12:1-12:18 - Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan:
Strongly Hyperbolic Unit Disk Graphs. 13:1-13:17 - Narek Bojikian, Vera Chekan, Falko Hegerfeld, Stefan Kratsch:
Tight Bounds for Connectivity Problems Parameterized by Cutwidth. 14:1-14:16 - Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé:
Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication. 15:1-15:16 - Nader H. Bshouty:
Non-Adaptive Proper Learning Polynomials. 16:1-16:20 - Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
Cut Paths and Their Remainder Structure, with Applications. 17:1-17:17 - Florent Capelli, Yann Strozecki:
Geometric Amortization of Enumeration Algorithms. 18:1-18:22 - Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud:
One Drop of Non-Determinism in a Random Deterministic Automaton. 19:1-19:14 - Dror Chawin, Ishay Haviv:
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank. 20:1-20:14 - Sravanthi Chede, Anil Shukla:
Extending Merge Resolution to a Family of QBF-Proof Systems. 21:1-21:20 - Suryajith Chillara, Coral Grichener, Amir Shpilka:
On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts. 22:1-22:20 - Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young:
Online Paging with Heterogeneous Cache Slots. 23:1-23:24 - Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk:
On Rational Recursive Sequences. 24:1-24:21 - Ruiwen Dong:
Semigroup Intersection Problems in the Heisenberg Groups. 25:1-25:18 - Ruiwen Dong:
Solving Homogeneous Linear Equations over Polynomial Semirings. 26:1-26:19 - Marc Dufay, Claire Mathieu, Hang Zhou:
An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees. 27:1-27:16 - Zdenek Dvorák:
Representation of Short Distances in Structurally Sparse Graphs. 28:1-28:22 - Nicolas El Maalouly:
Exact Matching: Algorithms and Related Problems. 29:1-29:17 - Jessica A. Enright, Kitty Meeks, Hendrik Molter:
Counting Temporal Paths. 30:1-30:19 - Ora Nova Fandina, Mikael Møller Høgsgaard, Kasper Green Larsen:
Barriers for Faster Dimensionality Reduction. 31:1-31:15 - Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter:
A Regular and Complete Notion of Delay for Streaming String Transducers. 32:1-32:16 - Leszek Gasieniec, Paul G. Spirakis, Grzegorz Stachowiak:
New Clocks, Optimal Line Formation and Self-Replication Population Protocols. 33:1-33:22 - Valentin Gledel, Nacim Oijid:
Avoidance Games Are PSPACE-Complete. 34:1-34:19 - Klaus Heeger, André Nichterlein, Rolf Niedermeier:
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. 35:1-35:19 - Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid:
Dynamic Maintenance of Monotone Dynamic Programs and Applications. 36:1-36:16 - Shengyu Huang, Chih-Hung Liu, Daniel Rutschmann:
Approximate Selection with Unreliable Comparisons in Optimal Expected Time. 37:1-37:23 - Reijo Jaakkola, Antti Kuusisto, Miikka Vilander:
Relating Description Complexity to Entropy. 38:1-38:18 - Tomohiro Koana:
Induced Matching Below Guarantees: Average Paves the Way for Fixed-Parameter Tractability. 39:1-39:21 - Balagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia:
Finding and Counting Patterns in Sparse Graphs. 40:1-40:20 - Christian Konrad, Kheeran K. Naidu, Arun Steward:
Maximum Matching via Maximal Matching Queries. 41:1-41:22 - François Le Gall, Masayuki Miyamoto, Harumichi Nishimura:
Distributed Quantum Interactive Proofs. 42:1-42:21 - Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan:
Reconfiguration of Digraph Homomorphisms. 43:1-43:21 - Haohong Li, Ge Xia:
An 𝒪(3.82k) Time FPT Algorithm for Convex Flip Distance. 44:1-44:14 - Dimitrios Los, Thomas Sauerwald:
Tight Bounds for Repeated Balls-Into-Bins. 45:1-45:22 - Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number. 46:1-46:13 - Augusto Modanese:
Sublinear-Time Probabilistic Cellular Automata. 47:1-47:22 - Satyadev Nandakumar, Subin Pulari:
Real Numbers Equally Compressible in Every Base. 48:1-48:20 - Naoto Ohsaka:
Gap Preserving Reductions Between Reconfiguration Problems. 49:1-49:18 - Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz:
Dynamic Data Structures for Parameterized String Problems. 50:1-50:22 - Charles Paperman, Sylvain Salvati, Claire Soyez-Martin:
An Algebraic Approach to Vectorial Programs. 51:1-51:23 - Gwénaël Richomme, Matthieu Rosenfeld:
Reconstructing Words Using Queries on Subwords or Factors. 52:1-52:15 - Yaniv Sadeh, Haim Kaplan:
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. 53:1-53:21 - James D. Watson, Johannes Bausch, Sevag Gharibian:
The Complexity of Translationally Invariant Problems Beyond Ground State Energies. 54:1-54:21 - Philipp Zschoche:
Restless Temporal Path Parameterized Above Lower Bounds. 55:1-55:16
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 2026-08-09 22:58 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
