Succinct representations of permutations and functions

Theoretical Computer Science

Volumn 438, Issue , 2012, Pages 74-88

  Munro, J Ian ^a   Raman, Rajeev ^b   Raman, Venkatesh ^c   Rao, Srinivasa S ^d  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

^c INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^d Seoul National University   (South Korea)

Author keywords

Benes network; Functions; Level ancestor queries; Permutations; Space redundancy; Succinct data structures; Succinct tree representations

Indexed keywords

BENES NETWORK; LEVEL ANCESTOR QUERIES; PERMUTATIONS; SUCCINCT DATA STRUCTURE; TREE REPRESENTATION;

DATA STRUCTURES; FUNCTIONS; INFORMATION THEORY; OPTIMIZATION;

REDUNDANCY;

EID: 84861201978     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2012.03.005     Document Type: Article

References (34)

1. S. Alstrup, J. Holm, Improved algorithms for finding level-ancestors in dynamic trees, in: Proceedings of the 27th International Conference on Automata, Language and Programming, LNCS, vol. 1853, 2000, pp. 73-84.
2. D.A. Bader, M. Yan, B.M.W. Moret, A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. University of New Mexico Technical Report HPCERC2001-005 (August 2001): http://www.hpcerc.unm.edu/Research/tr/HPCERC2001-005.pdf.
3. J. Barbay, G. Navarro, Compressed representations of permutations, and applications, in: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, LIPIcs 3 Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 111-122, 2009.
4. M.A. Bender, M. Farach-Colton, The level ancestor problem simplified, in: Proceedings of LATIN, LNCS, vol. 2286, 2002, pp. 508-515.
5. D. Benoit, E.D. Demaine, J.I. Munro, R. Raman, V. Raman, and S.S. Rao Representing trees of higher degree Algorithmica 43 4 2005 275 292 (Pubitemid 43018037)
6. O. Berkman, and U. Vishkin Finding level-ancestors in trees Journal of Computer and System Sciences 48 2 1994 214 230 (Pubitemid 124013289)
7. A.Z. Broder, M. Charikar, A.M. Frieze, and M. Mitzenmacher Min-wise independent permutations Journal of Computer System Sciences 60 2000 630 659
8. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms third ed. 2009 The MIT Press
9. P.F. Dietz, Finding level-ancestors in dynamic trees, in: Proceedings of the 2nd Workshop on Algorithms and Data Structures, LNCS, vol. 519, 1991, pp. 32-40.
10. Y. Dodis, M. Patrascu, M. Thorup, Changing base without losing space, in: Proceedings of ACM Symposium on Theory of Computing, 2010, pp. 593-602.
11. A. Gál, and P.B. Miltersen The cell probe complexity of succinct data structures Theoretical Computer Science 379 3 2007 405 417 (Pubitemid 46754588)
12. R. Geary, N. Rahman, R. Raman, and V. Raman A simple optimal representation for balanced parentheses Theoretical Computer Science 368 3 2006 231 246 (Pubitemid 44750352)
13. R. Geary, R. Raman, and V. Raman Succinct ordinal trees with level-ancestor queries ACM Transactions on Algorithms 2 4 2006 510 534 (Pubitemid 46174059)
14. A. Golynski Optimal lower bounds for rank and select indexes Theoretical Computer Science 387 3 2007 348 359 (Pubitemid 47633448)
15. A. Golynski, Cell probe lower bounds for succinct data structures, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2009, pp. 625-634.
16. A. Golynski, Upper and lower bounds for text indexing data structures, Ph.D. Thesis, University of Waterloo, 2007.
17. A. Golynski, J.I. Munro, S.S. Rao, Rank/select operations on large alphabets: a tool for text indexing, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 368-373. (Pubitemid 43275258)
18. R. Grossi, J.S. Vitter, Compressed suffix arrays and suffix trees with applications to text indexing and string matching, in: Proceedings of the ACM Symposium on Theory of Computing, 2000, pp. 397-406.
19. M. He, J.I. Munro, S.S. Rao, A categorization theorem on suffix arrays with applications to space efficient text indexes, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2005, pp. 23-32. (Pubitemid 40851354)
20. M. He, J.I. Munro, S.S. Rao, Succinct ordinal trees based on tree covering, in: Proceedings of the International Conference on Automata, Language and Programming, LNCS, vol. 4596, 2007, pp. 509-520.
21. M.E. Hellman A cryptanalytic time-memory tradeoff IEEE Transactions on Information Theory 26 1980 401 406
22. G. Jacobson, Space-efficient static trees and graphs, in: Proceedings of the Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 549-554. (Pubitemid 20726002)
23. D.E. Knuth Efficient representation of perm groups Combinatorica 11 1991 33 43
24. F.T. Leighton Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes Computer Science and Information Processing 1992 Morgan Kauffman
25. P. B. Miltersen The bit probe complexity measure revisited Proceedings of the Annual Symposium on Theoretical Aspects of Computer Science LNCS vol. 665 1993 Springer-Verlag 662 671
26. J.I. Munro, and V. Raman Succinct representation of balanced parentheses and static trees SIAM Journal on Computing 31 3 2002 762 776 (Pubitemid 34750554)
27. J.I. Munro, R. Raman, V. Raman, S.S. Rao, Succinct representations of permutations, in: Proceedings of the International Conference on Automata, Language and Programming, LNCS, vol. 2719, 2003, pp. 345-356.
28. M. Patrascu, Succincter, in: Proceedings of the Annual IEEE Symposium on Foundations of Computer Science, 2008, pp. 305-313.
29. M. Patrascu, E. Viola, Cell-probe lower bounds for succinct partial sums, in: Proc. 21st Annual ACM-SIAM SODA, 2010, pp. 117-122.
30. N. Pouyanne On the number of permutations admitting an m-th root The Electronic Journal of Combinatorics 9 2002
31. R. Raman, V. Raman, S.S. Rao, Succinct dynamic data structures, in: Proceedings of the Workshop on Algorithms and Data Structures, LNCS, vol. 2125, 2001, pp. 426-437. (Pubitemid 33315667)
32. R. Raman, V. Raman, S.S. Rao, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 233-242.
33. K. Sadakane, G. Navarro, Fully-functional succinct trees, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2010, pp. 134-149.
34. Dan E. Willard Log-logarithmic worst-case range queries are possible in space Θ (N) Information Processing Letters 17 1983 81 84