Information and Computation
, Volume 52
Volume 52, Number 1, 1982
Louise Hay
: On the Recursion-Theoretic Complexity of Relative Succinctness of Representations of Languages. 2-7
BibTeX
Robert I. Soare
: Computational Complexity of Recursively Enumerable Sets. 8-18
BibTeX
Wolfgang Menzel
,
Volker Sperschneider
: Universal Automata with Uniform Bounds on Simulation Time. 19-35
BibTeX
Alan L. Selman
: Analogues of Semicursive Sets and Effective Reducibilities to the Study of NP Complexity. 36-51
BibTeX
Robert P. Daley
: Busy Beaver Sets: Characterizations and Applications. 52-67
BibTeX
Keh-Jiann Chen
: Tradeoffs in the Inductive Inference of Nearly Minimal Size Programs. 68-86
BibTeX
Albert R. Meyer
: What is a Model of the Lambda Calculus? 87-122
BibTeX
Volume 52, Number 2, 1982
Daniel N. Osherson
,
Scott Weinstein
: Criteria of Language Learning. 123-138
BibTeX
Michael A. Arbib
,
Ernest G. Manes
: Parametrized Data Types Do Not Need Highly Constrained Parameters. 139-158
BibTeX
Jan A. Bergstra
,
Anna Chmielinska
,
Jerzy Tiuryn
: Another Incompleteness Result for Hoare's Logic. 159-171
BibTeX
J. Albert
,
Karel Culik II
,
Juhani Karhumäki
: Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid. 172-186
BibTeX
Etsuji Tomita
: A Direct Branching Algorithm for Checking Equivalence of Some Classes of Deterministic Pushdown Automata. 187-238
BibTeX
Volume 52, Number 3, 1982
Allan Borodin
,
Joachim von zur Gathen
,
John E. Hopcroft
: Fast Parallel Matrix and GCD Computations. 241-256
BibTeX
Danny Dolev
,
Michael J. Fischer
,
Robert J. Fowler
,
Nancy A. Lynch
,
H. Raymond Strong
: An Efficient Algorithm for Byzantine Agreement without Authentication. 257-274
BibTeX
Bruno Courcelle
,
Paul Franchi-Zannettacci
: On the Equivalence Problem for Attribute Systems. 275-305
BibTeX
C. P. J. Koymans
: Models of the Lambda Calculus. 306-332
BibTeX
H. C. M. Kleijn
,
Grzegorz Rozenberg
: Corrigendum: Sequential, Continuous and Parallel Grammars. 364
BibTeX
Copyright ©
Sat May 16 23:59:54 2009 by
Michael Ley
(
ley@uni-trier.de
)