On the public citation graph

Alphabetic codes revisited

0 signed · 52 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1959.tb01583.xopenalex-snapshot
Variable-Length Binary Encodings
inferredcites →https://doi.org/10.1007/978-1-4842-9459-8_2openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1007/978-3-7091-2945-6openalex-snapshot
Information Theory and Reliable Communication
inferredcites →https://doi.org/10.1016/s0019-9958(77)80011-9openalex-snapshot
An improved bound for weight-balanced tree
inferredcites →https://doi.org/10.1109/18.79933openalex-snapshot
Local redundancy and progressive bounds on the redundancy of a Huffman code
inferredcites →https://doi.org/10.1109/21.105086openalex-snapshot
Application of heuristic search and information theory to sequential fault diagnosis
inferredcites →https://doi.org/10.1109/aiia.1988.13280openalex-snapshot
Circuit pack troubleshooting via semantic control. I. Goal selection
inferredcites →https://doi.org/10.1137/0123019openalex-snapshot
Optimal Binary Identification Procedures

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-82014-4_7openalex-snapshot
Old and New Results on Alphabetic Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_21openalex-snapshot
Efficient Construction of Near-Optimal Binary and Multiway Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_28openalex-snapshot
Minimax Trees in Linear Time with Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_38openalex-snapshot
On the Huffman and Alphabetic Tree Problem with General Cost Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-22555-0_49openalex-snapshot
Performance of Routing Lookups
inferred← citeshttps://doi.org/10.1007/978-3-642-38536-0_4openalex-snapshot
Alphabetic Minimax Trees in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_7openalex-snapshot
Optimal Search Trees with 2-Way Comparisons
inferred← citeshttps://doi.org/10.1007/s00453-013-9755-6openalex-snapshot
On the Huffman and Alphabetic Tree Problem with General Cost Functions
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90212-ropenalex-snapshot
On binary search trees
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00193-3openalex-snapshot
Characteristic inequalities for binary trees
inferred← citeshttps://doi.org/10.1016/0306-4573(94)90004-3openalex-snapshot
Codes with monotonic codeword lengths
inferred← citeshttps://doi.org/10.1016/b978-012620861-0/50005-xopenalex-snapshot
Huffman Coding
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.07.016openalex-snapshot
Minimax trees in linear time with applications
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.07.031openalex-snapshot
Operations research applications of dichotomous search
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104707openalex-snapshot
On the cost of unsuccessful searches in search trees with two-way comparisons
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.08.012openalex-snapshot
Assembling approximately optimal binary search trees efficiently using arithmetics
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.11.008openalex-snapshot
Alphabetic coding with exponential costs
inferred← citeshttps://doi.org/10.1016/j.ipl.2026.106640openalex-snapshot
Optimal average-case binary search with outcome-dependent costs
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00320-9openalex-snapshot
Optimal binary search trees
inferred← citeshttps://doi.org/10.1080/07408170490426206openalex-snapshot
An upper bound on the weight-balanced testing procedure with multiple testers
inferred← citeshttps://doi.org/10.1109/18.370098openalex-snapshot
Minimum average cost testing for partially ordered components
inferred← citeshttps://doi.org/10.1109/18.79933openalex-snapshot
Local redundancy and progressive bounds on the redundancy of a Huffman code
inferred← citeshttps://doi.org/10.1109/18.904513openalex-snapshot
Some basic properties of fix-free codes
inferred← citeshttps://doi.org/10.1109/21.297798openalex-snapshot
On noiseless diagnosis
inferred← citeshttps://doi.org/10.1109/dcc.1993.253145openalex-snapshot
Codes with monotonic codeword lengths
inferred← citeshttps://doi.org/10.1109/dcc.1995.515508openalex-snapshot
An efficient variable length coding scheme for an IID source
inferred← citeshttps://doi.org/10.1109/dcc.1999.755661openalex-snapshot
Software synthesis of variable-length code decoder using a mixture of programmed logic and table lookups
inferred← citeshttps://doi.org/10.1109/eeei.2002.1178303openalex-snapshot
An upper bound of the weight-balanced testing procedure with multiple testers
inferred← citeshttps://doi.org/10.1109/infcom.2000.832490openalex-snapshot
Near-optimal routing lookups with bounded worst case performance
inferred← citeshttps://doi.org/10.1109/isit.2006.262027openalex-snapshot
Rényi to Rényi ¿ Source Coding under Siege
inferred← citeshttps://doi.org/10.1109/isit.2007.4557274openalex-snapshot
Entropy with Limited Computation Resources
inferred← citeshttps://doi.org/10.1109/isit.2018.8437915openalex-snapshot
Alphabetic AIFV Codes Constructed from Hu- Tucker codes
inferred← citeshttps://doi.org/10.1109/itnw.1999.814366openalex-snapshot
Basic properties of fix-free codes
inferred← citeshttps://doi.org/10.1109/sequen.1997.666911openalex-snapshot
Code and parse trees for lossless source encoding
inferred← citeshttps://doi.org/10.1109/tit.2004.838345openalex-snapshot
Near-Optimal Depth-Constrained Codes
inferred← citeshttps://doi.org/10.1109/tit.2007.909161openalex-snapshot
Kraft Inequality and Zero-Error Source Coding With Decoder Side Information
inferred← citeshttps://doi.org/10.1109/tit.2024.3428699openalex-snapshot
Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
inferred← citeshttps://doi.org/10.1201/9780849380587.ch6openalex-snapshot
Efficient Data Structures for Bursty Access Patterns
inferred← citeshttps://doi.org/10.4230/lipics.esa.2018.38openalex-snapshot
Dynamic Trees with Almost-Optimal Access Cost
inferred← citeshttps://doi.org/10.48550/arxiv.0812.2868openalex-snapshot
Minimax Trees in Linear Time
inferred← citeshttps://doi.org/10.48550/arxiv.2012.13698openalex-snapshot
Arithmetic Binary Search Trees: Static Optimality in the Matching Model
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0602067openalex-snapshot
Renyi to Renyi -- Source Coding under Siege
inferred← citeshttps://doi.org/10.5555/313651.313812openalex-snapshot
Splay trees for data compression
inferred← citeshttps://doi.org/10.5555/365411.365796openalex-snapshot
On binary searching with non-uniform costs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.