


default search action
Theoretical Computer Science, Volume 164
Volume 164, Numbers 1&2, 10 September 1996
- Svante Carlsson, Jingsen Chen, Christer Mattsson:
Heaps with Bits. 1-12 - John Case, Sanjay Jain, Arun Sharma:
Anomalous Learning Helps Succinctness. 13-28 - John Harrison:
On Almost Cylindrical Languages and the Decidability of the D0L and PWD0L Primitivity Problems. 29-40 - Víctor F. Sirvent:
Relationships Between the Dynamical Systems Associated to the Rauzy Substitutions. 41-57 - Christophe Picouleau:
Worst-Case Analysis of Fast Heuristics for Packing Squares into a Square. 59-72 - Martin Middendorf:
Two-Dimensional Partitioning Problems. 73-106 - Krzysztof Diks, Andrzej Pelc:
Reliable Computations on Faulty EREW PRAM. 107-122 - Kai Salomaa, Derick Wood, Sheng Yu:
Structural Equivalence and ET0L Grammars. 123-140 - Jack H. Lutz, Elvira Mayordomo
:
Cook Versus Karp-Levin: Separating Completeness Notions if NP is not Small. 141-163 - Pascal Hubert:
Propriétés combinatoires des suites définies par le billard dans les triangles pavants. 165-183 - James Allen Fill:
Limits and Rates of Convergence for the Distribution of Search Cost Under the Move-to-Front Rule. 185-206 - Alain Finkel, Isabelle Tellier:
A Polynomial Algorithm for the Membership Problem with Categorial Grammars. 207-221 - Clelia de Felice:
An Application of Hajós Factorizations to Variable-Length Codes. 223-252 - David Moews:
Coin-Sliding and Go. 253-276 - Ioan Tomescu
:
On the Asymptotic Average Length of a Maximum Common Subsequence for Words Over a Finite Alphabet. 277-285 - Arvind Gupta, Naomi Nishimura:
The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees. 287-298 - Costas S. Iliopoulos, Kunsoo Park:
A Work-Time Optimal Algorithm for Computing All String Covers. 299-310

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.