default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 65
Volume 65, Number 1, January 2021
- Pablo Barceló, Marco Calautti:
Special Issue on Database Theory. 1-2 - Stefan Mengel, Sebastian Skritek:
Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. 3-41 - Yuliang Li
, Jianguo Wang, Benjamin S. Pullman, Nuno Bandeira, Yannis Papakonstantinou:
Index-based, High-dimensional, Cosine Threshold Querying with Optimality Guarantees. 42-83 - Marco Calautti, Andreas Pieris:
Semi-Oblivious Chase Termination: The Sticky Case. 84-121 - Paraschos Koutris, Jef Wijsen:
Consistent Query Answering for Primary Keys in Datalog. 122-178 - Floris Geerts:
On the Expressive Power of Linear Algebra on Graphs. 179-239 - Floris Geerts:
Correction to: On the Expressive Power of Linear Algebra on Graphs. 240
Volume 65, Number 2, February 2021
- Olivier Carton, Joseph Vandehey:
Preservation of Normality by Non-Oblivious Group Selection. 241-256 - David Ilcinkas, Ahmed Mouhamadou Wade:
Exploration of Dynamic Cactuses with Sub-logarithmic Overhead. 257-273 - Beate Bollig, Martin Farenholtz:
On the Relation Between Structured d-DNNFs and SDDs. 274-295 - Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Fast Scheduling in Distributed Transactional Memory. 296-322 - Dekel Tsur:
Faster Parameterized Algorithm for Cluster Vertex Deletion. 323-343 - Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid:
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. 344-409 - Matea Celar, Zvonko Iljazovic:
Computability of Products of Chainable Continua. 410-427 - Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden:
Stable Divisorial Gonality is in NP. 428-440
Volume 65, Number 3, April 2021
- Moses Ganardi, Danny Hucke, Markus Lohrey:
Derandomization for Sliding Window Algorithms with Strict Correctness∗. 1-18 - René van Bevern, Gregory Kucherov:
Special Issue on Computer Science Symposium in Russia (2019). 441-443 - Sergey M. Dudakov, Boris Karlov:
On Decidability of Theories of Regular Languages. 462-478 - Elena A. Petrova, Arseny M. Shur:
Transition Property for Cube-Free Words. 479-496 - Bireswar Das, Shivdutt Sharma:
Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes. 497-514 - Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Parameterized Complexity of Conflict-Free Set Cover. 515-540 - Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Belga B-Trees. 541-558 - Eric Allender, Rahul Ilango, Neekon Vafa:
The Non-hardness of Approximating Circuit Size. 559-578 - Suthee Ruangwises, Toshiya Itoh:
Unpopularity Factor in the Marriage and Roommates Problems. 579-592 - Shmuel T. Klein, Shoham Saadia, Dana Shapira:
Forward Looking Huffman Coding. 593-612 - Ludmila Glinskih, Dmitry Itsykson:
On Tseitin Formulas, Read-Once Branching Programs and Treewidth. 613-633
Volume 65, Number 4, May 2021
- Rolf Niedermeier, Christophe Paul:
Preface of STACS 2019 Special Issue. 635-637 - Shaull Almagor, Joël Ouaknine, James Worrell:
First-Order Orbit Queries. 638-661 - Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. 662-686 - Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu:
Space Lower Bounds for the Signal Detection Problem. 687-705 - Antoine Mottet, Karin Quaas:
The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata. 706-735 - Erik Paul:
Finite Sequentiality of Unambiguous Max-Plus Tree Automata. 736-776
Volume 65, Number 5, July 2021
- Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici, Alice Héliou, Solon P. Pissis:
Constructing Antidictionaries of Long Texts in Output-Sensitive Space. 777-797 - Sounaka Mishra, B. Arjuna Krishna, Shijin Rajakrishnan:
Approximability of open k-monopoly problems. 798-814 - Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos:
Minimum Reload Cost Graph Factors. 815-838 - Emil Jerábek:
On the Complexity of the Clone Membership Problem. 839-868 - Xiao Zeng, Guowu Yang:
Computing the Number of Affine Equivalent Classes on ℛ(s, n)/ℛ(k, n). 869-883 - Astrid Pieterse, Gerhard J. Woeginger:
The subset sum game revisited. 884-900
Volume 65, Number 6, August 2021
- Evripidis Bampis, Nicole Megow:
Preface. 901-902 - Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder:
Approximation Results for Makespan Minimization with Budgeted Uncertainty. 903-915 - Graham Cormode, Pavel Veselý:
Streaming Algorithms for Bin Packing and Vector Scheduling. 916-942 - Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
Managing Multiple Mobile Resources. 943-984 - Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat:
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. 985-1008 - Fu-Hong Liu, Hsiang-Hsuan Liu, Prudence W. H. Wong:
Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs. 1009-1032
Volume 65, Number 7, October 2021
- Friedrich Otto:
On the Expressive Power of Stateless Ordered Restart-Delete Automata. 1033-1068 - Xiaohui Bei, Xinhang Lu, Pasin Manurangsi, Warut Suksompong:
The Price of Fairness for Indivisible Goods. 1069-1093 - Julian Nickerl:
The Minimum Tollbooth Problem in Atomic Network Congestion Games with Unsplittable Flows. 1094-1109 - Matthieu Rosenfeld:
Lower-Bounds on the Growth of Power-Free Languages Over Large Alphabets. 1110-1116 - Mikhail Selianinau:
Computationally Efficient Approach to Implementation of the Chinese Remainder Theorem Algorithm in Minimally Redundant Residue Number System. 1117-1140 - Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity. 1141-1142
Volume 65, Number 8, November 2021
- Jan-Hendrik Lorenz:
Restart Strategies in a Continuous Setting. 1143-1164 - Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
On Triangle Estimation Using Tripartite Independent Set Queries. 1165-1192 - Michal Parnas, Dana Ron, Adi Shraibman:
Property Testing of the Boolean and Binary Rank. 1193-1210 - Chris Köcher:
Reachability Problems on Reliable and Lossy Queue Automata. 1211-1242 - Junjie Luo, Hendrik Molter, Ondrej Suchý:
A Parameterized Complexity View on Collapsing k-Cores. 1243-1282
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 2025-11-13 00:06 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:
