Volume 86, Number 1, 1991
Volume 86, Number 2, 1991
- Amir Averbuch, Zvi Galil, Shmuel Winograd:
Classification of All the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial. Part II: The Algebra G[u]/<u^n>.
143-203

- Jean-Claude Spehner:
Merging in Maps and in Pavings.
205-232

- Kosaburo Hashiguchi:
Recognizable Closures and Submonoids of Free Partially Commutative Monoids.
233-241

- Marek Chrobak, David Eppstein:
Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices.
243-266

- Matthias Krause, Christoph Meinel, Stephan Waack:
Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e.
267-275

- Françoise Gire, Maurice Nivat:
Langages algébriques de mots biinfinis.
277-323

- Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini:
The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages.
325-342

- Carl-Johan H. Seger:
On the Existence of Speed-Independent Circuits.
343-364

- Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro:
Decoders with Initial State Invariance for Multivalued Encodings.
365-375

- Gyora M. Benedek, Alon Itai:
Learnability with Respect to Fixed Distributions.
377-390

Last update Sat May 25 21:14:05 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page