default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory 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 Wojciechowski, 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 Roberto Costa 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
Volume 68, Number 5, October 2024
- Anna Gál, Ridwan Syed:
Upper Bounds on Communication in Terms of Approximate Rank. 1109-1123 - Alexey Milovanov:
Prediction and MDL for infinite sequences. 1124-1137 - Aris Filos-Ratsikas, Alexandros A. Voudouris:
Revisiting the Distortion of Distributed Voting. 1138-1159 - Sabrina C. L. Ammann, Sebastian Stiller:
Near-Optimal Auctions on Independence Systems. 1160-1179 - Ioannis Caragiannis, Nidhi Rathi:
Optimizing Over Serial Dictatorships. 1180-1206 - Sándor P. Fekete, Dominik Krupke:
What Goes Around Comes Around: Covering Tours and Cycle Covers with Turn Costs. 1207-1238 - Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Cluster Editing for Multi-Layer and Temporal Graphs. 1239-1290 - Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin:
CNF Encodings of Symmetric Functions. 1291-1311 - Till Fluschnik, Leon Kellerhals:
Placing Green Bridges Optimally, with a Multivariate Analysis. 1312-1338 - Jingnan Xie, Harry B. Hunt III, Richard Edwin Stearns:
Pumping Lemmas Can be "Harmful". 1339-1352 - Fei Gao, Cui Yu, Yawen Chen, Boyong Gao:
Routing and Wavelength Assignment Algorithm for Mesh-based Multiple Multicasts in Optical Network-on-chip. 1353-1371 - Hagit Attiya, Arie Fouren, Jeremy Ko:
Lower Bounds on the Amortized Time Complexity of Shared Objects. 1372-1426 - Kensuke Kitai, Yuki Nishida, Yoshihide Watanabe:
Max-plus Algebraic Description of Evolutions of Weighted Timed Event Graphs. 1427-1441 - Giulia Bernardini, Estéban Gabory, Solon P. Pissis, Leen Stougie, Michelle Sweering, Wiktor Zuba:
Elastic-Degenerate String Matching with 1 Error or Mismatch. 1442-1467 - Zeev Nutov:
Approximation algorithms for node and element connectivity augmentation problems. 1468-1485
Volume 68, Number 6, December 2024
- Arseny M. Shur:
Non-Constructive Upper Bounds for Repetition Thresholds. 1487-1511 - Valérie Berthé, Herman Goulet-Ouellet:
Obstructions to Return Preservation for Episturmian Morphisms. 1512-1536 - L'ubomíra Dvoráková, Zuzana Masáková, Edita Pelantová:
2-Balanced Sequences Coding Rectangle Exchange Transformation. 1537-1555 - Aleksi Saarela:
On the Solution Sets of Three-Variable Word Equations. 1556-1571 - Shaull Almagor, Omer Yizhaq:
Jumping Automata over Infinite Words. 1572-1600 - France Gheeraert, Giuseppe Romana, Manon Stipulanti:
String Attractors of Some Simple-Parry Automatic Sequences. 1601-1621 - Michel Rigo, Manon Stipulanti, Markus A. Whiteland:
Automatic Abelian Complexities of Parikh-Collinear Fixed Points. 1622-1639 - Sam M. Thompson, Dominik D. Freydenberger:
Languages Generated by Conjunctive Query Fragments of FC[REG]. 1640-1682 - Philip Janicki:
Reordered Computable Numbers. 1683-1708
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-02-27 22:48 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:
