Geometric searching over the rationals

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

Volumn 1643, Issue , 1999, Pages 354-365

  Chazelle, Bernard ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BIT LENGTHS; ENCLOSURE PROBLEM; LOWER BOUNDS; QUERY POINTS; QUERY TIME; SEARCH PROBLEM; TIGHT BOUND; YAO'S CELL PROBE MODEL;

ARTIFICIAL INTELLIGENCE;

EID: 84958059433     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48481-7_31     Document Type: Conference Paper

References (20)

1. Ajtai, M. A lower bound for finding predecessors in Yao's cell probe model, Combina-torica, 8 (1988), 235-247.
2. Beame, P., Fich, F. Optimal bounds for the predecessor problem, Proc. 31st Annu. ACM Symp. Theory Comput. (1999), to appear.
3. Ben-Or, M. Lower bounds for algebraic computation trees, Proc. 15th Annu. ACM Symp. Theory Comput. (1983), 80-86.
4. Bjorner, A., Lovasz, L., Yao, A.C. Linear decision trees: Volume estimates and topological bounds, Proc. 24th Annu. ACM Symp. Theory Comput. (1992), 170-177.
5. Chakrabarti, A., Chazelle, B., Gum, B., Lvov, A. A good neighbor is hard to find, Proc. 31st Annu. ACM Symp. Theory Comput. (1999), to appear.
6. Chazelle, B. The Discrepancy Method: Randomness and Complexity, Cambridge University Press, to appear.
7. Fredman, M.L. A lower bound on the complexity of orthogonal range queries, J. ACM, 28 (1981), 696-705.
8. Grigoriev, D., Karpinksi, M., Meyer auf der Heide, F., Smolensky, R. A lower bound for randomized algebraic decision trees, Computational Complexity, 6 (1997), 357-375.
9. Grigoriev, D., Karpinksi, M., Vorobjov, N. Improved lower bound on testing membership to a polyhedron by algebraic decision trees, Proc. 36th Annu. IEEE Symp. Foundat. Comput. Sci. (1995), 258-265.
10. Hoeffding, W. Probability inequalities for sums of bounded random variables, J. Amer. Stat. Assoc., 58 (1963), 13-30.
11. Karlsson, R.G. Algorithms in a restricted universe, Tech Report CS-84-50, Univ. Waterloo, Waterloo, ON, 1984.
12. Karlsson, R.G., Munro, J.I. Proximityon a grid, Proc. 2nd Symp. Theoret. Aspects of Comput. Sci., LNCS Springer, vol.182 (1985), 187-196.
13. Karlsson, R.G., Overmars, M.H. Scanline algorithms on a grid, BIT, 28 (1988), 227-241.
14. Kushilevitz, E., Nisan, N. Communication Complexity, Cambridge University Press, 1997
15. Miltersen, P.B. Lower bounds for union-split-find related problems on random access machines, Proc. 26th Annu. ACM Symp. Theory Comput. (1994), 625-634.
16. Müller, H. Rasterized point location, Proc. Workshop on Graph-Theoretic Concepts in Comput. Sci., Trauner Verlag, Linz (1985), 281-293.
17. Overmars, M.H. Computational geometryon a grid: an overview, ed. R. A. Earns-haw, Theoretical Foundations of Computer Graphics and CAD, NATO ASI, vol.F40, Springer-Verlag (1988), 167-184.
18. Yao, A.C. Should tables be sorted?, J. ACM, 28 (1981), 615-628.
19. Yao, A.C. On the complexity of maintaining partial sums, SIAM J. Comput. 14 (1985), 277-288.
20. Yao, A.C. Decision tree complexity and Betti numbers, Proc. 26th Annu. ACM Symp. Theory Comput. (1994), 615-624.