(Data) structures

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 434-443

  Pǎtraşcu, Mihai ^a  

^a MIT MEDIA LAB   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COMPLEXITIES; CONSTANT TIMES; DIMENSIONAL PROBLEMS; DISJOINTNESS; DYNAMIC PROBLEMS; GEOMETRIC PROBLEMS; HIGHER DIMENSIONS; LARGE SPACES; LOWER BOUNDS; NEW RESULTS; PARTIAL MATCHES; QUERY TIMES; REACH ABILITIES;

COMPUTERS; DATA STRUCTURES; FIBER OPTIC CHEMICAL SENSORS;

CONTROL THEORY;

EID: 57949107698     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.69     Document Type: Conference Paper

References (47)

1. M. Ajtai. A lower bound for finding predecessors in Yao's cell probe model. Combinatorica, 8(3):235-247, 1988.
2. S. Alstrup, A. M. Ben-Amram, and T. Rauhe. Worst-case and amortised optimality in union-find. In Proc. 31st ACM Symposium on Theory of Computing (STOC), 499-506, 1999.
3. S. Alstrup, G. S. Brodai, I. L. Gørtz, and T. Rauhe. Time and space efficient multi-method dispatching. In Proc. 8th Scandinavian Workshop on Algorithm Theory (SWAT), pages 20-29, 2002.
4. S. Alstrup, G. S. Brodai, and T. Rauhe. New data structures for orthogonal range searching. In Proc. 41st IEEE Sympos. Foundations of Computer Science (FOCS), 198-207, 2000.
5. S. Alstrup, T. Husfeldt, and T. Rauhe. Marked ancestor problems. In Proc. 39th IEEE Symposium on Foundations of Computer Science (FOCS), pages 534-543, 1998.
6. S. Alstrup, T. Husfeldt, and T. Rauhe. A cell probe lower bound for dynamic nearest-neighbor searching. In Proc. 12th ACM/SIAM Sympos. Discrete Alg. (SODA), 779-780, 2001.
7. A. Andoni, D. Croitoru, and M. Pǎtraşcu. Hardness of nearest-neighbor search under 1-infinity. In Proc. 49th IEEE Sympos. Foundations of Computer Science (FOCS), 2008.
8. A. Andoni, P. Indyk, and M. Pǎtraşcu. On the optimality of the dimensionality reduction method. In Proc. 47th IEEE Symposium on Foundations of Computer Science (FOCS), pages 449-458, 2006.
9. D. Applegate, G. Calinescu, D. S. Johnson, H. J. Karloff, K. Ligett, and J. Wang. Compressing rectilinear pictures and minimizing access control lists. In Proc. 18th ACM/SIAM Sympos. Discrete Algorithms (SODA), 1066-1075, 2007.
10. O. Barkol and Y. Rabani. Tighter lower bounds for nearest neighbor search and related problems in the cell probe model. J. Computer and System Sciences, 64(4):873-896, 2002. See also STOC'00.
11. P. Beame and F. E. Fich. Optimal bounds for the predecessor problem and related problems. J. Computer and System Sciences, 65(1):38-72, 2002. See also STOC'99.
12. A. M. Ben-Amram and Z. Galil. A generalization of a lower bound technique due to Fredman and Saks. Algorithmica, 30(1):34-66, 2001. See also FOCS'91.
13. A. Borodin, R. Ostrovsky, and Y. Rabani. Lower bounds for high dimensional nearest neighbor search and related problems. In Proc. 31st ACM Symposium on Theory of Computing (STOC), pages 312-321, 1999.
14. A. Chakrabarti, B. Chazelle, B. Gum, and A. Lvov. A lower bound on the complexity of approximate nearest-neighbor searching on the hamming cube. In Proc. 31st ACM Symposium on Theory of Computing (STOC), pages 305-311, 1999.
15. A. Chakrabarti and O. Regev. An optimal randomised cell probe lower bound for approximate nearest neighbour searching. In Proc. 45th IEEE Symposium on Foundations of Computer Science (FOCS), pages 473-482, 2004.
16. M. Charikar, P. Indyk, and R. Panigrahy. New algorithms for subset query, partial match, orthogonal range searching, and related problems. In Proc. 29th Int'l Colloq. Automata, Languages and Programming (ICALP), pages 451-462, 2002.
17. B. Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput, 17:427-462, 1988. See also FOCS'85.
18. R. Cole, L.-A. Gottlieb, and M. Lewenstein. Dictionary matching and indexing with errors and don't cares. In Proc. 36th ACM Symposium on Theory of Computing (STOC), pages 91-100, 2004.
19. M. de Berg, M. J. van Kreveld, and J. Snoeyink. Two- and three-dimensional point location in rectangular subdivisions. J. Algorithms, 18(2):256-277, 1995. See also SWAT'92.
20. D. Eppstein and S. Muthukrishnan. Internet packet filter management and rectangle geometry. In Proc. 12th ACM/SIAM Symposium on Discrete Algorithms (SODA), pages 827-835, 2001.
21. A. Feldmann and S. Muthukrishnan. Tradeoffs for packet classification. In Proc. IEEE INFOCOM, 1193-1202, 2000.
22. P. Ferragina and S. Muthukrishnan. Efficient dynamic method-lookup for object oriented languages. In Proc. 4th European Sympos. Algorithms (ESA), pages 107-120, 1996.
23. P. Ferragina, S. Muthukrishnan, and M. de Berg. Multimethod dispatching: A geometric approach with applications to string matching problems. In Proc. 31st ACM Symposium on Theory of Computing (STOC), pages 483-491, 1999.
24. M. L. Fredman and M. R. Henzinger. Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica, 22(3):351-362, 1998.
25. M. L. Fredman and M. E. Saks. The cell probe complexity of dynamic data structures. In Proc. 21st ACM Symposium on Theory of Computing (STOC), pages 345-354, 1989.
26. A. Gal and P. B. Miltersen. The cell probe complexity of succinct data structures. In Proc. 30th Int'l Colloq. Automata, Languages and Programming (ICALP), 332-344, 2003.
27. T. Husfeldt and T. Rauhe. New lower bound techniques for dynamic partial, sums and related problems. SIAM J. Comput., 32(3):736-753, 2003. See also ICALP'98.
28. T. Husfeldt, T. Rauhe, and S. Skyum. Lower bounds for dynamic transitive closure, planar point location, and parentheses matching. In Proc. 5th Scandinavian Workshop on Algorithm Theory (SWAT), pages 198-211, 1996.
29. ∞ norm. J. Computer and System Sciences, 63(4):627-638,2001. See also FOCS'98.
30. T. S. Jayram, S. Khot, R. Kumar, and Y. Rabani. Cell-probe lower bounds for the partial match problem.. J. Computer and System Sciences, 69(3):435-447, 2004. See also STOC'03.
31. D. Liu. A strong lower bound for approximate nearest neighbor searching. Inf. Proc. Letters, 92(1):23-29, 2004.
32. P. B. Miltersen. The bit probe complexity measure revisited. In 10th Symposium on Theoretical Aspects of Computer Science (STACS), pages 662-671, 1993.
33. P. B. Miltersen. Lower bounds for Union-Split-Find related problems on random access machines. In 26th ACM Symposium on Theory of Computing (STOC), pages 625-634,1994.
34. P. B. Miltersen, N. Nisan, S. Safra, and A. Wigderson. On data structures and asymmetric communication complexity. J. Computer and System Sciences, 57(1):37-49, 1998. See also STOC'95.
35. P. B. Miltersen, S. Subramanian, J. S. Vitter, and. R. Tamassia. Complexity models for incremental computation. Theoretical Computer Science, 130(1):203-236, 1994. See also STAGS'93.
36. S. Muthukrishnan and M. Müller. Time and space efficient method-lookup for object-oriented programs. In Proc. 7th ACM/SIAM Sympos. Discrete Alg. (SODA), 42-51, 1996.
37. Y. Nekrich. A data structure for multi-dimensional, range reporting. In Proc. 23rd ACMSymposium on Computational Geometry (SoCG), pages 344-353, 2007.
38. M. Pǎtraşcu. Lower bounds for 2-dimensional range counting. In Proc. 39th ACM Symposium on Theory of Computing (STOC), pages 40-46, 2007.
39. M. Pǎtraşcu and E. D. Demaine. Logarithmic lower bounds in the cell-probe model. SIAM J. Comput., 35(4):932-963, 2006. See also SODA'04 and STOC'04.
40. M. Pǎtraşcu and C. Tarniţǎ. On dynamic bit-probe complexity. Theoretical Computer Science, 380:127-142, 2007. See also ICALP'05.
41. M. Pǎtraşcu and M. Thorup. Higher lower bounds for nearneighbor and further rich problems. In Proc. 47th IEEE Symposium on Foundations of Computer Science (FOCS), pages 646-654, 2006.
42. M. Pǎtraşcu and M. Thorup. Time-space trade-offs for predecessor search. In Proc. 38th ACM Symposium on Theory of Computing (STOC), pages 232-240, 2006.
43. M. Pǎtraşcu and M. Thorup. Randomization does not help searching predecessors. In Proc. 18th ACM/SIAM Symposium on Discrete Algorithms (SODA), pages 555-564, 2007.
44. R. L. Rivest. Partial-match retrieval algorithms. SIAM J. Comput, 5(1):19-50, 1976. See also FOCS'74 and Stanford PhD thesis.
45. P. Sen and S. Venkatesh. Lower bounds for predecessor searching in the cell probe model. J. Computer and System Sci., 74(3):364-385, 2008. See also ICALP'01, CCC'03.
46. M. Thorup. Space efficient dynamic stabbing with fast queries. In Proc. 35th ACM Symposium on Theory of Computing (STOC), pages 649-658, 2003.
47. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Mathematical Systems Theory, 10:99-127, 1977. Conference version by van Emde Boas alone in FOCS'75.