Information and Computation
, Volume 75
Volume 75, Number 1, 1987
David A. Carlson
:
Time-Space Efficient Algorithms for Computing Convolutions and Related Problems.
1-14
Xin He
,
Yaacov Yesha
:
Parallel Recognitions and Decomposition of Two Terminal Series Parallel Graphs.
15-38
Torben Hagerup
:
Towards Optimal Parallel Bucket Sorting.
39-51
Andrei Z. Broder
,
Danny Dolev
,
Michael J. Fischer
,
Barbara Simons
:
Efficient Fault-Tolerant Routings in Networks.
52-64
Stefan Waner
,
Yihren Wu
:
The Hierarchical Structure of Graph Searches.
65-85
Volume 75, Number 2, 1987
Dana Angluin
:
Learning Regular Sets from Queries and Counterexamples.
87-106
Rolf Klein
,
Derick Wood
:
The Node Visit Cost of Brother Trees.
107-129
Gabriel Bracha
:
Asynchronous Byzantine Agreement Protocols.
130-143
Hiroaki Yamamoto
,
Shoichi Noguchi
:
Comparison of the Power between Reversal-Bounded ATMs and Reversal-Bounded NTMs.
144-161
Yishay Mansour
,
Shmuel Zaks
:
On the Bit Complexity of Distributed Computations in a Ring with a Leader.
162-177
Marek Karpinski
,
Rutger Verbeek
:
On the Monte Carlo Space Constructible Functions and Seperation Results for Probabilistic Complexity Classes.
178-189
Volume 75, Number 3, 1987
Hendrik Pieter Barendregt
,
Richard Kennaway
,
Jan Willem Klop
,
M. Ronan Sleep
:
Needed Reduction and Spine Strategies for the Lambda Calculus.
191-231
Dirk Hauschildt
,
Rüdiger Valk
:
Safe States in Banker-like Resource Allocations Problems.
232-263
Evangelos Kranakis
:
Fixed Point Equations with Parameters in the Projective Model.
264-288
A. W. Roscoe
,
Naiem Dathi
:
The Pursuit of Deadlock freedom.
289-327
Last update Tue Feb 14 04:18:16 2012 CET by the
DBLP Team
—
Data released under the
ODC-BY 1.0 license
— See also our
legal information page