No sorting? Better searching!

ACM Transactions on Algorithms

Volumn 4, Issue 1, 2008, Pages

  Franceschini, Gianni ^a   Grossi, Roberto ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Implicit data structures; In place algorithms; Searching; Sorting

Indexed keywords

IMPLICIT DATA STRUCTURES; IN-PLACE ALGORITHMS;

DATA STRUCTURES; INFORMATION SYSTEMS; MATHEMATICAL MODELS; SOCIETIES AND INSTITUTIONS;

SEARCH ENGINES;

EID: 42149125599     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1328911.1328913     Document Type: Article

References (19)

1. ANDERSSON, A., HAGERUP, T., HÅSTAD, J., AND PETERSSON, O. 2001. Tight bounds for searching a sorted array of strings. SIAM J. Comput. 30, 5 (Oct.), 1552-1578.
2. ANDERSSON, A., HÅSTAD, J., AND PETERSSON, O. 1995. A tight lower bound for searching a sorted array. In Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC). ACM Press.
3. ANDERSSON, A., HAGERUP, T., HÅSTAD, J., AND PETERSSON, O. 1994. The complexity of searching a sorted array of strings. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (STOC), Montreal, Quebec, Canada. ACM Press, 317-325.
4. BENTLEY, J. L., AND SEDGEWICK, R. 1997. Fast algorithms for sorting and searching strings. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, LA. ACM Press, 360-369.
5. ELIAS, P., AND FLOWER, R. A. 1975. The complexity of some simple retrieval problems. J. ACM 22, 3, 367-379.
6. FIAT, A., AND NAOR, M. 1993. Implicit O(1) probe search. SIAM J. Comput. 22, 1, 1-10.
7. FIAT, A., AND NAOR, M. 1989. Implicit O(1) probe search. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC), Seattle, WA. ACM Press, 336-344.
8. FIAT, A., NAOR, M., SCHMIDT, J. P., AND SIEGEL, A. 1992. Nonoblivious hashing. J. ACM 39, 4 (Oct.), 764-782.
9. FIAT, A., MUNRO, J. I., NAOR, M., SCHÄFFER, A. A., SCHMIDT, J. P., AND SIEGEL, A. 1991. An implicit data structure for searching a multikey table in logarithmic time. J. Comput. Syst. Sci. 43, 3 (Dec.), 406-424.
10. FIAT, A., NAOR, M., SCHMIDT, J., AND SIEGEL, A. 1988. Non-Oblivious hashing. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), Chicago. IL. ACM Press, 367-376.
11. FREDMAN, M. L., KOMLÓS, J., AND SZEMERÉDI, E. 1984. Storing a sparse table with O(1) worst case access time. J. ACM 31, 3, 538-544.
12. HIRSCHBERG, D. S. 1980. On the complexity of searching a set of vectors. SIAM J. Comput. 9, 1, 126-129.
13. HIRSCHBERG, D. S. 1978. A lower worst-case complexity for searching a dictionary. In Proceedings of the 16th Annual Allerton Conference on Communication, Control, and Computing, 50-53.
14. KNUTH, D. E. 1998. The Art of Computer Programming III: Sorting and Searching (2nd ed.). Addison-Wesley, Reading, MA.
15. KOSARAJU, S. R. 1979. On a multidimensional search problem. In Proceedings of the 11th Annual ACM Symposium on Theory of Computing (STOC), 67-73.
16. MANBER, U., AND MYERS, G. 1993. Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22, 5 (Oct.), 935-948.
17. 2 n) time. J. Comput. Syst. Sci. 33, 1, 66-74.
18. MUNRO, J. I., AND SUWANDA, H. 1980. Implicit data structures for fast search and update. J. Comput. Syst. Sci. 21, 2, 236-250.
19. YAO, A. C. 1984. Should tables be sorted? J. ACM 31, 245-281.