Succinct representations of functions

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

Volumn 3142, Issue , 2004, Pages 1006-1015

  Munro, J Ian ^a   Rao, S Srinivasa ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

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

ARTIFICIAL INTELLIGENCE;

EID: 35048820071     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_84     Document Type: Article

References (11)

1. S. Alstrup and J. Holm. Improved algorithms for finding level-ancestors in dynamic trees. In Proceedings of the 27th International Conference on Automata, Language and Programming, LNCS 1853, 73-84, 2000.
2. M. A. Bender and M. Farach-Colton. The level ancestor problem simplified. In Proceedings of LATIN, LNCS 2286, 508-515, 2002.
3. O. Berkman and U. Vishkin. Finding level-ancestors in trees. Journal of Computer and System Sciences 48(2) 214-230 (1994).
4. P. F. Dietz. Finding level-ancestors in dynamic trees. In Proceedings of the 2nd Workshop on Algorithms and Data Structures, LNCS 519, 32-40, 1991.
5. R. Geary, R. Raman and V. Raman. Succinct Ordinal Trees with Level-ancestor Queries. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 1-10, 2004.
6. G. Jacobson. Space-efficient static trees and graphs. In Proceedings of the 30th 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. J. I. Munro. Tables. In Proceedings of the Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 1180, 37-42, 1996.
9. J. I. Munro and V. Raman. Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing, 31 (3):762-776, 2002.
10. J. Ian Munro, R. Raman, V. Raman and S. S. Rao. Succinct representations of permutations. In Proceedings of the International Conference on Automata, Language and Programming, LNCS 2719: 345-356, 2003.
11. R. Raman, V. Raman and S. S. Rao. Succinct dynamic data structures. In Proceedings of the Workshop on Algorithms and Data Structures, LNCS 2125: 426-437, 2001.