Succinct representations of permutations

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

Volumn 2719, Issue , 2003, Pages 345-356

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

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

^c INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ARBITRARY PERMUTATIONS; CONSTANT TIME; NEGATIVE INTEGERS; SUCCINCT REPRESENTATION;

ARTIFICIAL INTELLIGENCE;

EID: 35248856866     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_29     Document Type: Article

References (15)

1. 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 HPGERC2001-005 (August 2001): http://www.hpcerc.unm.edu/Research/tr/HPCERC2001-005.pdf
2. A. Z. Broder, M. Charikar, A. M. Frieze and M. Mitzenmacher. Min-wise independent permutations. Journal of Computer System Sciences, 60 630-659 (2000).
3. E. D. Demaine and A. López-Ortiz. A linear lower bound on index size for text retrieval. Journal of Algorithms, to appear.
4. A. Fiat, J. I. Munro, M. Naor, A. A. Schäuer, J.P. Schmidt and A. Siegel. An implicit data structure for searching a multikey table in logarithmic time. Journal of Computer and System Sciences, 43 406-424 (1991).
5. R. Grossi and 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, 397-406, 2000.
6. G. Jacobson. Space-efficient static trees and graphs. In Proceedings of the Annual Symposium on Foundations of Computer Science, 549-554, 1989.
7. D. E. Knuth. Efficient representation of perm groups. Combinatorica 11 33-43 (1991).
8. D. E. Knuth. The Art of Computer Programming, vol. 1: Fundamental Algorithms. Computer Science and Information Processing. Addison-Wesley, 1973.
9. D. E. Knuth. The Art of Computer Programming, vol. 3: Sorting and Searching. Computer Science and Information Processing. Addison-Wesley, 1973.
10. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes. Computer Science and Information Processing. Morgan Kauffman, 1992.
11. P. B. Miltersen. The bit probe complexity measure revisited. In Proceedings of the Annual Symposium on Theoretical Aspects of Computer Science, LNCS 665 662-671, Springer-Verlag, 1993.
12. J. I. Munro and V. Raman. Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing, 31(3) 762-776 (2002).
13. N. Pouyanne. On the number of permutations admitting an m-th root. The Electronic Journal of Combinatorics, 9 (2002), #R3.
14. R. Pagh. Low redundancy in static dictionaries with constant query time. SIAM Journal on Computing, 31(2) 353-363 (2001).
15. R. Raman, V. Raman and 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, 233-242, 2002.