TIGHT LOWER AND UPPER BOUNDS FOR SOME DISTRIBUTED ALGORITHMS FOR A COMPLETE NETWORK OF PROCESSORS.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

83 Scopus citations

Original language	English
Title of host publication	Unknown Host Publication Title
Publisher	ACM
Pages	199-207
Number of pages	9
ISBN (Print)	0897911431, 9780897911436
DOIs	https://doi.org/10.1145/800222.806747
State	Published - 1 Jan 1984

ASJC Scopus subject areas

@inproceedings{73ec085a9cb04286a2e4e637be28851b,

title = "TIGHT LOWER AND UPPER BOUNDS FOR SOME DISTRIBUTED ALGORITHMS FOR A COMPLETE NETWORK OF PROCESSORS.",

author = "E. Korach and S. Moran and S. Zaks",

year = "1984",

month = jan,

day = "1",

doi = "10.1145/800222.806747",

language = "English",

isbn = "0897911431",

publisher = "ACM",

pages = "199--207",

booktitle = "Unknown Host Publication Title",

}

TY - GEN

T1 - TIGHT LOWER AND UPPER BOUNDS FOR SOME DISTRIBUTED ALGORITHMS FOR A COMPLETE NETWORK OF PROCESSORS.

AU - Korach, E.

AU - Moran, S.

AU - Zaks, S.

PY - 1984/1/1

Y1 - 1984/1/1

UR - https://www.scopus.com/pages/publications/0021653937

U2 - 10.1145/800222.806747

DO - 10.1145/800222.806747

M3 - Conference contribution

AN - SCOPUS:0021653937

SN - 0897911431

SN - 9780897911436

SP - 199

EP - 207

BT - Unknown Host Publication Title

PB - ACM

ER -