default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 225
Volume 225, Numbers 1-2, August 1999
- Maryse Pelletier, Jacques Sakarovitch:
On the Representation of Finite Deterministic 2-Tape Automata. 1-63 - Pierluigi Crescenzi
, Luca Trevisan:
Max NP-completeness Made Easy. 65-79 - Zsuzsanna Róka:
Simulations between Cellular Automata on Cayley Graphs. 81-111 - Andrea E. F. Clementi, Luca Trevisan:
Improved Non-Approximability Results for Minimum Vertex Cover with Density Constraints. 113-128 - Wai-Fong Chuan:
Sturmian Morphisms and alpha-Words. 129-148 - Ismo Hakala, Juha Kortelainen:
On the System of Word Equations x0ui1x1ui2x2ui3x3=y0vi1y1vi2y2vi3y3(i=0, 1, 2, ...) in a Free Monoid. 149-161 - Pak-Ken Wong:
Optimal Path Cover Problem on Block Graphs. 163-169 - Josep M. Basart, Pere Guitart:
A Solution for the Coloured Cubes Problem. 171-176 - Manfred Göbel:
The "Smallest" Ring of Polynomial Invariants of a Permutation Group which has No Finite SAGBI Bases w.r.t. Any Admissible Order. 177-184 - Jack H. Lutz, David L. Schweizer:
Feasible Reductions to Kolmogorov-Loveland Stochastic Sequences. 185-194
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-12-05 22:36 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:
