Volume 161, Numbers 1&2, 15 July 1996
- Zhi-Zhong Chen:
Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings.
1-21
- F. Carrere:
On the Kleijn-Rozenberg k-Adjacent Languages.
23-68
- Salah Labhalla, Henri Lombardi, Roger Marlin:
Algorithmes de calcul de la réduction de Hermite d'une matrice à coefficients polynomiaux.
69-92
- Tero Harju, Marjo Lipponen, Alexandru Mateescu:
Flatwords and Post Correspondence Problem.
93-108
- Alain J. Mayer, Larry J. Stockmeyer:
The Complexity of PDL with Interleaving.
109-122
- Lance Fortnow, Martin Kummer:
On Resource-Bounded Instance Complexity.
123-140
- H. Petersen:
On the Language of Primitive Words.
141-156
- Carla Selmi:
Over Testable Languages.
157-190
- Olivier Carton:
Chain Automata.
191-203
- Günter Hotz, Gisela Pitsch:
On Parsing Coupled-Context-Free Languages.
205-233
- Mark A. Fulk, Sanjay Jain:
Learning in the Presence of Inaccurate Information.
235-261
- Kenneth W. Regan:
Index Sets and Presentations of Complexity Classes.
263-287
- Osamu Maruyama, Satoru Miyano:
Inferring a Tree from Walks.
289-300
- Felipe Cucker, Mike Shub:
Generalized Knapsack Problems and Fixed Degree Separations.
301-306
- Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS.
307-314
Last update Wed May 22 18:52:20 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
