On the public citation graph
Linear List-Approximation for Short Programs (or the Power of a Few Random Bits)
0 signed · 31 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-0-387-68441-3openalex-snapshot
Algorithmic Randomness and Complexity
inferredcites →https://doi.org/10.1007/978-3-319-08019-2_42openalex-snapshot
Short Lists with Short Programs in Short Time – A Short Proof
inferredcites →https://doi.org/10.1007/s00037-014-0090-3openalex-snapshot
Short lists for shortest descriptions in short time
inferredcites →https://doi.org/10.1016/0304-3975(76)90005-0openalex-snapshot
Information-theoretic characterizations of recursive infinite strings
inferredcites →https://doi.org/10.1016/j.ic.2016.12.008openalex-snapshot
Diagonally non-computable functions and fireworks
inferredcites →https://doi.org/10.1070/rm1970v025n06abeh001269openalex-snapshot
THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
inferredcites →https://doi.org/10.1109/9780470544242.ch54openalex-snapshot
Computability by Probabilistic Machines
inferredcites →https://doi.org/10.1109/ccc.2013.19openalex-snapshot
Short Lists with Short Programs in Short Time
inferredcites →https://doi.org/10.1137/0217015openalex-snapshot
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
inferredcites →https://doi.org/10.1137/s009753979834388xopenalex-snapshot
Resource-Bounded Kolmogorov Complexity Revisited
inferredcites →https://doi.org/10.1137/s0895480197329508openalex-snapshot
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
inferredcites →https://doi.org/10.1145/1538902.1538904openalex-snapshot
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
inferredcites →https://doi.org/10.1145/301250.301294openalex-snapshot
On recycling the randomness of states in space bounded computation
inferredcites →https://doi.org/10.1515/9781400882618-010openalex-snapshot
Computability by Probabilistic Machines
inferredcites →https://doi.org/10.2178/jsl/1146620156openalex-snapshot
Enumerations of the Kolmogorov function
inferredcites →https://doi.org/10.3233/fi-2014-1029openalex-snapshot
Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma
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-319-08019-2_42openalex-snapshot
Short Lists with Short Programs in Short Time – A Short Proof
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.08.001openalex-snapshot
Enumerations including laconic enumerators
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.011openalex-snapshot
Searching for shortest and least programs
inferred← citeshttps://doi.org/10.1109/tit.2019.2896638openalex-snapshot
Compression of Data Streams Down to Their Information Content
inferred← citeshttps://doi.org/10.1145/2799561openalex-snapshot
On Approximate Decidability of Minimal Programs
inferred← citeshttps://doi.org/10.1145/2902945.2902956openalex-snapshot
SIGACT News Complexity Theory Column 90
inferred← citeshttps://doi.org/10.1145/2902945.2902957openalex-snapshot
A Brief on Short Descriptions
inferred← citeshttps://doi.org/10.1145/3055399.3055421openalex-snapshot
Kolmogorov complexity version of Slepian-Wolf coding
inferred← citeshttps://doi.org/10.1145/3356867openalex-snapshot
An Operational Characterization of Mutual Information in Algorithmic Information Theory
inferred← citeshttps://doi.org/10.1145/3510382.3510389openalex-snapshot
27 Open Problems in Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1145/3575807openalex-snapshot
Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time
inferred← citeshttps://doi.org/10.3390/axioms10040334openalex-snapshot
List Approximation for Increasing Kolmogorov Complexity
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2020.21openalex-snapshot
Secret Key Agreement from Correlated Data, with No Prior Information
inferred← citeshttps://doi.org/10.48550/arxiv.1802.00750openalex-snapshot
Optimal probabilistic polynomial time compression and the Slepian-Wolf theorem: tighter version and simple proofs
inferred← citeshttps://doi.org/10.48550/arxiv.2007.02330openalex-snapshot
Universal codes in the shared-randomness model for channels with general distortion capabilities
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.