Searching and encoding for infinite ordered sets

DOI10.1007/BF00993200MaRDI QIDQ3933757zbMATH OpenFDO

Authors Q. F. Stout

Publication date 1982

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

infinite setslinear orderprefix codessearch codesunbounded search

Mathematics Subject Classification ID

Searching and sorting (68P10) Prefix, length-variable, comma-free codes (94A45)

Cites work

• An almost optimal algorithm for unbounded searching
• An Efficient Method for Storing Ancestor Information in Trees
• Economical encoding of commas between strings
• Efficient search for rationals
• scientific article; zbMATH DE number 3470417 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3521877 (Why is no real title available?)
• scientific article; zbMATH DE number 3316587 (Why is no real title available?)
• Improved prefix encodings of the natural numbers (Corresp.)
• Linear Algorithm for Data Compression via String Matching
• On computing distances between leaves in a complete tree
• On Finding Lowest Common Ancestors in Trees
• Optimal source codes for geometrically distributed integer alphabets (Corresp.)
• Rational search
• Run-length encodings (Corresp.)
• Sources which maximize the choice of a Huffman coding tree
• The asymptotic number of solutions of a diophantine equation from coding theory
• Universal codeword sets and representations of the integers

This page was built for publication: Searching and encoding for infinite ordered sets

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