On the public citation graph

Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov Extractors

0 signed · 22 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.1007/11786986_30openalex-snapshot
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
inferredcites →https://doi.org/10.1007/978-1-4757-3860-5openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/978-3-030-11298-1openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
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/s00037-013-0076-6openalex-snapshot
Randomness Buys Depth for Approximate Counting
inferredcites →https://doi.org/10.1016/s0022-0000(05)80043-1openalex-snapshot
Hardness vs randomness
inferredcites →https://doi.org/10.1016/s0304-3975(01)00036-6openalex-snapshot
Independent minimum length programs to translate between given strings
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.1090/dimacs/013/01openalex-snapshot
Approximate counting with uniform constant depth circuits
inferredcites →https://doi.org/10.11588/heidok.00005543openalex-snapshot
Computability and Fractal Dimension
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2009.2320openalex-snapshot
Kolmogorov Complexity in Randomness Extraction
inferredcites →https://doi.org/10.48550/arxiv.1104.0872openalex-snapshot
Possibilities and impossibilities in Kolmogorov complexity extraction

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-642-22953-4_6openalex-snapshot
On the Optimal Compression of Sets in PSPACE
inferred← citeshttps://doi.org/10.1007/978-3-642-27654-5_18openalex-snapshot
Symmetry of Information: A Closer Look
inferred← citeshttps://doi.org/10.1007/978-3-642-30642-6_25openalex-snapshot
Space-Bounded Kolmogorov Extractors
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-012-9432-1openalex-snapshot
Improving the Space-Bounded Version of Muchnik’s Conditional Complexity Theorem via “Naive” Derandomization
inferred← citeshttps://doi.org/10.1007/s00224-014-9563-7openalex-snapshot
On Extracting Space-bounded Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1090/tran/7972openalex-snapshot
Optimal bounds for single-source Kolmogorov extractors
inferred← citeshttps://doi.org/10.1109/ccc.2013.19openalex-snapshot
Short Lists with Short Programs in Short Time
inferred← citeshttps://doi.org/10.48550/arxiv.1203.3674openalex-snapshot
Space-Bounded Kolmogorov Extractors
inferred← citeshttps://doi.org/10.48550/arxiv.1204.6696openalex-snapshot
Nonuniform Kolmogorov extractors
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.