The communication complexity of pointer chasing

Journal of Computer and System Sciences

Volumn 62, Issue 2, 2001, Pages 323-355

  Ponzio, Stephen J ^a   Radhakrishnan, Jaikumar ^b   Venkatesh, S ^b  

^a Integrated Objects   (United States)

^b TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; INFORMATION THEORY; NORMAL DISTRIBUTION; PROBLEM SOLVING; THEOREM PROVING; TRANSFER FUNCTIONS;

BOUNDED DEPTH MONOTONE CIRCUITS; COMMUNICATION COMPLEXITY; LOWER BOUND; POINTER CHASING; TRANSFER LEMMA; UPPER BOUND;

COMPUTATIONAL COMPLEXITY;

EID: 0035278440     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2000.1731     Document Type: Article

References (15)

1. The probabilistic method
2. Some bounds on multiparty communication complexity of pointer jumping
3. Lower bounds on communication complexity
4. On different modes of communication
5. Nondeterministic communication with a limited number of advice bits
6. Monotone circuits for connectivity require superlogarithmic depth
7. Lower bounds for computation with limited nondeterminism
8. On monotone formulae with restricted depth
9. Communication complexity
10. On the method of bounded differences
11. Rounds in communication complexity revisited
12. Randomness is linear in space
13. Communication complexity
14. The communication complexity of pointer chasing: Applications of entropy and sampling
15. Lower bounds by probabilistic arguments