Information and Computation
, Volume 95
Volume 95, Number 1, 1991
Amotz Bar-Noy
,
Danny Dolev
,
Daphne Koller
,
David Peleg
: Fault-Tolerant Critical Section Management in Asynchronous Environments. 1-20
BibTeX
Joost Engelfriet
: Iterated Stack Automata and Complexity Classes. 21-75
BibTeX
Alberto Apostolico
,
Maxime Crochemore
: Optimal Canonization of All Substrings of a String. 76-95
BibTeX
David A. Mix Barrington
,
Pierre McKenzie
: Oracle branching programs and Logspace versus P. 96-115
BibTeX
Volume 95, Number 2, 1991
Juraj Hromkovic
: Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators. 117-128
BibTeX
David Haussler
,
Michael J. Kearns
,
Nick Littlestone
,
Manfred K. Warmuth
: Equivalence of Models for Polynomial Learnability. 129-161
BibTeX
Sanjay Jain
,
Arun Sharma
: Learning in the Presence of Partial Explanations. 162-191
BibTeX
Alban Ponse
: Process Expressions and Hoare's Logic: Showing an Irreconcilability of Context-Free Recursion with Scott's Induction Rule. 192-217
BibTeX
R. Mahesh
,
C. Pandu Rangan
,
Aravind Srinivasan
: On Finding the Minimum Bandwidth of Interval Graphs. 218-224
BibTeX
Livio Colussi
: Correctness and Efficiency of the Pattern Matching Algorithms. 225-251
BibTeX
Copyright ©
Sat May 16 23:59:57 2009 by
Michael Ley
(
ley@uni-trier.de
)