On Multi-Partition Communication Complexity (2001)
Cached
Download Links
- [lovelace.thi.informatik.uni-frankfurt.de]
- [eccc.hpi-web.de]
- DBLP
Other Repositories/Bibliography
by
Pavol Duris
,
Juraj Hromkovic
,
Stasys Jukna
,
Martin Sauerhoff
,
Georg Schnitger
| Venue: | In Proc. of 18th Int. Symp. on Theoretical Aspects of Computer Science vol. 2010 of Springer Lecture Notes in Computer Science |
BibTeX
@INPROCEEDINGS{Duris01onmulti-partition,
author = {Pavol Duris and Juraj Hromkovic and Stasys Jukna and Martin Sauerhoff and Georg Schnitger},
title = {On Multi-Partition Communication Complexity},
booktitle = {In Proc. of 18th Int. Symp. on Theoretical Aspects of Computer Science vol. 2010 of Springer Lecture Notes in Computer Science},
year = {2001},
pages = {206--217}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We study k-partition communication protocols, an extension of the standard two-party best-partition model to k input partitions. The main results are as follows.
