Sciweavers

244 search results - page 1 / 49
» Communicating Complex Systems
Sort
View
PODC
2012
ACM
13 years 7 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
13 years 7 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
103
Voted
SODA
2012
ACM
199views Algorithms» more  SODA 2012»
13 years 7 months ago
On the communication and streaming complexity of maximum bipartite matching
Ashish Goel, Michael Kapralov, Sanjeev Khanna
132
Voted
INFOCOM
2012
IEEE
13 years 7 months ago
Analyzing collaboration networks using simplicial complexes: A case study
Terrence J. Moore, Robert J. Drost, Prithwish Basu...