Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith |
Removable Online Knapsack and Advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 18:1-18:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | James C. A. Main |
Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 50:1-50:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Geoffroy Caillat-Grenier, Andrei E. Romashchenko |
Spectral Approach to the Communication Complexity of Multi-Party Key Agreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 22:1-22:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Marcin Bienkowski, Stefan Schmid 0001 |
A Subquadratic Bound for Online Bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 14:1-14:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Andrei Draghici, Christoph Haase, Florin Manea |
Semënov Arithmetic, Affine {VASS}, and String Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 29:1-29:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Piotr Kawalek, Michael Kompatscher, Jacek Krzaczkowski |
Circuit Equivalence in 2-Nilpotent Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 45:1-45:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Jesper Jansson 0001, Wing-Kin Sung, Seyed Ali Tabatabaee, Yutong Yang |
A Faster Algorithm for Constructing the Frequency Difference Consensus Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 43:1-43:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Ying Liu, Shiteng Chen |
Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 49:1-49:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Ildikó Schlotter |
Shortest Two Disjoint Paths in Conservative Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 57:1-57:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Marcin Bienkowski, Guy Even |
An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 15:1-15:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski |
Max Weight Independent Set in Sparse Graphs with No Long Claws. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 4:1-4:15, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Jakub Balabán, Robert Ganian, Mathis Rocton |
Computing Twin-Width Parameterized by the Feedback Edge Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 7:1-7:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Deeparnab Chakrabarty, Luc Côté, Ankita Sarkar |
Fault-tolerant k-Supplier with Outliers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 23:1-23:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Max Bannach, Florian Andreas Marwitz, Till Tantau |
Faster Graph Algorithms Through DAG Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 8:1-8:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | C. Aiswarya, Soumodev Mal, Prakash Saivasan |
Satisfiability of Context-Free String Constraints with Subword-Ordering and Transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 5:1-5:20, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Omkar Baraskar, Agrim Dewan, Chandan Saha 0001 |
Testing Equivalence to Design Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 9:1-9:22, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun |
Local Certification of Local Properties: Tight Bounds, Trade-Offs and New Parameters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 21:1-21:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Julian D'Costa, Joël Ouaknine, James Worrell 0001 |
Nonnegativity Problems for Matrix Semigroups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 27:1-27:16, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Matthias Lanzinger, Igor Razgon |
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 48:1-48:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Katarzyna Anna Kowalska, Michal Pilipczuk |
Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 47:1-47:16, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Igor C. Oliveira |
Polynomial-Time Pseudodeterministic Constructions (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 1:1-1:1, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Stéphane Bessy, Stéphan Thomassé, Laurent Viennot |
Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 13:1-13:12, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Szymon Torunczyk |
Structurally Tractable Graph Classes (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 3:1-3:1, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Swagato Sanyal |
Randomized Query Composition and Product Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 56:1-56:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Göller, Nathan Grosshans |
The AC⁰-Complexity of Visibly Pushdown Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 38:1-38:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Bodo Manthey, Jesse van Rhijn |
Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 52:1-52:16, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan 0001, Peter Strulo |
Decremental Sensitivity Oracles for Covering and Packing Minors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 44:1-44:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke |
The Complexity of Homomorphism Reconstructibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 19:1-19:20, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Martin Hoefer 0001, Carmine Ventre, Lisa Wilhelmi |
Algorithms for Claims Trading. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 42:1-42:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf |
On the Exact Matching Problem in Dense Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 33:1-33:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov |
Fixed-Parameter Debordering of Waring Rank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 30:1-30:15, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | S. Hitarth, George Kenison, Laura Kovács, Anton Varonka |
Linear Loop Synthesis for Quadratic Invariants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 41:1-41:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Franziska Eberle |
O(1/ε) Is the Answer in Online Weighted Throughput Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 32:1-32:15, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Christoph Berkholz, Dietrich Kuske, Christian Schwarz |
Modal Logic Is More Succinct Iff Bi-Implication Is Available in Some Form. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 12:1-12:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner |
Gapped String Indexing in Subquadratic Space and Sublinear Query Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 16:1-16:21, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Harsh Beohar, Sebastian Gurke, Barbara König 0001, Karla Messing, Jonas Forster, Lutz Schröder, Paul Wild |
Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 10:1-10:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Pranjal Dutta, Christian Ikenmeyer, Balagopal Komarath, Harshil Mittal, Saraswati Girish Nanoti, Dhara Thakkar |
On the Power of Border Width-2 ABPs over Fields of Characteristic 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 31:1-31:16, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Neuen |
Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 53:1-53:12, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Pierre Ohlmann, Michal Skrzypczak |
Positionality in Σ⁰₂ and a Completeness Result. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 54:1-54:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Jack Dippel, Adrian Vetta |
One n Remains to Settle the Tree Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 28:1-28:16, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 0:1-0:20, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Emre Yolcu |
Lower Bounds for Set-Blocked Clauses Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 59:1-59:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Christophe Paul, Evangelos Protopapas |
Tree-Layout Based Graph Classes: Proper Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 55:1-55:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Olivier Bournez, Riccardo Gozzi |
Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 20:1-20:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov (eds.) |
41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9 The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
1 | Andreas Maletti, Andreea-Teodora Nász, Erik Paul |
Weighted HOM-Problem for Nonnegative Integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 51:1-51:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye |
Quantum and Classical Communication Complexity of Permutation-Invariant Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 39:1-39:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Sofya Raskhodnikova |
The Role of Local Algorithms in Privacy (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 2:1-2:1, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Moses Ganardi, Irmak Saglam, Georg Zetzsche |
Directed Regular and Context-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 36:1-36:20, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Nicolás Bitar |
Contributions to the Domino Problem: Seeding, Recurrence and Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 17:1-17:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | David G. Harris 0001, N. S. Narayanaswamy |
A Faster Algorithm for Vertex Cover Parameterized by Solution Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 40:1-40:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
Approximate Circular Pattern Matching Under Edit Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 24:1-24:22, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Janosch Fuchs, Philip Whittington |
The 2-Attractor Problem Is NP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 35:1-35:13, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Haitao Wang 0001 |
Algorithms for Computing Closest Points for Segments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 58:1-58:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner 0001 |
Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 34:1-34:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Tameem Choudhury, Karteek Sreenivasaiah |
Depth-3 Circuit Lower Bounds for k-OV. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 25:1-25:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Michael Kompatscher |
The Subpower Membership Problem of 2-Nilpotent Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 46:1-46:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Matthias Gehnen, Henri Lotze, Peter Rossmanith |
Online Simple Knapsack with Bounded Predictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 37:1-37:20, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky 0001 |
On a Hierarchy of Spectral Invariants for Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 6:1-6:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Nicola Cotumaccio |
A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 26:1-26:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Christoph Berkholz, Stefan Mengel, Hermann Wilhelm |
A Characterization of Efficiently Compilable Constraint Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 11:1-11:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Cezar-Mihail Alexandru, Pavel Dvorák, Christian Konrad 0001, Kheeran K. Naidu |
Improved Weighted Matching in the Sliding Window Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 6:1-6:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Shengyu Huang, Chih-Hung Liu 0001, Daniel Rutschmann |
Approximate Selection with Unreliable Comparisons in Optimal Expected Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 37:1-37:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 0:1-0:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tomohiro Koana |
Induced Matching Below Guarantees: Average Paves the Way for Fixed-Parameter Tractability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 39:1-39:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Florent Capelli, Yann Strozecki |
Geometric Amortization of Enumeration Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 18:1-18:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Balagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia |
Finding and Counting Patterns in Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 40:1-40:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter |
A Regular and Complete Notion of Delay for Streaming String Transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 32:1-32:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Zdenek Dvorák 0001 |
Representation of Short Distances in Structurally Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 28:1-28:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Gwénaël Richomme, Matthieu Rosenfeld |
Reconstructing Words Using Queries on Subwords or Factors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 52:1-52:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ruiwen Dong 0001 |
Solving Homogeneous Linear Equations over Polynomial Semirings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 26:1-26:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud |
One Drop of Non-Determinism in a Random Deterministic Automaton. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 19:1-19:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Massimo Cairo, Shahbaz Khan 0004, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli |
Cut Paths and Their Remainder Structure, with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 17:1-17:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Dimitrios Los, Thomas Sauerwald |
Tight Bounds for Repeated Balls-Into-Bins. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 45:1-45:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Moshe Y. Vardi |
Logical Algorithmics: From Theory to Practice (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 3:1-3:1, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Narek Bojikian, Vera Chekan, Falko Hegerfeld, Stefan Kratsch |
Tight Bounds for Connectivity Problems Parameterized by Cutwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 14:1-14:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Nader H. Bshouty |
Non-Adaptive Proper Learning Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 16:1-16:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant |
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 10:1-10:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Christian Konrad 0001, Kheeran K. Naidu, Arun Steward |
Maximum Matching via Maximal Matching Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 41:1-41:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Konrad Majewski, Michal Pilipczuk, Marek Sokolowski 0001 |
Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 46:1-46:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Dror Chawin, Ishay Haviv |
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 20:1-20:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Satyadev Nandakumar, Subin Pulari |
Real Numbers Equally Compressible in Every Base. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 48:1-48:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Pascal Baumann 0001, Roland Meyer 0001, Georg Zetzsche |
Regular Separability in Büchi VASS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 9:1-9:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Philipp Zschoche |
Restless Temporal Path Parameterized Above Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 55:1-55:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Leszek Gasieniec, Paul G. Spirakis, Grzegorz Stachowiak |
New Clocks, Optimal Line Formation and Self-Replication Population Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 33:1-33:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Karoliina Lehtinen |
A Brief History of History-Determinism (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 1:1-1:2, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | James D. Watson, Johannes Bausch, Sevag Gharibian |
The Complexity of Translationally Invariant Problems Beyond Ground State Energies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 54:1-54:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Haohong Li, Ge Xia |
An k) Time FPT Algorithm for Convex Flip Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 44:1-44:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Markus Bläser, Hendrik Mayer, Devansh Shringi |
On the Multilinear Complexity of Associative Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 12:1-12:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Erhard Aichinger, Simon Grünbacher |
The Complexity of Checking Quasi-Identities over Finite Algebras with a Mal'cev Term. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 4:1-4:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Augusto Modanese |
Sublinear-Time Probabilistic Cellular Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 47:1-47:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jessica A. Enright, Kitty Meeks, Hendrik Molter |
Counting Temporal Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 30:1-30:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann, Daniel Stephan |
Strongly Hyperbolic Unit Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 13:1-13:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Eva Rotenberg |
Amortised Analysis of Dynamic Data Structures (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 2:1-2:2, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Reijo Jaakkola, Antti Kuusisto, Miikka Vilander |
Relating Description Complexity to Entropy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 38:1-38:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Suryajith Chillara, Coral Grichener, Amir Shpilka |
On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 22:1-22:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Klaus Heeger, André Nichterlein, Rolf Niedermeier |
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 35:1-35:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Antoine Amarilli, Mikaël Monet |
Enumerating Regular Languages with Bounded Delay. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 8:1-8:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Valentin Gledel, Nacim Oijid |
Avoidance Games Are PSPACE-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 34:1-34:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yaniv Sadeh, Haim Kaplan |
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany., pp. 53:1-53:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-266-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|