Distributed Computing 1991 - 1992: Vol 5 Table of Contents

1 Pages·0.12 MB·English

Contents of volume 5 Lengauer C, Barnett M, Hudson DG: To¬
wards systolizing compilation 7
Lisper B: Computing transitive closure on
systolic arrays of fixed size 133
No. 1: pp 1- 54 published June 17, 1991
Lundy GM, Miller RE; Specification and
No. 2; pp 55-106 published September 5, 1991
analysis of a data transfer protocol us¬
No. 3; pp 107-174 published December 11, 1991
ing systems of communicating ma¬
No. 4; pp 175-226 pubiished April 14, 1992
chines 145
Meldal S; A complete axiomatic semant¬
ics of spawning 159
Miller RE -* Lundy GM
Pachl J; Analysis of toggle protocols 25
Alnuweiri HM, Prasanna VK: Optimal ge¬ Goldreich O, Shrira L: On the complexity Paliwoda K, Sanders JW: An incremental
ometric algorithms for digitized images of computation in the presence of link specification of the sliding-window pro¬
on fixed-size linear arrays and scan¬ failures: the case of a ring 121 tocol 83
line arrays 55 Goldreich O -► Bahr-Yehuda R Pandya PK, Joseph M: P-A logic - a com¬
Amdur ES, Weber SM, Hadzilacos V: On positional proof system for distributed
the message complexity of binary by- Hadzilacos V -> Amdur ES programs 37
zantine agreement under crash fail¬ Hajek B: Bounds on evacuation time for Peleska J: Design and verification of fault
ures 175 deflection routing 1 tolerant systems with CSP 95
Halpern JY, Suzuki I: Clock synchroniza¬ Prasanna VK -► Alnuweiri HM
tion and the power of broadcasting 73
Bahr-Yehuda R, Goldreich O, Itai A: Effi¬ Hudson DG -► Lengauer C Sanders JW -> Paliwoda K
cient emulation of single-hop radio net¬ Shrira L -► Goldreich O
work with collision detection on multi¬ Itai A -♦ Bahr-Yehuda R Shvartsman AA -► Kanellakis PC
hop radio network with no collision de¬ Suzuki I -► Halpern JY
tection 67 Jonker JE; On-the-fly garbage collection
Barnett M -► Lengauer C for several mutators 187 Weber SM -► Amdur ES
Bastani FB -» Zhao Y Joseph M -► Pandya PK
Zhao Y, Bastani FB; A self-adjusting algo¬
Kanellakis PC, Shvartsman AA: Efficient rithm for byzantine agreement 219
Ebergen JC: A formal approach to de¬ parallel algorithms can be made ro¬
signing delay-insensitive circuits 107 bust 201 Indexed in Current Contents