Cited By
View all- Dinitz YMoran SRajsbaum SVitter JLarmore LLeighton T(1999)Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)Proceedings of the thirty-first annual ACM symposium on Theory of Computing10.1145/301250.301314(265-274)Online publication date: 1-May-1999
- Dietzfelbinger MLeighton FShor P(1997)The linear-array problem in communication complexity resolvedProceedings of the twenty-ninth annual ACM symposium on Theory of computing10.1145/258533.258622(373-382)Online publication date: 4-May-1997
- Kushilevitz E(1997)Communication Complexity10.1016/S0065-2458(08)60342-3(331-360)Online publication date: 1997