Journal of the ACM (JACM)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Two lower bounds for branching programs
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Lower bounds on communication complexity in distributed computer networks
Journal of the ACM (JACM)
On the complexity of branching programs and decision trees for clique functions
Journal of the ACM (JACM)
Towards optimal simulations of formulas by bounded-width programs
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Rounds in communication complexity revisited
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On the communication complexity of distributed algebraic computation
Journal of the ACM (JACM)
Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The cost of the missing bit: communication complexity with help
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Compression using efficient multicasting
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Constructing set systems with prescribed intersection sizes
Journal of Algorithms
Multiparty Communication Complexity: Very Hard Functions
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Multiparty communication complexity and very hard functions
Information and Computation
An impossibility gap between width-4 and width-5 permutation branching programs
Information Processing Letters
Computational Complexity
Finding large 3-free sets I: The small n case
Journal of Computer and System Sciences
Communication in the presence of replication
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Improved Separations between Nondeterministic and Randomized Multiparty Communication
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Quantum multiparty communication complexity and circuit lower bounds
Mathematical Structures in Computer Science
Finding, minimizing, and counting weighted subgraphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Partition Arguments in Multiparty Communication Complexity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Improved Separations between Nondeterministic and Randomized Multiparty Communication
ACM Transactions on Computation Theory (TOCT)
An impossibility gap between width-4 and width-5 permutation branching programs
Information Processing Letters
Languages with bounded multiparty communication complexity
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Quantum multiparty communication complexity and circuit lower bounds
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Proceedings of the forty-second ACM symposium on Theory of computing
IEEE Transactions on Information Theory
ACM SIGACT News
An improved construction of progression-free sets
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Multiparty equality function computation in networks with point-to-point links
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Lower bounds for circuits with few modular and symmetric gates
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Hadamard tensors and lower bounds on multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
An algebraic point of view on the crane beach property
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
The multiparty communication complexity of exact-T: improved bounds and new problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
NOF-multiparty information complexity bounds for pointer jumping
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Parallel search for Ramsey grid colorings
Proceedings of the 50th Annual Southeast Regional Conference
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Allowing each node to communicate only once in a distributed system: shared whiteboard models
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
The cost of fault tolerance in multi-party communication complexity
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Trade-Offs Between Time, Space, Cooperation, and Communication Complexity for CD Grammar Systems
Fundamenta Informaticae
The NOF multiparty communication complexity of composed functions
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Separating deterministic from nondeterministic nof multiparty communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Shielding circuits with groups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Communication lower bounds using directional derivatives
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hadamard tensors and lower bounds on multiparty communication complexity
Computational Complexity
Optimal Collapsing Protocol for Multiparty Pointer Jumping
Theory of Computing Systems
| Hi-index | 0.06 |
Many different types of inter-process communication have been examined from a complexity point of view [SP, Y]. We study a new model, in which a collection of processes P0, ..., Pk−1 that share information about a set of integers {a0, ...,ak−1}, communicate to determine a 0-1 predicate of the numbers. In this new model, tremendous sharing of information is allowed, while no single party is given enough information to determine the predicate on its own. Formally, each Pi has access to every aj except for ai. For simplicity, we only allow the parties to communicate as follows.