On the public citation graph
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution
0 signed · 60 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/s004930050052openalex-snapshot
Quick Approximation to Matrices and Applications
inferredcites →https://doi.org/10.1007/s11511-008-0032-5openalex-snapshot
The primes contain arbitrarily long polynomial progressions
inferredcites →https://doi.org/10.1023/a:1022949332276openalex-snapshot
Boosting and Hard-Core Set Construction
inferredcites →https://doi.org/10.1109/focs.2007.17openalex-snapshot
Structure and Randomness in Combinatorics
inferredcites →https://doi.org/10.1109/focs.2008.38openalex-snapshot
Dense Subsets of Pseudorandom Sets
inferredcites →https://doi.org/10.1109/sfcs.1982.45openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1995.492584openalex-snapshot
Hard-core distributions for somewhat hard problems
inferredcites →https://doi.org/10.1109/sfcs.2000.892063openalex-snapshot
Extracting randomness from samplable distributions
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1145/1060590.1060689openalex-snapshot
Key agreement from weak bit agreement
inferredcites →https://doi.org/10.4007/annals.2008.167.481openalex-snapshot
The primes contain arbitrarily long arithmetic progressions
inferredcites →https://doi.org/10.4064/aa-27-1-199-245openalex-snapshot
On sets of integers containing k elements in arithmetic progression
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-56784-2_24openalex-snapshot
Amplifying the Security of Functional Encryption, Unconditionally
inferred← citeshttps://doi.org/10.1007/978-3-032-12290-2_9openalex-snapshot
Generalized and Unified Equivalences Between Hardness and Pseudoentropy
inferred← citeshttps://doi.org/10.1007/978-3-319-26617-6_17openalex-snapshot
Efficiently Simulating High Min-entropy Sources in the Presence of Side Information
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_42openalex-snapshot
A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds
inferred← citeshttps://doi.org/10.1007/978-3-319-78372-7_12openalex-snapshot
On the Complexity of Simulating Auxiliary Input
inferred← citeshttps://doi.org/10.1007/978-3-642-14444-8_19openalex-snapshot
Pseudorandomness In Computer Science and In Additive Combinatorics
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_4openalex-snapshot
Dense Model Theorems and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_19openalex-snapshot
Iterative Constructions and Private Data Release
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_23openalex-snapshot
The Inverse Shapley Value Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-40041-4_6openalex-snapshot
A Uniform Min-Max Theorem with Applications in Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-54242-8_24openalex-snapshot
How to Fake Auxiliary Input
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_79openalex-snapshot
Sampling-based proofs of almost-periodicity results and algorithmic applications
inferred← citeshttps://doi.org/10.1007/978-3-662-46494-6_4openalex-snapshot
From Weak to Strong Zero-Knowledge and Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_55openalex-snapshot
A New Approximate Min-Max Theorem with Applications in Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-662-53641-4_7openalex-snapshot
Simulating Auxiliary Inputs, Revisited
inferred← citeshttps://doi.org/10.1007/s00037-015-0120-9openalex-snapshot
A counterexample to the chain rule for conditional HILL entropy
inferred← citeshttps://doi.org/10.1007/s00039-015-0324-9openalex-snapshot
A relative Szemerédi theorem
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.11.003openalex-snapshot
Finite field models in arithmetic combinatorics – ten years on
inferred← citeshttps://doi.org/10.1016/j.geb.2017.06.004openalex-snapshot
The Inverse Shapley value problem
inferred← citeshttps://doi.org/10.1103/physrevlett.122.210502openalex-snapshot
Sample Complexity of Device-Independently Certified “Quantum Supremacy”
inferred← citeshttps://doi.org/10.1109/focs.2011.59openalex-snapshot
Quadratic Goldreich--Levin Theorems
inferred← citeshttps://doi.org/10.1109/focs.2018.00022openalex-snapshot
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
inferred← citeshttps://doi.org/10.1109/focs.2019.00016openalex-snapshot
Learning from Outcomes: Evidence-Based Rankings
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00045openalex-snapshot
A New Minimax Theorem for Randomized Algorithms (Extended Abstract)
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00092openalex-snapshot
The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem
inferred← citeshttps://doi.org/10.1109/tit.2018.2822686openalex-snapshot
The List Decoding Radius for Reed–Muller Codes Over Small Fields
inferred← citeshttps://doi.org/10.1145/1556154.1556169openalex-snapshot
SIGACT news complexity theory column 63
inferred← citeshttps://doi.org/10.1145/1806689.1806691openalex-snapshot
Spectral methods for matrices and tensors
inferred← citeshttps://doi.org/10.1145/2213977.2214043openalex-snapshot
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
inferred← citeshttps://doi.org/10.1145/2590772openalex-snapshot
Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces
inferred← citeshttps://doi.org/10.1145/2676659openalex-snapshot
Advice Lower Bounds for the Dense Model Theorem
inferred← citeshttps://doi.org/10.1145/2746539.2746543openalex-snapshot
The List Decoding Radius of Reed-Muller Codes over Small Fields
inferred← citeshttps://doi.org/10.1145/2746539.2746596openalex-snapshot
Rectangles Are Nonnegative Juntas
inferred← citeshttps://doi.org/10.1145/3406325.3451132openalex-snapshot
Inverse-exponential correlation bounds and extremely rigid matrices from a new derandomized XOR lemma
inferred← citeshttps://doi.org/10.1145/3618260.3649748openalex-snapshot
Complexity-Theoretic Implications of Multicalibration
inferred← citeshttps://doi.org/10.1145/3626514openalex-snapshot
A New Minimax Theorem for Randomized Algorithms
inferred← citeshttps://doi.org/10.1145/3798129.3800891openalex-snapshot
Testing Distributions against Bounded Distinguishers
inferred← citeshttps://doi.org/10.1145/3798129.3800914openalex-snapshot
Provable Long-Range Benefits of Next-Token Prediction
inferred← citeshttps://doi.org/10.1515/9780823295708-025openalex-snapshot
CHAPTER NOTES AND REFERENCES
inferred← citeshttps://doi.org/10.1515/9783110203738.455openalex-snapshot
Chapter 8 Notes and References
inferred← citeshttps://doi.org/10.17169/refubium-28790openalex-snapshot
Sampling and the complexity of nature
inferred← citeshttps://doi.org/10.26421/qic14.15-16-7openalex-snapshot
BosonSampling is far from uniform
inferred← citeshttps://doi.org/10.48550/arxiv.1908.11335openalex-snapshot
Nearly Tight Bounds for Robust Proper Learning of Halfspaces with a Margin
inferred← citeshttps://doi.org/10.48550/arxiv.2105.00765openalex-snapshot
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
inferred← citeshttps://doi.org/10.5040/9780755625963.0007openalex-snapshot
Chapter Notes and References
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.