Algorithms – ESA 2004
From MaRDI portal
Publication:5464594
DOI10.1007/b100428zbMath1111.94327MaRDI QIDQ5464594
Publication date: 18 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100428
Related Items
Dynamic Trees with Almost-Optimal Access Cost, Efficient and compact representations of some non-canonical prefix-free codes, Dynamic Shannon coding, Minimax trees in linear time with applications, A fast algorithm for adaptive prefix coding, Worst-Case Optimal Adaptive Prefix Coding