Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 688-697

  Beame, Paul ^a   Vee, Erik ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; DATA STRUCTURES; DATABASE SYSTEMS; POLYNOMIALS; QUERY LANGUAGES;

BRANCHING PROGRAMS; LOWER BOUNDS; MULTIPARTY COMMUNICATION COMPLEXITY; NEAREST NEIGHBOR PROBLEMS; TIME SPACE TRADEOFFS;

COMPUTATIONAL COMPLEXITY;

EID: 0036036846     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/510002.510006     Document Type: Conference Paper

References (16)

1. Determinism versus non-determinism for linear time RAMS with memory restrictions
2. A non-linear time lower bound for boolean branching programs
3. Meanders and their applications in lower bounds arguments
4. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-off
5. Tigher lower bounds for nearest neighbot search and related problems in the cell probe model
6. Super-linear time-space tradeoff lower bounds for randomized computation
7. Time-space tradeoffs for branching programs
8. Lower bounds for high dimensional nearest neight search and related problems
9. On lower bounds for read-k times branching programs
10. Multi-party protocols
11. Quasi-random classes of hypergraphs
12. Communication complexity and quasi-randomness
13. On data structures and asymmetric communication complexity
14. On simultaneous resource bounds
15. The BNS-Chung criterion for multi-party communication complexity