Compressed depth sequences (Q1006078): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.11.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056117079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restructuring ordered binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for the Construction of Minimum-Redundancy Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Computer Search Trees and Variable-Length Alphabetical Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Huffman codes and self-information / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Bound for The Weighted Path Length of Binary Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:27, 29 June 2024

scientific article
Language Label Description Also known as
English
Compressed depth sequences
scientific article

    Statements