On the public citation graph
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
0 signed · 73 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.1002/(sici)1098-2418(199712)11:4<345::aid-rsa4>3.0.co;2-zopenalex-snapshot
Randomness-optimal oblivious sampling
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-0-387-49820-1openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/978-1-4757-2606-0openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/978-3-540-31856-9_34openalex-snapshot
Increasing Kolmogorov Complexity
inferredcites →https://doi.org/10.1007/978-3-642-03073-4_51openalex-snapshot
On Generating Independent Random Strings
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.1016/0022-0000(92)90020-jopenalex-snapshot
Almost everywhere high nonuniform complexity
inferredcites →https://doi.org/10.1016/j.aim.2010.06.024openalex-snapshot
Extracting information is hard: A Turing degree of non-integral effective Hausdorff dimension
inferredcites →https://doi.org/10.1016/j.ipl.2005.05.001openalex-snapshot
Resource-bounded strong dimension versus resource-bounded category
inferredcites →https://doi.org/10.1016/s0020-0190(02)00343-5openalex-snapshot
A Kolmogorov complexity characterization of constructive Hausdorff dimension
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.1016/s0890-5401(03)00187-1openalex-snapshot
The dimensions of individual strings and sequences
inferredcites →https://doi.org/10.1109/focs.2004.29openalex-snapshot
Extracting Randomness Using Few Independent Sources
inferredcites →https://doi.org/10.1109/sfcs.1984.715945openalex-snapshot
Generating Quasi-Random Sequences From Slightly-Random Sources
inferredcites →https://doi.org/10.1109/sfcs.1985.62openalex-snapshot
Unbiased bits from sources of weak randomness and probabilistic communication complexity
inferredcites →https://doi.org/10.1109/sfcs.2000.892008openalex-snapshot
Extracting randomness via repeated condensing
inferredcites →https://doi.org/10.1109/sfcs.2001.959940openalex-snapshot
Extractors from Reed-Muller codes
inferredcites →https://doi.org/10.1109/sfcs.2001.959941openalex-snapshot
Simple extractors for all min-entropies and a new pseudo-random generator
inferredcites →https://doi.org/10.1137/s0097539701417723openalex-snapshot
Dimension in Complexity Classes
inferredcites →https://doi.org/10.1137/s0097539703446912openalex-snapshot
Effective Strong Dimension in Algorithmic Information and Computational Complexity
inferredcites →https://doi.org/10.1137/s009753979630091xopenalex-snapshot
Computing with Very Weak Random Sources
inferredcites →https://doi.org/10.1145/1059513.1059516openalex-snapshot
Simple extractors for all min-entropies and a new pseudorandom generator
inferredcites →https://doi.org/10.1145/1060590.1060593openalex-snapshot
Extractors with weak random seeds
inferredcites →https://doi.org/10.1145/1086649.1086662openalex-snapshot
SIGACT news complexity theory column 48
inferredcites →https://doi.org/10.1145/1132516.1132589openalex-snapshot
Extractors for a constant number of polynomially small min-entropy independent sources
inferredcites →https://doi.org/10.1145/502090.502099openalex-snapshot
Extractors and pseudorandom generators
inferredcites →https://doi.org/10.2178/bsl/1154698740openalex-snapshot
Randomness and Computability: Open Questions
inferredcites →https://doi.org/10.31274/rtd-180813-160openalex-snapshot
Effective fractal dimension: foundations and applications
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-59671-2_6openalex-snapshot
The Algorithmic Basis of Spatial Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_7openalex-snapshot
Constructive Dimension and Weak Truth-Table Degrees
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_33openalex-snapshot
Two Sources Are Better Than One for Increasing the Kolmogorov Complexity of Infinite Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_51openalex-snapshot
On Generating Independent Random Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_60openalex-snapshot
Counting Dependent and Independent Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_61openalex-snapshot
Impossibility of Independence Amplification in Kolmogorov Complexity Theory
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-007-9024-7openalex-snapshot
Dimension Extractors and Optimal Decompression
inferred← citeshttps://doi.org/10.1007/s00224-009-9170-1openalex-snapshot
Constructive Dimension and Turing Degrees
inferred← citeshttps://doi.org/10.1007/s00224-009-9214-6openalex-snapshot
Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences
inferred← citeshttps://doi.org/10.1007/s00224-014-9563-7openalex-snapshot
On Extracting Space-bounded Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1016/j.aim.2010.06.024openalex-snapshot
Extracting information is hard: A Turing degree of non-integral effective Hausdorff dimension
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.09.031openalex-snapshot
Dimension 1 sequences are close to randoms
inferred← citeshttps://doi.org/10.1017/9781108781718.010openalex-snapshot
Resource bounded randomness and its applications
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.005openalex-snapshot
Computability theory, algorithmic randomness and Turing's anticipation
inferred← citeshttps://doi.org/10.1017/jsl.2017.78openalex-snapshot
AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES
inferred← citeshttps://doi.org/10.1090/tran/7972openalex-snapshot
Optimal bounds for single-source Kolmogorov extractors
inferred← citeshttps://doi.org/10.1093/logcom/exr053openalex-snapshot
Generating Kolmogorov random strings from sources with limited independence
inferred← citeshttps://doi.org/10.1109/ccc.2011.21openalex-snapshot
Symmetry of Information and Bounds on Nonuniform Randomness Extraction via 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.1145/1907450.1907540openalex-snapshot
SIGACT news complexity theory column 68
inferred← citeshttps://doi.org/10.1145/2003685.2003686openalex-snapshot
Kolmogorov Complexity in Randomness Extraction
inferred← citeshttps://doi.org/10.1215/00294527-2010-017openalex-snapshot
Effective Packing Dimension and Traceability
inferred← citeshttps://doi.org/10.1215/00294527-3328401openalex-snapshot
Controlling Effective Packing Dimension of Δ20 Degrees
inferred← citeshttps://doi.org/10.2178/jsl/1333566632openalex-snapshot
A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one
inferred← citeshttps://doi.org/10.3233/fi-2014-1027openalex-snapshot
Counting Dependent and Independent Strings
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2009.1812openalex-snapshot
Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence
inferred← citeshttps://doi.org/10.48550/arxiv.0705.4658openalex-snapshot
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1104.0872openalex-snapshot
Possibilities and impossibilities in Kolmogorov complexity extraction
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
inferred← citeshttps://doi.org/10.48550/arxiv.1206.5184openalex-snapshot
Symmetry of Information: A Closer Look
inferred← citeshttps://doi.org/10.7282/t35d8qvqopenalex-snapshot
On circuit complexity classes and iterated matrix multiplication
showing the first 39 of 40 · page through all 40
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.