Volume 123,
Number 1,
November 15,
1995
- Ryszard Janicki, Maciej Koutny:
Semantics of Inhibitor Nets.
1-16
- Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener:
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs.
17-28
- Martin Farach, Mikkel Thorup:
Fast Comparison of Evolutionary Trees.
29-37
- Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows:
On the Structure of Parameterized Problems in NP.
38-49
- Jan C. Bioch, Toshihide Ibaraki:
Complexity of Identification and Dualization of Positive Boolean Functions.
50-63
- Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the Intrinsic Complexity of Learning.
64-71
- Hannah Bast, Torben Hagerup:
Fast Parallel Space Allocation, Estimation and Integer Sorting.
72-110
- Fabrizio Luccio, Linda Pagli:
Approximate Matching for Two Families of Trees.
111-120
- Lance Fortnow, Sophie Laplante:
Circuit Lower Bounds à la Kolmogorov.
121-126
- Omer Berkman, Costas S. Iliopoulos, Kunsoo Park:
The Subtree Max Gap Problem with Application to Parallel String Covering.
127-137
- Yuji Takada:
A Hierarchy of Language Families Learnable by Regular Language Learning.
138-145
- Nader H. Bshouty:
Exact Learning Boolean Function via the Monotone Theory.
146-153
Volume 123,
Number 2,
1995
Copyright © Tue Feb 9 19:43:40 2010
by Michael Ley (ley@uni-trier.de)
