From time to space: Fast algorithms that yield small and fast data structures

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

Volumn 8066 LNCS, Issue , 2013, Pages 97-111

  Barbay, Jérémy ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

Adaptive (analysis of) algorithms; Compressed data structures; Permutation; Set union; Sorting; Unbounded search

Indexed keywords

DATA STRUCTURES; ENCODING (SYMBOLS); SORTING;

COMPRESSED DATA STRUCTURES; EXTERNAL MEMORY MODELS; FAST ALGORITHMS; LOWER BOUNDS; ORDERED ARRAY; PERMUTATION; SET UNION; UNBOUNDED SEARCH;

ALGORITHMS;

EID: 84888138057     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40273-9_8     Document Type: Conference Paper

References (36)

1. Ávila, B.T., Laber, E.S.: Merge source coding. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 214-218. IEEE (2009)
2. Baeza-Yates, R.: A fast set intersection algorithm for sorted sequences. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 400-408. Springer, Heidelberg (2004)
3. Barbay, J., Claude, F., Gagie, T., Navarro, G., Nekrich, Y.: Efficient fully-compressed sequence representations. Algorithmica (to appear, 2013)
4. Barbay, J., Fischer, J., Navarro, G.: LRM-trees: Compressed indices, adaptive sorting, and compressed permutations. Elsevier Theoretical Computer Science (TCS) 459, 26-41 (2012)
5. Barbay, J., He, M., Munro, J.I., Satti, S.R.: Succinct indexes for strings, binary relations and multilabeled trees. ACM Transactions on Algorithms 7(4), 52 (2011)
6. Barbay, J., Kenyon, C.: Deterministic algorithm for the t-threshold set problem. In: Proceedings of the 14th International Symposium Algorithms and Computation (ISAAC), pp. 575-584 (2003)
7. Barbay, J., Navarro, G.: Compressed representations of permutations, and applications. In: 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), vol. 3, pp. 111-122 (2009)
8. Belazzougui, D., Navarro, G.: Alphabet-independent compressed text indexing. ACM Transactions on Algorithms (TALG) (to appear, 2013)
9. Bentley, J.L., Yao, A.C.-C.: An almost optimal algorithm for unbounded searching. Information Processing Letters 5(3), 82-87 (1976)
10. Burge, W.H.: Sorting, trees, and measures of order. Information and Control 1(3), 181-197 (1958)
11. Carlsson, S., Levcopoulos, C., Petersson, O.: Sublinear merging and natural merge-sort. Algorithmica 9(6), 629-648 (1993)
12. Demaine, E.D., López-Ortiz, A., Munro, J.I.: Adaptive set intersections, unions, and differences. In: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 743-752 (2000)
13. Elias, P.: Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory 21(2), 194-203 (1975)
14. Estivill-Castro, V., Wood, D.: A survey of adaptive sorting algorithms. ACM Computing Surveys 24(4), 441-476 (1992)
15. Fernandez de la Vega, W., Kannan, S., Santha, M.: Two probabilistic results on merging. In: Asano, T., Imai, H., Ibaraki, T., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol. 450, pp. 118-127. Springer, Heidelberg (1990)
16. Fischer, J.: Optimal succinctness for range minimum queries. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 158-169. Springer, Heidelberg (2010)
17. Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proc. STOC, pp. 135-143. ACM Press (1984)
18. Gennaro, R., Trevisan, L.: Lower bounds on the efficiency of generic cryptographic constructions. In: IEEE Symposium on Foundations of Computer Science, pp. 305-313 (2000)
19. Golynski, A.: Optimal lower bounds for rank and select indexes. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 370-381. Springer, Heidelberg (2006)
20. Golynski, A.: Upper and Lower Bounds for Text Indexing Data Structures. PhD thesis. University of Waterloo (2007)
21. Golynski, A., Munro, J.I., Rao, S.S.: Rank/select operations on large alphabets: a tool for text indexing. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 368-373. ACM (2006)
22. Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 841-850. ACM (2003)
23. Harris, J.D.: Sorting unsorted and partially sorted lists using the natural merge sort. Software: Practice and Experience 11(12), 1339-1340 (1981)
24. Hwang, F.K., Lin, S.: A simple algorithm for merging two disjoint linearly-ordered sets. SIAM J. Comput. 1(1), 31-39 (1972)
25. Jacobson, G.: Space-efficient static trees and graphs. In: Proceedings of the 30th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 549-554 (1989)
26. Levcopoulos, C., Petersson, O.: Sorting shuffled monotone sequences. In: Gilbert, J.R., Karlsson, R. (eds.) SWAT 1990. LNCS, vol. 447, pp. 181-191. Springer, Heidelberg (1990)
27. Levcopoulos, C., Petersson, O.: Sorting shuffled monotone sequences. Inf. Comput. 112(1), 37-50 (1994)
28. Mannila, H.: Measures of presortedness and optimal sorting algorithms. IEEE Trans. Computers 34(4), 318-325 (1985)
29. Moffat, A., Petersson, O.: An overview of adaptive sorting. Australian Computer Journal 24(2), 70-77 (1992)
30. Moffat, A., Stuiver, L.: Binary interpolative coding for effective index compression. Inf. Retr. 3(1), 25-47 (2000)
31. Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Succinct representations of permutations and functions. Theor. Comput. Sci. 438, 74-88 (2012)
32. Munro, J.I., Spira, P.M.: Sorting and searching in multisets. SIAM J. Comput. 5(1), 1-8 (1976)
33. Petersson, O., Moffat, A.: A framework for adaptive sorting. Discrete Applied Mathematics 59, 153-179 (1995)
34. Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Transactions on Algorithms 3(4) (2007)
35. Rice, R.F., Plaunt, J.R.: Adaptive variable-length coding for efficient compression of spacecraft television data. IEEE Trans. Commun. COM-19, 889-897 (1971)
36. Sadakane, K., Navarro, G.: Fully-functional succinct trees. In: Proc. SODA, pp. 134-149. ACM/SIAM (2010)