![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Theory of Computing Systems, Volume 68
Volume 68, Number 1, February 2024
- Andreas Maletti, Andreea-Teodora Nász:
Weighted Tree Automata with Constraints. 1-28 - Qisheng Wang
, Mingsheng Ying
:
Quantum Algorithm for Lexicographically Minimal String Rotation. 29-74 - Frank Gurski, Jörg Rothe, Robin Weishaupt:
Stability, Vertex Stability, and Unfrozenness for Special Graph Classes. 75-102 - Vincent Froese, Pascal Kunz, Philipp Zschoche:
Disentangling the Computational Complexity of Network Untangling. 103-121 - Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr Wojciechowski:
On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective. 122-143 - Pierre Bergé, Guillaume Ducoffe, Michel Habib:
Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs. 144-193
Volume 68, Number 2, April 2024
- Marcus Schaefer, Daniel Stefankovic:
Beyond the Existential Theory of the Reals. 195-226 - K. Subramani, Piotr Wojciechowki, Alvaro Velasquez:
Farkas Bounds on Horn Constraint Systems. 227-249 - Hoàng-Oanh Le, Van Bang Le:
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs. 250-270 - Marat Kh. Faizrahmanov
:
On Non-principal Arithmetical Numberings and Families. 271-282 - Yijie Chen
, Kewei Lv
:
New Results on the Remote Set Problem and Its Applications in Complexity Study. 283-298
Volume 68, Number 3, June 2024
- Volker Diekert
, Mikhail Volkov
:
Preface of the Special Issue Dedicated to Selected Papers from DLT 2022. 299-300 - Hyunjoon Cheon, Joonghyuk Hahn, Yo-Sub Han:
On the Decidability of Infix Inclusion Problem. 301-321 - Joel D. Day, Vijay Ganesh, Nathan Grewal, Matthew Konefal, Florin Manea:
A Closer Look at the Expressive Power of Logics Based on Word Equations. 322-379 - Ondrej Klíma, Jonatan Kolegar:
Characterization of Ordered Semigroups Generating Well Quasi-Orders of Words. 380-402 - Markus Lohrey, Florian Stober, Armin Weiß:
The Power Word Problem in Graph Products. 403-464 - Giovanni Pighizzini, Luca Prigioniero, Simon Sádovský:
Performing Regular Operations with 1-Limited Automata. 465-486 - Ekaterina N. Shemetova
, Alexander Okhotin
, Semyon V. Grigorev
:
Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees. 487-511
- Pankaj Kumar Das, Subodh Kumar:
Linear Codes Correcting Repeated Bursts Equipped with Homogeneous Distance. 512-528 - Cornelis A. Middelburg
:
Imperative Process Algebra and Models of Parallel Computation. 529-570 - Lehilton L. C. Pedrosa
, Mauro R. C. da Silva
, Rafael C. S. Schouery
:
Approximation Algorithms for the MAXSPACE Advertisement Problem. 571-590
Volume 68, Number 4, August 2024
- Anuj Dawar:
International Colloquium on Automata, Languages and Programming (ICALP 2020). 591-592 - Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues:
On Polynomial Recursive Sequences. 593-614 - Erik Paul:
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata. 615-661 - Joel D. Day, Florin Manea:
On the structure of solution-sets to regular word equations. 662-739 - Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß:
Equation Satisfiability in Solvable Groups. 740-757 - Aaron Bernstein:
Improved Bounds for Matching in Random-Order Streams. 758-772 - Uriel Feige, Vadim Grinberg:
How to Hide a Clique? 773-813 - Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Minimum Cut in O(mlog 2 n) Time. 814-834
- Markus Bläser, Benjamin Monmege:
Preface of STACS 2021 Special Issue. 835-837 - Silvia Butti, Víctor Dalmau:
The Complexity of the Distributed Constraint Satisfaction Problem. 838-867 - Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida:
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP. 868-899 - Stefan Göller, Mathieu Hilaire:
Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete. 900-985 - Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Digraph Coloring and Distance to Acyclicity. 986-1013 - Jacob Holm, Eva Rotenberg:
Good r-divisions Imply Optimal Amortized Decremental Biconnectivity. 1014-1048 - Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov:
b-Coloring Parameterized by Clique-Width. 1049-1081 - Markus Lohrey:
Subgroup Membership in GL(2,Z). 1082-1107
![](https://dblp.org/img/cog.dark.24x24.png)
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.