On the public citation graph
Short Lists with Short Programs in Short Time
0 signed · 47 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/11786986_30openalex-snapshot
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
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/978-3-642-03073-4_49openalex-snapshot
Algorithmic Minimal Sufficient Statistic Revisited
inferredcites →https://doi.org/10.1007/978-3-642-20712-9_6openalex-snapshot
Improving the Space-Bounded Version of Muchnik’s Conditional Complexity Theorem via “Naive” Derandomization
inferredcites →https://doi.org/10.1007/978-3-642-30870-3_66openalex-snapshot
Game Arguments in Computability Theory and Algorithmic Information Theory
inferredcites →https://doi.org/10.1007/978-3-642-31594-7_9openalex-snapshot
Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity
inferredcites →https://doi.org/10.1007/bf01762189openalex-snapshot
Optimal enumerations and optimal gödel numberings
inferredcites →https://doi.org/10.1007/s00037-005-0198-6openalex-snapshot
Compression of Samplable Sources
inferredcites →https://doi.org/10.1007/s00037-014-0090-3openalex-snapshot
Short lists for shortest descriptions in short time
inferredcites →https://doi.org/10.1007/s00224-009-9214-6openalex-snapshot
Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences
inferredcites →https://doi.org/10.1007/s00224-011-9321-zopenalex-snapshot
Variations on Muchnik’s Conditional Complexity Theorem
inferredcites →https://doi.org/10.1007/s00493-007-0053-2openalex-snapshot
Lossless Condensers, Unbalanced Expanders, And Extractors
inferredcites →https://doi.org/10.1016/s0304-3975(01)00033-0openalex-snapshot
Conditional complexity and codes
inferredcites →https://doi.org/10.1017/jsl.2014.15openalex-snapshot
COMPLEXITY OF COMPLEXITY AND STRINGS WITH MAXIMAL PLAIN AND PREFIX KOLMOGOROV COMPLEXITY
inferredcites →https://doi.org/10.1093/logcom/exr053openalex-snapshot
Generating Kolmogorov random strings from sources with limited independence
inferredcites →https://doi.org/10.1109/ccc.2011.21openalex-snapshot
Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov Extractors
inferredcites →https://doi.org/10.1112/jlms/s1-10.37.26openalex-snapshot
On Representatives of Subsets
inferredcites →https://doi.org/10.1137/s0097539703431032openalex-snapshot
Extracting Randomness via Repeated Condensing
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/1814370.1814391openalex-snapshot
Structure and algorithms in the SINR wireless model
inferredcites →https://doi.org/10.1145/2003685.2003686openalex-snapshot
Kolmogorov Complexity in Randomness Extraction
inferredcites →https://doi.org/10.1145/509907.510003openalex-snapshot
Randomness conductors and constant-degree lossless expanders
inferredcites →https://doi.org/10.1145/800061.808762openalex-snapshot
A complexity theoretic approach to randomness
inferredcites →https://doi.org/10.2178/jsl/1146620156openalex-snapshot
Enumerations of the Kolmogorov function
inferredcites →https://doi.org/10.2307/1970579openalex-snapshot
On Some Games Which Are Relevant to the Theory of Recursively Enumerable Sets
inferredcites →https://doi.org/10.48550/arxiv.1003.4712openalex-snapshot
Game interpretation of Kolmogorov complexity
inferredcites →https://doi.org/10.48550/arxiv.1104.0872openalex-snapshot
Possibilities and impossibilities in Kolmogorov complexity extraction
inferredcites →https://doi.org/10.48550/arxiv.1203.3674openalex-snapshot
Space-Bounded Kolmogorov Extractors
inferredcites →https://doi.org/10.48550/arxiv.1204.0198openalex-snapshot
Game arguments in computability theory and algorithmic information theory
inferredcites →https://doi.org/10.48550/arxiv.1204.6696openalex-snapshot
Nonuniform Kolmogorov extractors
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-030-22996-2_20openalex-snapshot
On Approximate Uncomputability of the Kolmogorov Complexity Function
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.1007/978-3-642-39053-1_50openalex-snapshot
On Algorithmic Strong Sufficient Statistics
inferred← citeshttps://doi.org/10.1007/s00037-014-0090-3openalex-snapshot
Short lists for shortest descriptions in short time
inferred← citeshttps://doi.org/10.1007/s00037-017-0154-2openalex-snapshot
Short lists with short programs in short time
inferred← citeshttps://doi.org/10.1007/s00224-014-9535-yopenalex-snapshot
On Optimal Language Compression for Sets in PSPACE/poly
inferred← citeshttps://doi.org/10.1007/s00224-014-9605-1openalex-snapshot
Algorithmic Minimal Sufficient Statistics: a New Approach
inferred← citeshttps://doi.org/10.1007/s00224-015-9606-8openalex-snapshot
Topological Arguments for Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1007/s00224-016-9695-zopenalex-snapshot
Some Properties of Antistochastic Strings
inferred← citeshttps://doi.org/10.1007/s00224-017-9773-xopenalex-snapshot
Short lists with short programs from programs of functions and strings
inferred← citeshttps://doi.org/10.1109/ccc.2014.32openalex-snapshot
Linear List-Approximation for Short Programs (or the Power of a Few Random Bits)
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/2902945.2902957openalex-snapshot
A Brief on Short Descriptions
inferred← citeshttps://doi.org/10.3390/axioms10040334openalex-snapshot
List Approximation for Increasing Kolmogorov Complexity
inferred← citeshttps://doi.org/10.3390/e22040408openalex-snapshot
How Incomputable Is Kolmogorov Complexity?
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.