| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith |
Removable Online Knapsack and Advice.  |
STACS  |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | James C. A. Main |
Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Geoffroy Caillat-Grenier, Andrei E. Romashchenko |
Spectral Approach to the Communication Complexity of Multi-Party Key Agreement. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Bienkowski, Stefan Schmid 0001 |
A Subquadratic Bound for Online Bisection. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei Draghici, Christoph Haase, Florin Manea |
Semënov Arithmetic, Affine {VASS}, and String Constraints. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Kawalek, Michael Kompatscher, Jacek Krzaczkowski |
Circuit Equivalence in 2-Nilpotent Algebras. |
STACS |
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. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Ying Liu, Shiteng Chen |
Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular Graphs. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Ildikó Schlotter |
Shortest Two Disjoint Paths in Conservative Graphs. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Bienkowski, Guy Even |
An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement. |
STACS |
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. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakub Balabán, Robert Ganian, Mathis Rocton |
Computing Twin-Width Parameterized by the Feedback Edge Number. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Luc Côté, Ankita Sarkar |
Fault-tolerant k-Supplier with Outliers. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Max Bannach, Florian Andreas Marwitz, Till Tantau |
Faster Graph Algorithms Through DAG Compression. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | C. Aiswarya, Soumodev Mal, Prakash Saivasan |
Satisfiability of Context-Free String Constraints with Subword-Ordering and Transducers. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Omkar Baraskar, Agrim Dewan, Chandan Saha 0001 |
Testing Equivalence to Design Polynomials. |
STACS |
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. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Julian D'Costa, Joël Ouaknine, James Worrell 0001 |
Nonnegativity Problems for Matrix Semigroups. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Lanzinger, Igor Razgon |
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Katarzyna Anna Kowalska, Michal Pilipczuk |
Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor C. Oliveira |
Polynomial-Time Pseudodeterministic Constructions (Invited Talk). |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Bessy, Stéphan Thomassé, Laurent Viennot |
Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Szymon Torunczyk |
Structurally Tractable Graph Classes (Invited Talk). |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Swagato Sanyal |
Randomized Query Composition and Product Distributions. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Nathan Grosshans |
The AC⁰-Complexity of Visibly Pushdown Languages. |
STACS |
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. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan 0001, Peter Strulo |
Decremental Sensitivity Oracles for Covering and Packing Minors. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke |
The Complexity of Homomorphism Reconstructibility. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Hoefer 0001, Carmine Ventre, Lisa Wilhelmi |
Algorithms for Claims Trading. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf |
On the Exact Matching Problem in Dense Graphs. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov |
Fixed-Parameter Debordering of Waring Rank. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Hitarth, George Kenison, Laura Kovács, Anton Varonka |
Linear Loop Synthesis for Quadratic Invariants. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Franziska Eberle |
O(1/ε) Is the Answer in Online Weighted Throughput Maximization. |
STACS |
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. |
STACS |
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. |
STACS |
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. |
STACS |
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. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Neuen |
Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Ohlmann, Michal Skrzypczak |
Positionality in Σ⁰₂ and a Completeness Result. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Jack Dippel, Adrian Vetta |
One n Remains to Settle the Tree Conjecture. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Emre Yolcu |
Lower Bounds for Set-Blocked Clauses Proofs. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Paul, Evangelos Protopapas |
Tree-Layout Based Graph Classes: Proper Chordal Graphs. |
STACS |
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. |
STACS |
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 |
STACS |
2024 |
DBLP BibTeX RDF |
|
| 1 | Andreas Maletti, Andreea-Teodora Nász, Erik Paul |
Weighted HOM-Problem for Nonnegative Integers. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye |
Quantum and Classical Communication Complexity of Permutation-Invariant Functions. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofya Raskhodnikova |
The Role of Local Algorithms in Privacy (Invited Talk). |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Ganardi, Irmak Saglam, Georg Zetzsche |
Directed Regular and Context-Free Languages. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolás Bitar |
Contributions to the Domino Problem: Seeding, Recurrence and Satisfiability. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | David G. Harris 0001, N. S. Narayanaswamy |
A Faster Algorithm for Vertex Cover Parameterized by Solution Size. |
STACS |
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. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Janosch Fuchs, Philip Whittington |
The 2-Attractor Problem Is NP-Complete. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Haitao Wang 0001 |
Algorithms for Computing Closest Points for Segments. |
STACS |
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. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Tameem Choudhury, Karteek Sreenivasaiah |
Depth-3 Circuit Lower Bounds for k-OV. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Kompatscher |
The Subpower Membership Problem of 2-Nilpotent Algebras. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Gehnen, Henri Lotze, Peter Rossmanith |
Online Simple Knapsack with Bounded Predictions. |
STACS |
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. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Cotumaccio |
A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Berkholz, Stefan Mengel, Hermann Wilhelm |
A Characterization of Efficiently Compilable Constraint Languages. |
STACS |
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. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Shengyu Huang, Chih-Hung Liu 0001, Daniel Rutschmann |
Approximate Selection with Unreliable Comparisons in Optimal Expected Time. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomohiro Koana |
Induced Matching Below Guarantees: Average Paves the Way for Fixed-Parameter Tractability. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Florent Capelli, Yann Strozecki |
Geometric Amortization of Enumeration Algorithms. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Balagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia |
Finding and Counting Patterns in Sparse Graphs. |
STACS |
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. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Zdenek Dvorák 0001 |
Representation of Short Distances in Structurally Sparse Graphs. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Gwénaël Richomme, Matthieu Rosenfeld |
Reconstructing Words Using Queries on Subwords or Factors. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruiwen Dong 0001 |
Solving Homogeneous Linear Equations over Polynomial Semirings. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud |
One Drop of Non-Determinism in a Random Deterministic Automaton. |
STACS |
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. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitrios Los, Thomas Sauerwald |
Tight Bounds for Repeated Balls-Into-Bins. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Y. Vardi |
Logical Algorithmics: From Theory to Practice (Invited Talk). |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Narek Bojikian, Vera Chekan, Falko Hegerfeld, Stefan Kratsch |
Tight Bounds for Connectivity Problems Parameterized by Cutwidth. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty |
Non-Adaptive Proper Learning Polynomials. |
STACS |
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. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Konrad 0001, Kheeran K. Naidu, Arun Steward |
Maximum Matching via Maximal Matching Queries. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Majewski, Michal Pilipczuk, Marek Sokolowski 0001 |
Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dror Chawin, Ishay Haviv |
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Satyadev Nandakumar, Subin Pulari |
Real Numbers Equally Compressible in Every Base. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Baumann 0001, Roland Meyer 0001, Georg Zetzsche |
Regular Separability in Büchi VASS. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Philipp Zschoche |
Restless Temporal Path Parameterized Above Lower Bounds. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Leszek Gasieniec, Paul G. Spirakis, Grzegorz Stachowiak |
New Clocks, Optimal Line Formation and Self-Replication Population Protocols. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Karoliina Lehtinen |
A Brief History of History-Determinism (Invited Talk). |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | James D. Watson, Johannes Bausch, Sevag Gharibian |
The Complexity of Translationally Invariant Problems Beyond Ground State Energies. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Haohong Li, Ge Xia |
An k) Time FPT Algorithm for Convex Flip Distance. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Hendrik Mayer, Devansh Shringi |
On the Multilinear Complexity of Associative Algebras. |
STACS |
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. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Augusto Modanese |
Sublinear-Time Probabilistic Cellular Automata. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jessica A. Enright, Kitty Meeks, Hendrik Molter |
Counting Temporal Paths. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann, Daniel Stephan |
Strongly Hyperbolic Unit Disk Graphs. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Eva Rotenberg |
Amortised Analysis of Dynamic Data Structures (Invited Talk). |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Reijo Jaakkola, Antti Kuusisto, Miikka Vilander |
Relating Description Complexity to Entropy. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Suryajith Chillara, Coral Grichener, Amir Shpilka |
On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Heeger, André Nichterlein, Rolf Niedermeier |
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Antoine Amarilli, Mikaël Monet |
Enumerating Regular Languages with Bounded Delay. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentin Gledel, Nacim Oijid |
Avoidance Games Are PSPACE-Complete. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaniv Sadeh, Haim Kaplan |
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license