The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Graph distances in the streaming model: the value of space
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Matroid intersection, pointer chasing, and Young's seminormal representation of Sn
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A property of quantum relative entropy with an application to privacy in quantum communication
Journal of the ACM (JACM)
A direct sum theorem in communication complexity via message compression
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The hardness of median in the synchronized bit communication model
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
NOF-multiparty information complexity bounds for pointer jumping
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |