Volume 51,
1987
- A. S. Troelstra:
On the Syntax of Martin-Löf's Type Theories.
1-26
- Philippe le Chenadec:
Analysis of Dehn's Algorithm by Critical Pairs.
27-52
- Klaus W. Wagner:
More Complicated Questions About Maxima and Minima, and Some Closures of NP.
53-80
- Annegret Habel, Hans-Jörg Kreowski:
Characteristics of Graph Languages Generated by Edge Replacement.
81-115
- Joffroy Beauquier, Françoise Gire:
Une Note sur le Théorème de Caractérisation des Générateurs Algébriques.
117-127
- Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop:
On the Consistency of Koomen's Fair Abstraction Rule.
129-176
- Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig:
Diagonalizations over Polynomial Time Computable Sets.
177-204
- Fernando Orejas:
A Characterization of Passing Compatibility for Parameterized Specifications.
205-214
- Arturo Capri:
On Unambiguous Reductions of Monoids of Unambiguous Relations.
215-220
- Jozef Vyskoc:
An O(n^lg k . 2^n/2) Time and O(k . 2^n/k) Space Algorithm for Certain NP-Complete Problems.
221-227
- Edward G. Belaga:
Constructive Universal Algebra: An Introduction.
229-238
- Ian Parberry:
On the Time Required to Sum n Semigroup Elements on a Parallel Machine with Simultaneous Writes.
239-247
- Tom Head, Barbara Lando:
Bounded D0L Languages.
255-264
- Steven Homer, Timothy J. Long:
Honest Polynomial Degrees and P=?NP.
265-280
- Béatrice Bérard:
Literal Shuffle.
281-299
- Takashi Yokomori:
On Purely Morphic Characterizations of Context-Free Languages.
301-308
- Susumu Yamasaki, Mikio Yoshida, Shuji Doshita:
A Fixpoint Semantics of Horn Sentences Based on Substitution Sets.
309-324
- Juraj Hromkovic:
Reversal-Bounded Nondeterministic Multicounter Machines and Complementation.
325-330
- Thomas Beth:
On the Computational Complexity of the General Discrete Fourier Transform.
331-339
- Zvi Galil, Raffaele Giancarlo:
Parallel String Matching with k Mismatches.
341-348
Copyright © Fri Mar 12 17:33:06 2010
by Michael Ley (ley@uni-trier.de)
