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 BibTeX
- Craig C. Squier, Friedrich Otto, Yuji Kobayashi:
A Finiteness Condition for Rewriting Systems.
271-294 BibTeX
- Ramana M. Idury, Alejandro A. Schäffer:
Dynamic Dictionary Matching with Failure Functions.
295-310 BibTeX
- Ernst L. Leiss:
Language Equations Over a One-Letter Alphabet with Union, Concatenation and Star: A Complete Solution.
311-330 BibTeX
- Hava T. Siegelmann, Eduardo D. Sontag:
Analog Computation via Neural Networks.
331-360 BibTeX
- Peter Eades, Sue Whitesides:
Drawing Graphs in Two Layers.
361-374 BibTeX
- Danièle Gardy:
Join Sizes, urn Models and Normal Limiting Distributions.
375-414 BibTeX
- Joel Spencer:
Randomization, Derandomization and Antirandomization: Three Games.
415-429 BibTeX
- K. Eriksson:
Reachability is Decidable in the Numbers Game.
431-439 BibTeX
- Dung T. Huynh, Lu Tian:
A Note on the Complexity of Deciding Bisimilarity of Normed Unary Processes.
441-448 BibTeX
- A. Bergey, Robert Cori:
On the Orbits of the Product of two Permutations.
449-461 BibTeX
- C. Picouleau:
Complexity of the Hamiltonian Cycle in Regular Graph Problem.
463-473 BibTeX
- N. Anderson, D. Manley:
A Matrix Extension of Winograd's Inner Product Algorithm.
475-477 BibTeX
Copyright © Wed Jun 4 19:21:13 2008
by Michael Ley (ley@uni-trier.de)
