Examining computational geometry, Van Emde Boas trees, and hashing from the perspective of the fusion tree

SIAM Journal on Computing

Volumn 29, Issue 3, 1999, Pages 1030-1049

  Willard, Dan E ^a  

^a State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DATA STRUCTURES; INFORMATION RETRIEVAL; ONLINE SEARCHING; SORTING; THEOREM PROVING;

FUSION TREE; HASHING; VAN EMDE BOAS TREES;

COMPUTATIONAL GEOMETRY;

EID: 0033294769     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539797322425     Document Type: Article

References (55)

1. S. ALBERS AND T. HAGERUP, Improved parallel integer sorting with concurrent writing, Inform. and Comput., 136 (1997), pp. 25-52.
2. S. ALSTRUP, D. HAREL, P. LAURIDSEN, AND M. THORUP, Dominators in Linear Time, SIAM J. Comput., 28 (1999), pp. 2117-2132.
3. A. ANDERSSON, Sublogarithmic searching without multiplication, J. Comput. System Sci., to appear.
4. A. ANDERSSON, Faster deterministic sorting and searching in linear space, in Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996, IEEE Computer Society, Los Alamitos, CA, 1996, pp. 135-141.
5. A. ANDERSSON, T. HAGERUP, S. NILSSON, AND R. RAMAN, Sorting in linear time?, J. Comput. System Sci., 57 (1998), pp. 74-93.
6. 0 RAMs: Query time Θ(√Logn / LogLogn) is necessary and sufficient, in Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996, IEEE Computer Society, Los Alamitos, CA, 1996, pp. 441-450.
7. 0 Instructions Only, Brics TR 96-30, University of Copenhagen, Copgenhagen, Denmark, 1996.
8. A. ANDERSSON AND K. SWANSON, On the difficulty of range searching, in Proceedings of 1995 Workshop on Algorithms and Data Structures, Lecture Notes in Comput. Sci. 955, Springer-Verlag, Berlin, pp. 473-481.
9. P. BEAME AND F. FICH, Optimal bound for the predecessor problem, in Proceedings of the 31st ACM Symposium on the Theory of Computing, Atlanta, Georgia, 1999, pp. 622-631.
10. J. BENTLEY, Multidimensional divide-and-conquer, Commun. ACM, 23 (1980), pp. 214-228.
11. A. BEN-AMRAM AND Z. GALIL, When can we sort in o(NlogN) time?, in Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, 1993, IEEE Computer Society, Los Alamitos, CA, 1993, pp. 538-546.
12. J. BENTLEY AND H. MAUER, Efficient worst-case data structures for range searching, Acta Inform., 13 (1980), pp. 155-168.
13. J. BENTLEY AND M. MCILROY, Engineering a sort function, Software - Practice and Experience, 23 (1993), pp. 1249-1265.
14. J. BENTLEY AND M. SHAMOS, A problem in multi-variate statistics: Algorithm, data structure and applications, in 15th Allerton Conf. on Comm., Contr., and Comp., University of Illinois, Champaign, IL, 1977, pp. 193-201.
15. A. BRODNIK, P. MILTERSEN, AND J. I. MUNRO, Transdichotomous algorithms without multiplication - some upper and lower bounds, in Proceedings of WADS-1997, Lecture Notes in Comput. Sci. 1272, Springer-Verlag, Berlin, 1997, pp. 426-439.
16. B. CHAZELLE, Filtering search: A new approach to query-answering, SIAM J. Comput., 15 (1986), pp. 703-724.
17. B. CHAZELLE, Lower bounds for orthogonal range searching II - the arithmetic model, J. ACM, 37 (1990), pp. 439-463.
18. B. CHAZELLE, Lower bounds for off-line range searching, Proceedings of the 27th ACM Symposium on Theory of Computing, ACM, New York, 1995, pp. 733-740.
19. B. CHAZELLE AND L. GUIBAS, Fractional cascading: A data structuring technique, Algorithmica, 1 (1986), pp. 133-162.
20. P. DIETZ, Optimal algorithms for list indexing and subset rank, in Proceedings of WADS, Lecture Notes in Comput. Sci. 382, Springer-Verlag, Berlin. 1989, pp. 39-46.
21. M. DIETZFELBINGER, A. KARLIN, K. MELHORN, F. MEYER AUF DER HEIDE, H. ROHNERT, AND R. TARJAN, Dynamic perfect hashing: Upper and lower bounas, in Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1988, pp. 524-531.
22. M. DIETZFELBINGER AND F. MEYER AUF DER HEIDE, A new universal class of hash functions and dynamic hashing in real time, in Automata, Languages and Programming, Lecture Notes in Comput. Sci. 443, Springer-Verlag, New York, 1990, pp 6-19.
23. H. EDELSBRUNNER, Algorithms in Computational Geometry, Springer-Verlag, Berlin, 1987.
24. M. FREDMAN, J. KOMLOS, AND E. SZEMERDI, Storing a sparse table, with O(1) worst-case access time, J. ACM, 31 (1984) pp. 539-544.
25. M. FREDMAN AND D. WILLARD, Surpassing the information theoretic barrier with fusion trees, J. Comput. System Sci., 47 (1993) pp. 424-436.
26. M. FREDMAN AND D. WILLARD, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, J. Comput. System Sci., 48 (1994) pp. 533-551.
27. G. GONNET, Handbook of Algorithms and Data Structures, Addison-Wesley, Reading, MA, 1983.
28. D. JOHNSON, A priority queue in which initialization and queue operations take O(log log D) time, Math. Systems Theory, 15 (1982), pp. 295-309.
29. R. KARLSSON AND J. I. MUNRO, Proximity on a grid, in Proceedings of the Second Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 182, Springer-Verlag, Berlin, 1985, pp. 187-196.
30. R. KARLSSON, J. I. MUNRO, AND E. ROBERTSON, The nearest neighbor problem on bounded domains, in Automata, Languages and Programming, Lecture Notes in Comput. Sci. 194, Springer-Verlag, Berlin, 1985, pp. 318-327.
31. D. KIRKPATRICK AND S. REICH, Upper bounds for sorting integers on random access machines, Theoret. Comput. Sci., 28 (1984) pp. 263-276.
32. P. MCILROY, K. BOSTIC, AND M. MCILROY, Engineering radix sort. Computer Systems, 6 (1993), pp. 5-27.
33. K. MEHLHORN, Data Structures and Algorithms 1: Sorting and Searching, Springer-Verlag, Berlin, 1984.
34. K. MEHLHORN, Data Structures and Algorithms 3: MultiDimensional Searching and Computational Geometry, Springer-Verlag, Berlin, 1984.
35. E. MCCREIGHT, Priority search trees, SIAM J. Comput., 14 (1985), pp. 257-276.
36. P. MILTLERSEN, Lower bounds for union split-split-find related problems, in Proceedings of 26th ACM Symposium on the Theory of Computing, ACM, New York, 1994, pp. 625-634.
37. P. MILTERSEN, Lower bounds on static dictionaries with bit operations but no multiplication, in Automata, Languages and Programming, Lecture Notes in Comput. Sci. 1099, Springer-Verlag, Berlin, 1996, pp. 213-225.
38. W. PAUL AND J. SIMON, Decision trees and random access machines, in Proceedings of the Symposium on Logic and Algorithmic. Zurich, 1980, Monogr. Enseign. Math. 30, University of Geneva, Geneva, 1982, pp. 331-340.
39. F. PREPERATA AND M. SHAMOS, Introduction to Computational Geometry, Springer-Verlag, Berlin, 1985.
40. R. RAMAN, Priority queues: Small monotone and trans-dichotomous, Proceedings of ESA'96, Lecture Notes in Comput. Sci. 1136, Springer-Verlag, Berlin, 1996, pp. 121-137.
41. R. RAMAN, A Summary of Shortest Path Results, Technical report 96-13, Kings College, London, 1996.
42. A. SIEGEL, On universal classes of fast high performance hash function, their time-space trade-off, and their applications, in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1989, pp. 20-25.
43. M. THORUP, On RAM priority queues, in Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, Atlanta, GA, 1996, pp. 59-67.
44. M. THORUP, Randomized sorting in O(n log log n) time and linear space using addition, shift and bit-wise Boolean operations, in Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, 1997, pp. 352-359.
45. M. THORUP, Undirected single source shortest path in linear time, in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1997, pp. 12-21.
46. M. THORUP, Faster deterministic sorting and priority queues in linear space, in Proceedings of 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1998, pp. 550-555.
47. P. VAN EMDE BOAS, Preserving order in a forest in less than logarithmic time and linear space, Inform. Process. Lett., 6 (1977), pp. 80-82.
48. P. VAN EMDE BOAS, R. KAAS, AND E. ZIJLSTRA, Design and implementation of an efficient priority queue, Math. Systems Theory 10, (1977), pp. 99-127.
49. D. WILLARD, Log-logarithmic worst case range queries are possible in space O(N), Inform. Process. Lett., 17 (1983), pp. 81-89.
50. D. WILLARD, New trie data structures which support very fast search operations. J. Comput. System Sci., 28 (1984), pp. 379-394.
51. D. WILLARD, Reduced memory space for multi-dimensional search trees, in Proceedings of the 2nd Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 182, Springer-Verlag, Berlin, 1985, pp. 363-374.
52. D. WILLARD, A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst case time, Inform. and Comput., 97 (1992), pp. 150-204.
53. D. WILLARD, Applications of the fusion tree method to computational geometry and searching, in Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms, Orlando, FL, 1992, pp. 386-395.
54. D. WILLARD AND G. LUEKER, Adding range restriction capability to dynamic data structures, J. ACM, 32 (1985) pp. 597-619.
55. A. YAO, On the complexity of maintaining partial sums, SIAM J. Comput., 14 (1985), pp. 277-289.