On the public citation graph

Extracting all the Randomness and Reducing the Error in Trevisan's Extractors

0 signed · 125 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.1002/(sici)1098-2418(199712)11:4<315::aid-rsa3>3.0.co;2-1openalex-snapshot
Tiny families of functions with random properties: A quality-size trade-off for hashing
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.1006/jcss.1996.0004openalex-snapshot
Randomness is Linear in Space
inferredcites →https://doi.org/10.1007/3-540-63165-8_175openalex-snapshot
Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs
inferredcites →https://doi.org/10.1007/bf01940870openalex-snapshot
Simulating BPP using a general weak random source
inferredcites →https://doi.org/10.1007/bf02579325openalex-snapshot
Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
inferredcites →https://doi.org/10.1007/bf02772959openalex-snapshot
Families of finite sets in which no set is covered by the union ofr others
inferredcites →https://doi.org/10.1007/s004930050049openalex-snapshot
Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications
inferredcites →https://doi.org/10.1016/0022-0000(86)90044-9openalex-snapshot
Generating quasi-random sequences from semi-random sources
inferredcites →https://doi.org/10.1016/0022-0000(88)90035-9openalex-snapshot
Expanders, randomness, or time versus space
inferredcites →https://doi.org/10.1016/s0022-0000(05)80043-1openalex-snapshot
Hardness vs randomness
inferredcites →https://doi.org/10.1016/s0195-6698(85)80023-8openalex-snapshot
On a Packing and Covering Problem
inferredcites →https://doi.org/10.1109/ccc.1996.507667openalex-snapshot
Extracting randomness: how and why. A survey
inferredcites →https://doi.org/10.1109/ccc.1999.766253openalex-snapshot
Pseudorandom generators without the XOR lemma
inferredcites →https://doi.org/10.1109/sfcs.1982.45openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1985.45openalex-snapshot
Random polynomial time is equal to slightly-random polynomial time
inferredcites →https://doi.org/10.1109/sfcs.1989.63449openalex-snapshot
Dispersers, deterministic amplification, and weak random sources
inferredcites →https://doi.org/10.1109/sfcs.1994.365688openalex-snapshot
Computing with very weak random sources
inferredcites →https://doi.org/10.1109/sfcs.1995.492485openalex-snapshot
Learning Polynomials with Queries: The Highly Noisy Case
inferredcites →https://doi.org/10.1109/sfcs.1997.646148openalex-snapshot
Tight bounds for depth-two superconcentrators
inferredcites →https://doi.org/10.1109/sfcs.1998.743508openalex-snapshot
Perfect information leader election in log*n+O(1) rounds
inferredcites →https://doi.org/10.1109/sfcs.2000.892008openalex-snapshot
Extracting randomness via repeated condensing
inferredcites →https://doi.org/10.1109/sffcs.1999.814591openalex-snapshot
Error reduction for extractors
inferredcites →https://doi.org/10.1109/sffcs.1999.814619openalex-snapshot
Hardness of approximating Σ/sub 2//sup p/ minimization problems
inferredcites →https://doi.org/10.1137/0216066openalex-snapshot
Sorting and Selecting in Rounds
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/s0097539796302531openalex-snapshot
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
inferredcites →https://doi.org/10.1145/237814.237877openalex-snapshot
On extracting randomness from weak random sources (extended abstract)
inferredcites →https://doi.org/10.1145/258533.258590openalex-snapshot
P = BPP if E requires exponential circuits
inferredcites →https://doi.org/10.1145/273865.273915openalex-snapshot
Explicit OR-dispersers with polylogarithmic degree
inferredcites →https://doi.org/10.1145/276698.276736openalex-snapshot
Almost optimal dispersers
inferredcites →https://doi.org/10.1145/28395.28413openalex-snapshot
Efficiency considerations in using semi-random sources
inferredcites →https://doi.org/10.1145/301250.301289openalex-snapshot
Construction of extractors using pseudo-random generators (extended abstract)
inferredcites →https://doi.org/10.1145/301250.301292openalex-snapshot
Extracting all the randomness and reducing the error in Trevisan's extractors
inferredcites →https://doi.org/10.1145/301250.301294openalex-snapshot
On recycling the randomness of states in space bounded computation
inferredcites →https://doi.org/10.1145/335305.335306openalex-snapshot
Extractors and pseudo-random generators with optimal seed length
inferredcites →https://doi.org/10.1145/380752.380790openalex-snapshot
Loss-less condensers, unbalanced expanders, and extractors
inferredcites →https://doi.org/10.1145/73007.73009openalex-snapshot
Pseudo-random generation from one-way functions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.20257openalex-snapshot
Dispersing hash functions
inferred← citeshttps://doi.org/10.1002/rsa.v35:1openalex-snapshot
inferred← citeshttps://doi.org/10.1007/11818175_25openalex-snapshot
Random Selection with an Adversarial Majority
inferred← citeshttps://doi.org/10.1007/978-3-030-64840-4_22openalex-snapshot
Cryptography from One-Way Communication: On Completeness of Finite Channels
inferred← citeshttps://doi.org/10.1007/978-3-031-15802-5_7openalex-snapshot
Short Leakage Resilient and Non-malleable Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-031-22318-1_12openalex-snapshot
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-031-24475-9_6openalex-snapshot
The Novel Multi Source Method for the Randomness Extraction
inferred← citeshttps://doi.org/10.1007/978-3-540-27821-4_30openalex-snapshot
Improved Randomness Extraction from Two Independent Sources
inferred← citeshttps://doi.org/10.1007/978-3-540-45198-3_18openalex-snapshot
Computational Analogues of Entropy
inferred← citeshttps://doi.org/10.1007/978-3-642-02094-0_12openalex-snapshot
Multicast Routing and Design of Sparse Connectors
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_5openalex-snapshot
Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_2openalex-snapshot
An Introduction to Randomness Extractors
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_53openalex-snapshot
Capacity Achieving Two-Write WOM Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_47openalex-snapshot
Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors
inferred← citeshttps://doi.org/10.1007/978-3-642-33704-8_5openalex-snapshot
Optimization of Key Distribution Protocols Based on Extractors for Noisy Channels within Active Adversaries
inferred← citeshttps://doi.org/10.1007/s00037-004-0182-6openalex-snapshot
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1007/s00037-005-0199-5openalex-snapshot
Language compression and pseudorandom generators
inferred← citeshttps://doi.org/10.1007/s00037-019-00188-1openalex-snapshot
On Derandomized Composition of Boolean Functions
inferred← citeshttps://doi.org/10.1007/s00145-003-0237-xopenalex-snapshot
Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model
inferred← citeshttps://doi.org/10.1007/s00145-008-9035-9openalex-snapshot
Non-interactive Timestamping in the Bounded-Storage Model
inferred← citeshttps://doi.org/10.1007/s00224-012-9425-0openalex-snapshot
Pseudo-Random Graphs and Bit Probe Schemes with One-Sided Error
inferred← citeshttps://doi.org/10.1007/s00493-008-2259-3openalex-snapshot
Deterministic extractors for affine sources over large fields
inferred← citeshttps://doi.org/10.1007/s10773-026-06369-3openalex-snapshot
Interferometric Quantum Random Number Generation via Michelson Configuration
inferred← citeshttps://doi.org/10.1007/s11390-005-0735-4openalex-snapshot
Progress in Computational Complexity Theory
inferred← citeshttps://doi.org/10.1016/j.dam.2012.07.022openalex-snapshot
Noise-resilient group testing: Limitations and constructions
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.06.014openalex-snapshot
Deterministic extractors for small-space sources
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.017openalex-snapshot
Resource bounded symmetry of information revisited
inferred← citeshttps://doi.org/10.1080/03610918.2012.725143openalex-snapshot
Proved Random Numbers Obtained from Hardware Devices
inferred← citeshttps://doi.org/10.1088/1555-6611/ac5cccopenalex-snapshot
Homodyne detection in quantum optics: deterministic extractors and quantum random number generators on ‘vacuum fluctuations’
inferred← citeshttps://doi.org/10.1103/physreva.87.062327openalex-snapshot
Postprocessing for quantum random-number generators: Entropy evaluation and randomness extraction
inferred← citeshttps://doi.org/10.1103/physreva.94.022305openalex-snapshot
Completely device-independent quantum key distribution
inferred← citeshttps://doi.org/10.1103/physrevlett.113.140501openalex-snapshot
Fully Device-Independent Quantum Key Distribution
inferred← citeshttps://doi.org/10.1109/allerton.2010.5707017openalex-snapshot
Derandomization and group testing
inferred← citeshttps://doi.org/10.1109/ccc.2009.36openalex-snapshot
Extractors for Low-Weight Affine Sources
inferred← citeshttps://doi.org/10.1109/ccc.2011.26openalex-snapshot
Improved Constructions of Three Source Extractors
inferred← citeshttps://doi.org/10.1109/eeei.2014.7005791openalex-snapshot
Randomness extractors and data storage
inferred← citeshttps://doi.org/10.1109/focs.2011.20openalex-snapshot
Extractors for Circuit Sources
inferred← citeshttps://doi.org/10.1109/focs.2012.26openalex-snapshot
Non-malleable Extractors, Two-Source Extractors and Privacy Amplification
inferred← citeshttps://doi.org/10.1109/focs.2016.26openalex-snapshot
Improved Two-Source Extractors, and Affine Extractors for Polylogarithmic Entropy
inferred← citeshttps://doi.org/10.1109/focs.2018.00032openalex-snapshot
Non-Black-Box Worst-Case to Average-Case Reductions within NP
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00067openalex-snapshot
Affine Extractors for Almost Logarithmic Entropy
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00030openalex-snapshot
Optimal Coding for Randomized Kolmogorov Complexity and Its Applications
inferred← citeshttps://doi.org/10.1109/iisa.2014.6878717openalex-snapshot
Wire-tap channel concept in nature and society
inferred← citeshttps://doi.org/10.1109/isit.2009.5205583openalex-snapshot
Invertible extractors and wiretap protocols
inferred← citeshttps://doi.org/10.1109/isit.2009.5205931openalex-snapshot
Capacity achieving codes From randomness conductors
inferred← citeshttps://doi.org/10.1109/sfcs.2005.31openalex-snapshot
Deterministic Extractors for Affine Sources over Large Fields
inferred← citeshttps://doi.org/10.1109/tit.2008.921689openalex-snapshot
Key Distribution Protocols Based on Noisy Channels in Presence of an Active Adversary: Conventional and New Versions With Parameter Optimization
inferred← citeshttps://doi.org/10.1109/tit.2011.2170660openalex-snapshot
Invertible Extractors and Wiretap Protocols
inferred← citeshttps://doi.org/10.1109/tit.2013.2251455openalex-snapshot
New Constructions of WOM Codes Using the Wozencraft Ensemble
inferred← citeshttps://doi.org/10.1109/tit.2013.2294464openalex-snapshot
Capacity-Achieving Multiwrite WOM Codes
inferred← citeshttps://doi.org/10.1109/tit.2025.3605160openalex-snapshot
Nearly-Linear Time Seeded Extractors With Short Seeds
inferred← citeshttps://doi.org/10.1137/060671218openalex-snapshot
Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
inferred← citeshttps://doi.org/10.1137/100783704openalex-snapshot
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
inferred← citeshttps://doi.org/10.1137/100805005openalex-snapshot
Position-Based Cryptography
inferred← citeshttps://doi.org/10.1137/100813683openalex-snapshot
Trevisan's Extractor in the Presence of Quantum Side Information
inferred← citeshttps://doi.org/10.1137/18m1176622openalex-snapshot
Nonmalleable Extractors and Codes, with Their Many Tampered Extensions
inferred← citeshttps://doi.org/10.1137/19m124705xopenalex-snapshot
Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\)
inferred← citeshttps://doi.org/10.1137/s0097539703431032openalex-snapshot
Extracting Randomness via Repeated Condensing
inferred← citeshttps://doi.org/10.1145/1059513.1059516openalex-snapshot
Simple extractors for all min-entropies and a new pseudorandom generator
inferred← citeshttps://doi.org/10.1145/1132516.1132589openalex-snapshot
Extractors for a constant number of polynomially small min-entropy independent sources
inferred← citeshttps://doi.org/10.1145/1538902.1538904openalex-snapshot
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
inferred← citeshttps://doi.org/10.1145/1806689.1806713openalex-snapshot
Near-optimal extractors against quantum storage
inferred← citeshttps://doi.org/10.1145/2141938.2141941openalex-snapshot
Extractors and Lower Bounds for Locally Samplable Sources
inferred← citeshttps://doi.org/10.1145/2213977.2214052openalex-snapshot
Design extractors, non-malleable condensers and privacy amplification
inferred← citeshttps://doi.org/10.1145/2897518.2897528openalex-snapshot
Explicit two-source extractors and resilient functions
inferred← citeshttps://doi.org/10.1145/2897518.2897547openalex-snapshot
Non-malleable extractors and codes, with their many tampered extensions
inferred← citeshttps://doi.org/10.1145/2897518.2897643openalex-snapshot
Extractors for sumset sources
inferred← citeshttps://doi.org/10.1145/3055399.3055483openalex-snapshot
Non-malleable codes and extractors for small-depth circuits, and affine functions
inferred← citeshttps://doi.org/10.1145/3188745.3188822openalex-snapshot
Quantified derandomization of linear threshold circuits
inferred← citeshttps://doi.org/10.1145/3313276.3316333openalex-snapshot
Bootstrapping results for threshold circuits “just beyond” known lower bounds
inferred← citeshttps://doi.org/10.1145/3317691openalex-snapshot
On the Entropy Loss and Gap of Condensers
inferred← citeshttps://doi.org/10.1145/3356867openalex-snapshot
An Operational Characterization of Mutual Information in Algorithmic Information Theory
inferred← citeshttps://doi.org/10.1145/3406325.3451059openalex-snapshot
Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost
inferred← citeshttps://doi.org/10.1145/3519935.3520010openalex-snapshot
The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity
inferred← citeshttps://doi.org/10.1145/3555307openalex-snapshot
Nearly Optimal Pseudorandomness from Hardness
inferred← citeshttps://doi.org/10.1145/3564246.3585138openalex-snapshot
A Duality between One-Way Functions and Average-Case Symmetry of Information
inferred← citeshttps://doi.org/10.1145/3564246.3585238openalex-snapshot
Optimal Explicit Small-Depth Formulas for the Coin Problem
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.1145/3798129.3800780openalex-snapshot
Kolmogorov’s Approach to P vs. NP: Chain Rules for Time-Bounded Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1145/780542.780630openalex-snapshot
Extractors
inferred← citeshttps://doi.org/10.1364/oe.27.032096openalex-snapshot
Accelerated secure key distribution based on localized and asymmetric fiber interferometers
inferred← citeshttps://doi.org/10.1515/9783110203738.455openalex-snapshot
Chapter 8 Notes and References
inferred← citeshttps://doi.org/10.1561/0400000010openalex-snapshot
Pseudorandomness
inferred← citeshttps://doi.org/10.1561/0400000108openalex-snapshot
Quantified Derandomization: How to Find Water in the Ocean
inferred← citeshttps://doi.org/10.1561/0400000109openalex-snapshot
Paradigms for Unconditional Pseudorandom Generators
inferred← citeshttps://doi.org/10.31590/ejosat.1008063openalex-snapshot
Son İşlem Algoritmaları İçin Web Tabanlı Yazılım Suiti Geliştirilmesi
inferred← citeshttps://doi.org/10.4007/annals.2012.176.3.3openalex-snapshot
2-source dispersers for n^o(1) entropy, and Ramsey graphs beating the Frankl-Wilson construction
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.