default search action
Theory of Computing Systems, Volume 67
Volume 67, Number 1, February 2023
- Christophe Paul, Markus Bläser:
Preface of STACS 2020 Special Issue. 1-3 - Dietmar Berwanger
, Laurent Doyen:
Observation and Distinction: Representing Information in Infinite Games. 4-27 - Thomas Bläsius
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. 28-51 - Hans L. Bodlaender
Typical Sequences Revisited - Computing Width Parameters of Graphs. 52-88 - Andrés Cristi
Fixed-Parameter Algorithms for Unsplittable Flow Cover. 89-124 - Jarkko Kari
Decidability and Periodicity of Low Complexity Tilings. 125-148 - Nikhil Vyas
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms. 149-177 - Jan Philipp Wächter
An Automaton Group with PSPACE-Complete Word Problem. 178-218
Volume 67, Number 2, April 2023
- Henning Fernau, Mikhail V. Volkov
Preface of the Special Issue Dedicated to Selected Papers from CSR 2020. 219-220 - Abhishek Sahu, Saket Saurabh:
Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs. 221-233 - Ilya Olkhovsky
On the Transformation of LL(k)-linear to LL(1)-linear Grammars. 234-262 - Ilya Olkhovsky
Correction to: On the Transformation of LL(k)-linear to LL(1)-linear Grammars. 263 - Onur Çagirici:
On Embeddability of Unit Disk Graphs Onto Straight Lines. 264-289 - Yaokun Wu, Yinfeng Zhu:
Correction to: Submodular Functions and Rooted Trees. 290
- Peter Kostolányi
Polynomially Ambiguous Unary Weighted Automata over Fields. 291-309 - Frank Gurski
Characterizations and Directed Path-Width of Sequence Digraphs. 310-347 - Yefim Dinitz, Shlomi Dolev, Manish Kumar
Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs. 348-382 - Soumik Ghosh, John Watrous:
Complexity Limitations on One-turn Quantum Refereed Games. 383-412
Volume 67, Number 3, June 2023
- In Memoriam - Alan Selman (1941 - 2021). 413-414
- Elvira Mayordomo, Mitsunori Ogihara
Foreword: a Commemorative Issue for Alan L. Selman. 415-416 - Zhiguo Fu
Holographic Algorithms on Domains of General Size. 417-436 - Siddharth Bhaskar
Subclasses of Ptime Interpreted by Programming Languages. 437-472 - Jack H. Lutz, Neil Lutz
Dimension and the Structure of Complexity Classes. 473-490 - Satyadev Nandakumar, Subin Pulari
Ergodic Theorems and Converses for PSPACE Functions. 491-520 - Daniel Apon, William Gasarch
The Complexity of Grid Coloring. 521-547 - András Z. Salamon
Effective Guessing Has Unlikely Consequences. 548-568 - Mitsunori Ogiwara
Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions. 569-591 - Atri Rudra:
Arithmetic Circuits, Structured Matrices and (not so) Deep Learning. 592-626 - Joshua A. Grochow
Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality. 627-669
Volume 67, Number 4, August 2023
- Christian Glazik, Jan Schiemann, Anand Srivastav:
A One Pass Streaming Algorithm for Finding Euler Tours. 671-693 - Philip Bille
Random Access in Persistent Strings and Segment Selection. 694-713 - Kaoru Fujioka:
On the Hierarchy of Swarm-automaton for the Number of Agents. 714-731 - Pyry Herva
On Forced Periodicity of Perfect Colorings. 732-759 - Rustem Takhanov:
Computing a Partition Function of a Generalized Pattern-Based Energy over a Semiring. 760-784 - Sayan Bandyapadhyay, Fedor V. Fomin
Lossy Kernelization of Same-Size Clustering. 785-824 - Dariusz R. Kowalski, Miguel A. Mosteiro
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model. 825-854 - Yiannis Giannakopoulos
A Unifying Approximate Potential for Weighted Congestion Games. 855-876 - K. Subramani
Unit Read-once Refutations for Systems of Difference Constraints. 877-899
Volume 67, Number 5, October 2023
- Rodolfo Conde
The Solvability of Consensus in Iterated Models Extended with Safe-Consensus. 901-955 - Jozef Jirásek, Ian McQuillan:
Visit-Bounded Stack Automata. 956-975 - Jarkko Kari:
Expansivity and Periodicity in Algebraic Subshifts. 976-994 - Boaz Patt-Shamir
Non-Linear Ski Rental. 995-1025 - Henning Fernau
The Space Complexity of Sum Labelling. 1026-1049 - Jaroslav Garvardt
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. 1050-1081 - David Furcy, Scott M. Summers, Logan Withers:
Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D. 1082-1130 - Dariusz R. Kowalski, Miguel A. Mosteiro
Correction to: Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model. 1131
Volume 67, Number 6, December 2023
- Andreas Darmann:
Stability and Welfare in (Dichotomous) Hedonic Diversity Games. 1133-1155 - Vladan Gloncak, Jarl Emil Erla Munkstrup, Jakob Grue Simonsen
Implicit Representation of Relations. 1156-1196 - Vadim E. Levit
Well-Covered Graphs With Constraints On Δ And δ. 1197-1208 - Léo Gayral, Mathieu Sablik:
Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings. 1209-1240 - Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. 1241-1267 - Abdolhamid Ghodselahi, Fabian Kuhn:
Toward Online Mobile Facility Location on General Metrics. 1268-1306 - David E. Brown, David Skidmore
Representing the Integer Factorization Problem Using Ordered Binary Decision Diagrams. 1307-1332
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-12-11 20:49 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: