Multi-party protocols (1983)
Cached
Download Links
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- DBLP
Other Repositories/Bibliography
by
Ashok K. Chandra
,
I Merrick
,
L. Furst
,
Richard J. Lipton
| Venue: | In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing |
| Citations: | 97 - 1 self |
BibTeX
@INPROCEEDINGS{Chandra83multi-partyprotocols,
author = {Ashok K. Chandra and I Merrick and L. Furst and Richard J. Lipton},
title = {Multi-party protocols},
booktitle = {In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing},
year = {1983},
pages = {94--99}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
process communication have been examined from a complexity pbint of view [SP, Y]. We study a new model, in which a collection of processes eo, "'', e~:~l
Citations
| 342 | Some complexity questions related to distributive computing - Yao - 1979 |
| 199 | Parity, circuits, and the polynomial-time hierarchy - Furst, Saxe, et al. - 1981 |
| 64 | Ramsey Theory - Graham, Rothschild, et al. - 1990 |
| 18 | A time-randomness tradeoff - Karp, Pippenger, et al. - 1985 |
| 15 | Old and New Problems and Results - Erdős, Graham - 1980 |
| 1 | A time-space tradeofffor sorting and related non-oblivious computations - Borodin, Fischer, et al. - 1979 |
| 1 | Bounds for width-2 branching programs." These proceedhags - Borodin, Dolev, et al. |
| 1 | On certain sets of integers - froth - 1954 |
| 1 | Communication complexity." 14 TM Annual ACM Symposium on Theory of Computing - Sipser, Papadimitriou - 1982 |
