Space-time tradeoffs for graph properties

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 291-300

  Dodis, Yevgeniy ^a   Khanna, Sanjeev ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMMERCE; DECISION TREES; PROBES;

BROAD SPECTRUM; COMPUTATIONAL MODEL; GRAPH PROPERTIES; LOWER BOUND TECHNIQUES; NEAR-OPTIMAL; SPACE-TIME TRADEOFFS; TREE COMPLEXITY; UPPER AND LOWER BOUNDS;

TREES (MATHEMATICS);

EID: 84887490720     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_26     Document Type: Conference Paper

References (18)

1. M. Ajtai. A lower bound for finding predecessors in Yao's cell probe model. In Combinatorica, 8:235-247, 1988.
2. A. Borodin, R. Ostrovsky, Y. Rabani. Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems. In Proc. of STOC, 1999.
3. A. Chakrabarti, B. Chazelle, B. Gum, A. Lvov. A good neighbor is hard to find. In Proc. of STOC, 1999.
4. P. Elias, R.A. Flower. The complexity of some simple retrieval problems. In J. ACM, 22:367-379, 1975.
5. A. Hajnal, W. Maass and G. Turan. On the communication complexity of graph properties. In Proc. of STOC, pp. 186-191, 1988.
6. P. Hajnal. An n4=3 lower bound on the randomized complexity of graph pro- perties. In Combinatorica, 11:131-143, 1991.
7. L. Hellerstein, P. Klein, R. Wilber. On the Time-Space Complexity of Reach- Ability Queries for Preprocessed Graphs. In Information Processing Letters, 27:261-267, 1990.
8. J. Kahn, M. Saks, D. Sturtevant. A topological approach to evasiveness. In Proc. of FOCS, pp. 31-39, 1983.
9. E. Kushilevitz, N. Nisan. Communication Complexity. Cambridge University Press, 1997.
10. P. Miltersen. The bit probe complexity measure revisited. In Proc. of STACS, pp. 662-671, 1993.
11. P. Miltersen. Lower bounds for union-split-find related problems on random access machines. In Proc. STOC, pp. 625-634, 1994.
12. P. Miltersen. On cell probe complexity of polynomial evaluation. In Theoretical Computer Science, 143:167-174, 1995.
13. P. Miltersen, N. Nisan, S. Safra, A. Wigderson. On Data Structures and Asym- metric Communication Comlexity. In Proc. of STOC, pp. 103-111, 1995.
14. R. Rivest, J. Vuillemin. On recognizing graph properties from adjecency matrices. In Theoretical Computer Science, 3:371-384, 1976.
15. I. Wegener. The complexity of Boolean functions. In Wiley-Teubner series in Computer Science, 1987.
16. B. Xiao. New bounds in cell probe model. Ph.D. thesis, UC San Diego, 1992.
17. A. Yao. Should tables be sorted. In J. ACM, 28:615-628, 1981.
18. A. Yao. Some complexity questions related to distributed computing. In Proc. of STOC, pp. 209-213, 1979.