Information and Computation
, Volume 66
Volume 66, Number 1-2, 1985
Ravi Kannan
: Unraveling k-page graphs. 1-5
BibTeX
William C. Rounds
: On the Relationship between Scott Domains, Synchronization Trees, and Metric Spaces. 6-28
BibTeX
Michal Grabowski
: On Relative Completeness of Hoare Logics. 29-44
BibTeX
Norbert Blum
: An Area-Maximum Edge Length Trade-off for VLSI Layout. 45-52
BibTeX
Foto N. Afrati
,
Christos H. Papadimitriou
,
George Papageorgiou
: The Complexity of Cubical Graphs. 53-60
BibTeX
Greg N. Frederickson
: Implicit Data Structures for Weighted Elements. 61-82
BibTeX
Orna Grumberg
,
Nissim Francez
,
Johann A. Makowsky
,
Willem P. de Roever
: A Proof Rule for Fair Termination of Guarded Commands. 83-102
BibTeX
Dung T. Huynh
: The Complexity of Equivalence Problems for Commutative Grammars. 103-121
BibTeX
Volume 66, Number 3, 1985
Erich Kaltofen
: Effective Hilbert Irreducibility. 123-137
BibTeX
Takanori Adachi
: Powerposets. 138-162
BibTeX
Jacques Stern
: Complexity of Some Problems from the Theory of Automata. 163-176
BibTeX
Amihood Amir
: Separation in Nonlinear Time Models. 177-203
BibTeX
Copyright ©
Sat May 16 23:59:55 2009 by
Michael Ley
(
ley@uni-trier.de
)