Compressed depth sequences

DOI10.1016/J.TCS.2008.11.003zbMath1165.68026OpenAlexW2056117079MaRDI QIDQ1006078

Travis Gagie

Publication date: 17 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.11.003

zbMATH Keywords

data compressiondata structures

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Cites Work

• A Mathematical Theory of Communication
• Huffman codes and self-information
• A Best Possible Bound for The Weighted Path Length of Binary Search Trees
• Restructuring ordered binary trees
• A Method for the Construction of Minimum-Redundancy Codes
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes

This page was built for publication: Compressed depth sequences