Searching and encoding for infinite ordered sets
From MaRDI portal
Publication:3933757
DOI10.1007/BF00993200zbMath0477.68064MaRDI QIDQ3933757
Publication date: 1982
Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The asymptotic number of solutions of a diophantine equation from coding theory
- An almost optimal algorithm for unbounded searching
- Rational search
- Efficient search for rationals
- An Efficient Method for Storing Ancestor Information in Trees
- On computing distances between leaves in a complete tree
- Improved prefix encodings of the natural numbers (Corresp.)
- Sources which maximize the choice of a Huffman coding tree
- Linear Algorithm for Data Compression via String Matching
- Universal codeword sets and representations of the integers
- Optimal source codes for geometrically distributed integer alphabets (Corresp.)
- On Finding Lowest Common Ancestors in Trees
- Economical encoding of commas between strings
- Run-length encodings (Corresp.)
This page was built for publication: Searching and encoding for infinite ordered sets