Volume 131,
Number 1,
29 August 1994
Volume 131,
Number 2,
12 September 1994
- Yael Etzion-Petruschka, David Harel, Dale Myers:
On the Solvability of Domino Snake Problems.
243-269
- Craig C. Squier, Friedrich Otto, Yuji Kobayashi:
A Finiteness Condition for Rewriting Systems.
271-294
- Ramana M. Idury, Alejandro A. Schäffer:
Dynamic Dictionary Matching with Failure Functions.
295-310
- Ernst L. Leiss:
Language Equations Over a One-Letter Alphabet with Union, Concatenation and Star: A Complete Solution.
311-330
- Hava T. Siegelmann, Eduardo D. Sontag:
Analog Computation via Neural Networks.
331-360
- Peter Eades, Sue Whitesides:
Drawing Graphs in Two Layers.
361-374
- Danièle Gardy:
Join Sizes, urn Models and Normal Limiting Distributions.
375-414
- Joel Spencer:
Randomization, Derandomization and Antirandomization: Three Games.
415-429
- K. Eriksson:
Reachability is Decidable in the Numbers Game.
431-439
- Dung T. Huynh, Lu Tian:
A Note on the Complexity of Deciding Bisimilarity of Normed Unary Processes.
441-448
- A. Bergey, Robert Cori:
On the Orbits of the Product of two Permutations.
449-461
- C. Picouleau:
Complexity of the Hamiltonian Cycle in Regular Graph Problem.
463-473
- N. Anderson, D. Manley:
A Matrix Extension of Winograd's Inner Product Algorithm.
475-477
Copyright © Fri Mar 12 17:33:08 2010
by Michael Ley (ley@uni-trier.de)
