Volume 145, Numbers 1&2, 10 July 1995
Ernst L. Leiss:
Implicit Language Equations: Existence and Uniqueness of Solutions.
71-93
Nadia Creignou:
The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness.
111-145
Jiazhen Cai,
Robert Paige:
Using Multiset Discrimination to Solve Language Processing Problems Without Hashing.
189-228
Ker-I Ko:
A Polynomial-Time Computable Curve whose Interior has a Nonrecursive Measure.
241-270
Martin Middendorf:
On Finding Minimal, Maximal, and Consistent Sequences over a Binary Alphabet.
317-327
Gary Benson:
A Space Efficient Algorithm for Finding the Best Nonoverlapping Alignment Score.
357-369
Oded Maler:
A Decomposition Theorem for Probabilistic Transition Systems.
391-396
data released under the ODC-BY 1.0 license
