Succinct representations of functions

DOI10.1007/978-3-540-27836-8_84MaRDI QIDQ5466533zbMATH OpenOpenAlexFDO

Authors J. Ian Munro, S. Srinivasa Rao

Publication date 24 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99859

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Succinct representations of permutations and functions
• Succinct representations of permutations
• On the succinct representation of unlabeled permutations
• Efficient computation of the iteration of functions
• scientific article; zbMATH DE number 3968574

Cited in

(13)

• Efficient computation of the iteration of functions
• Path queries on functions
• Succinct representation of labeled graphs
• Adaptive searching in succinctly encoded binary relations and tree-structured documents
• Fully functional static and dynamic succinct trees
• Succinct representations of ordinal trees
• scientific article; zbMATH DE number 3968574 (Why is no real title available?)
• Succinct encoding of arbitrary graphs
• Ultra-succinct representation of ordered trees with applications
• Succinct representations of permutations and functions
• Short and simple labels for small distances and other functions
• Random access to grammar-compressed strings and trees
• scientific article; zbMATH DE number 7765383 (Why is no real title available?)

This page was built for publication: Succinct representations of functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466533)