Communication complexity and combinatorial lattice theory
- 1 October 1993
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 47 (2) , 322-349
- https://doi.org/10.1016/0022-0000(93)90035-u
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Monotone Circuits for Connectivity Require Super-Logarithmic DepthSIAM Journal on Discrete Mathematics, 1990
- A counterexample to the rank‐coloring conjectureJournal of Graph Theory, 1989
- Lower bounds on communication complexityInformation and Computation, 1987
- The theory of convex geometriesGeometriae Dedicata, 1985
- Solving Undirected Graph Problems on VLSISIAM Journal on Computing, 1985
- Information Transfer under Different Sets of ProtocolsSIAM Journal on Computing, 1984
- The VLSI Complexity of Selected Graph ProblemsJournal of the ACM, 1984
- Lower Bounds on Information Transfer in Distributed ComputationsJournal of the ACM, 1980
- A Bound for the Chromatic Number of a GraphThe American Mathematical Monthly, 1976
- A higher invariant for matroidsJournal of Combinatorial Theory, 1967