default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 70
Volume 70, Number 1, March 2026
- Hiroki Shibata, Dominik Köppl:
LZ78 Substring Compression in Compressed Space. 1 - Lorenzo Carfagna
, Giovanni Manzini, Giuseppe Romana, Marinella Sciortino, Cristian Urbina:
Generalization of Repetitiveness Measures for Two-Dimensional Strings. 2 - Ishay Haviv, Michal Parnas:
Testing Intersectingness of Uniform Families. 3 - Xujin Chen, Xiyuan Deng, Xiaodong Hu, Changjun Wang:
Minimum-Cost Mixed Graph Covers with Targeted Weight Constraints. 4 - Matthias Bentert, Fedor V. Fomin, Petr A. Golovach:
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. 5 - Jakub Radoszewski, Wiktor Zuba:
Computing String Covers in Sublinear Time. 6 - Taketo Tsujimoto, Yuki Yonemoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga:
Subsequence Matching and LCS under Cartesian-Tree Equivalence. 7 - Mathieu Gascon, Mattéo Delabre, Nadia El-Mabrouk:
FullSynesth: Syntenic Reconciliation of a Set of Consistent Gene Trees. 8 - William S. Evans, David G. Kirkpatrick:
Frequency-Competitive Query Strategies to Maintain Low Congestion Potential Among Moving Entities. 9 - Aflatoun Amouzandeh, Rob van Stee:
Improved Online Scheduling with Restarts on a Single Machine. 10 - Anouk Duyster, Tomasz Kociumaka:
Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts. 11 - Ambroise Baril, Miguel Couceiro, Victor Lagerkvist:
Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings. 12 - Harpreet Bedi, Jason Suagee:
Degree 2 Lower Bound for Permanent in Arbitrary Characteristic. 13 - Georgios Amanatidis, Aris Filos-Ratsikas, Philip Lazos, Evangelos Markakis, Georgios Papasotiropoulos:
On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes. 14
Volume 70, Number 2, June 2026
- Manuel Bodirsky, Florian Starke:
Symmetric Linear Arc Monadic Datalog and Gadget Reductions. 18 - Mike Cruchten:
Kleene Theorems for Lasso Languages and ømega-Languages. 19 - Stefan Hoffmann:
Completely Distinguishable Automata and the Set of Synchronizing Words. 20 - Giulia Bernardini, Alessio Conte, Estéban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, Michelle Sweering:
On Strings Having the Same Length-k Substrings. 21 - Hanyin Xiao, Zhikang Zhang, Weidong Li:
An Lp-rounding Based Algorithm for Soft Capacitated Facility Location Problem with Submodular Penalties. 22 - Hideo Bannai, Keisuke Goto, Shunsuke Kanda, Dominik Köppl:
NP-Completeness on the Length of Double-Arrays and the Sparse Matrix Problem with at Least Logarithmic Alphabets/Widths. 23 - Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words. 24 - Stefan Hougardy, Karolina Tammemaa:
Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching. 25 - Gábor Erdélyi, Yongjie Yang:
Microbribery in Group Identification. 26 - Eric M. Osterkamp, Dominik Köppl:
The ceBWT Index: An Index for Circular Cartesian Tree Matching on Multiple Texts. 27 - Akito Takasaka, Tomohiro I:
Space-Efficient SLP Encoding for O(log N)-Time Random Access. 28 - Shuilian Liu, Yicheng Xu, Yong Zhang:
Individual Preference Facility Location: A Dual-Fitting Framework and Its Extensions. 29 - Shadman Rahman Kareem, Mardan Ameen Pirdawood:
Algebraically Enhanced 3D Chaotic Map with Hash-Based Initialization for Secure Image Encryption. 30 - Ankush Acharyya, Vahideh Keikha, Maria Saumell, Rodrigo I. Silveira:
Computing Largest Minimum Color-Spanning Intervals of Imprecise Points. 31 - Xuangui Huang, Emanuele Viola:
Average-Case Rigidity Lower Bounds. 32 - Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh:
Stability in Graphs with Matroid Constraints. 33 - Sangram K. Jena, K. Subramani:
An Algorithmic Analysis of MAXNAESAT Variants. 34 - L'ubomíra Balková, Edita Pelantová:
Reflection on the Reflection Complexity. 35 - Diego A. Rojas:
Effective Weak Convergence and Tightness of Measures in Computable Polish Spaces. 36 - Takeshi Nakai:
A Formalization of Financial Transactions in Secure Computation: How to Handle Coins with Various Colors. 37 - Leila NamvariTazehkand, Saeid Pashazadeh, Ali Ebnenasir:
Cutoff Theorems for the Model Checking of Crash-Tolerant Causal Broadcast. 38 - Md Lutfar Rahman, Thomas Watson:
Erdős-Selfridge Theorem for Nonmonotone CNFs. 39 - Jingnan Xie, Ching-Sheng Lin, Harry B. Hunt III, Richard Edwin Stearns:
A Practical Extension of Computational Complexity Theory for Applications in Mathematics and Sciences. 15 - Xiaofei Liu, Jinlin Zhang, Zhonghao Liu, Man Xiao, Weidong Li:
Algorithms for the Online Power Cover Problem on a Line. 16 - Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Sampling and Optimal Preference Elicitation in Simple Mechanisms. 17
Volume 70, Number 3, September 2026
- Ziwen Liao, Fangguo Zhang:
Accelerating Stage 2 in ECM Using Elliptic Divisibility Sequences. 40
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 2026-07-02 01:01 CEST 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:
