On the public citation graph

Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators

https://doi.org/10.1137/s0895480197329508

0 signed · 216 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/978-1-4612-0865-5_26openalex-snapshot

Probability Inequalities for sums of Bounded Random Variables

inferredcites →https://doi.org/10.1007/bf01215351openalex-snapshot

Communication in bounded depth circuits

inferredcites →https://doi.org/10.1007/bf01940870openalex-snapshot

Simulating BPP using a general weak random source

inferredcites →https://doi.org/10.1007/s004539900055openalex-snapshot

Simulating BPP Using a General Weak Random Source

inferredcites →https://doi.org/10.1007/s004930050049openalex-snapshot

Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications

inferredcites →https://doi.org/10.1016/0012-365x(79)90084-0openalex-snapshot

The tail of the hypergeometric distribution

inferredcites →https://doi.org/10.1016/0022-0000(82)90056-3openalex-snapshot

Superconcentrators of depth 2

inferredcites →https://doi.org/10.1016/0022-0000(88)90035-9openalex-snapshot

Expanders, randomness, or time versus space

inferredcites →https://doi.org/10.1016/0304-3975(84)90032-xopenalex-snapshot

A geometric construction of a superconcentrator of depth 2

inferredcites →https://doi.org/10.1016/s0022-0000(05)80027-3openalex-snapshot

Superconcentrators of depths 2 and 3; odd levels help (rarely)

inferredcites →https://doi.org/10.1016/s0022-0000(76)80041-4openalex-snapshot

Graph-theoretic properties in computational complexity

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.1137/0206022openalex-snapshot

Superconcentrators

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.1145/800061.808731openalex-snapshot

Superconcentrators, generalizers and generalized connectors with limited depth

inferredcites →https://doi.org/10.1201/b16132-57openalex-snapshot

Extremal Graph Theory

inferredcites →https://doi.org/10.2307/2282952openalex-snapshot

Probability Inequalities for Sums of Bounded Random Variables

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.2400768openalex-extracted

inferred← citeshttps://doi.org/10.1002/rsa.20207openalex-snapshot

How to get more mileage from randomness extractors

inferred← citeshttps://doi.org/10.1002/rsa.20359openalex-snapshot

Increasing the output length of zero‐error dispersers

inferred← citeshttps://doi.org/10.1002/rsa.20363openalex-snapshot

The size‐Ramsey number of trees

inferred← citeshttps://doi.org/10.1007/11538462_27openalex-snapshot

A Lower Bound on List Size for List Decoding

inferred← citeshttps://doi.org/10.1007/11672142_30openalex-snapshot

Tradeoffs in Depth-Two Superconcentrators

inferred← citeshttps://doi.org/10.1007/11786986_9openalex-snapshot

Deterministic Extractors for Independent-Symbol Sources

inferred← citeshttps://doi.org/10.1007/11818175_14openalex-snapshot

Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets

inferred← citeshttps://doi.org/10.1007/11818175_25openalex-snapshot

Random Selection with an Adversarial Majority

inferred← citeshttps://doi.org/10.1007/11830924_25openalex-snapshot

On Pseudorandom Generators with Linear Stretch in NC0

inferred← citeshttps://doi.org/10.1007/11944836_12openalex-snapshot

On Obtaining Pseudorandomness from Error-Correcting Codes

inferred← citeshttps://doi.org/10.1007/978-1-4613-0281-0_14openalex-snapshot

Notes on the Complexity of Switching Networks

inferred← citeshttps://doi.org/10.1007/978-3-030-45721-1_13openalex-snapshot

How to Extract Useful Randomness from Unreliable Sources

inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_5openalex-snapshot

Real $$\tau $$-Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and Derandomization

inferred← citeshttps://doi.org/10.1007/978-3-032-01855-7_20openalex-snapshot

Hardness Along the Boundary: Towards One-Way Functions from the Worst-Case Hardness of Time-Bounded Kolmogorov Complexity

inferred← citeshttps://doi.org/10.1007/978-3-319-17470-9_7openalex-snapshot

Metric Pseudoentropy: Characterizations, Transformations and Applications

inferred← citeshttps://doi.org/10.1007/978-3-319-27239-9_16openalex-snapshot

Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint

inferred← citeshttps://doi.org/10.1007/978-3-319-31875-2_7openalex-snapshot

How Much Randomness Can Be Extracted from Memoryless Shannon Entropy Sources?

inferred← citeshttps://doi.org/10.1007/978-3-319-54705-3_17openalex-snapshot

Bounded-Retrieval Model with Keys Derived from Private Data

inferred← citeshttps://doi.org/10.1007/978-3-319-56617-7_11openalex-snapshot

Quantum Authentication and Encryption with Key Recycling

inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_46openalex-snapshot

Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes

inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_4openalex-snapshot

On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model

inferred← citeshttps://doi.org/10.1007/978-3-540-45198-3_22openalex-snapshot

On Extracting Private Randomness over a Public Channel

inferred← citeshttps://doi.org/10.1007/978-3-540-45198-3_8openalex-snapshot

On the Complexity of Approximating k-Dimensional Matching

inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_10openalex-snapshot

Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility

inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_16openalex-snapshot

How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?

inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_15openalex-snapshot

Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates

inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_29openalex-snapshot

Tight Bounds for Hashing Block Sources

inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_34openalex-snapshot

Increasing the Output Length of Zero-Error Dispersers

inferred← citeshttps://doi.org/10.1007/978-3-540-88733-1_18openalex-snapshot

Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?

inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_24openalex-snapshot

Variations on Muchnik’s Conditional Complexity Theorem

inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_34openalex-snapshot

Cryptographic Extraction and Key Derivation: The HKDF Scheme

inferred← citeshttps://doi.org/10.1007/978-3-642-14903-0_2openalex-snapshot

Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed

inferred← citeshttps://doi.org/10.1007/978-3-642-14903-0_5openalex-snapshot

Increasing the Output Length of Zero-Error Dispersers

inferred← citeshttps://doi.org/10.1007/978-3-642-17367-7_7openalex-snapshot

On Pseudorandom Generators with Linear Stretch in NC 0

inferred← citeshttps://doi.org/10.1007/978-3-642-19094-0_8openalex-snapshot

Inapproximability of b-Matching in k-Uniform Hypergraphs

inferred← citeshttps://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

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-22670-0_24openalex-snapshot

A Sample of Samplers: A Computational Perspective on Sampling

inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_1openalex-snapshot

Leftover Hash Lemma, Revisited

inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_22openalex-snapshot

Computational Extractors and Pseudorandomness

inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_45openalex-snapshot

Quantum to Classical Randomness Extractors

inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_29openalex-snapshot

More on a Problem of Zarankiewicz

inferred← citeshttps://doi.org/10.1007/978-3-642-36373-3_10openalex-snapshot

Key-Efficient Steganography

inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_33openalex-snapshot

Robust Randomness Amplifiers: Upper and Lower Bounds

inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_40openalex-snapshot

Randomness-Efficient Curve Samplers

inferred← citeshttps://doi.org/10.1007/978-3-642-55220-5_6openalex-snapshot

Key Derivation without Entropy Waste

inferred← citeshttps://doi.org/10.1007/978-3-662-44381-1_11openalex-snapshot

Amplifying Privacy in Privacy Amplification

inferred← citeshttps://doi.org/10.1007/978-3-662-46078-8_49openalex-snapshot

True Random Number Generators Secure in a Changing Environment: Improved Security Bounds

inferred← citeshttps://doi.org/10.1007/978-3-662-46800-5_4openalex-snapshot

A Provable-Security Analysis of Intel’s Secure Key RNG

inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_85openalex-snapshot

Condensed Unpredictability

inferred← citeshttps://doi.org/10.1007/978-981-99-8736-8_12openalex-snapshot

Unified View for Notions of Bit Security

inferred← citeshttps://doi.org/10.1007/s00037-006-0205-6openalex-snapshot

On the complexity of approximating k-set packing

inferred← citeshttps://doi.org/10.1007/s00037-007-0233-xopenalex-snapshot

Pseudorandomness and Average-Case Complexity Via Uniform Reductions

inferred← citeshttps://doi.org/10.1007/s00037-007-0237-6openalex-snapshot

On Pseudorandom Generators with Linear Stretch in NC0

inferred← citeshttps://doi.org/10.1007/s00037-009-0282-4openalex-snapshot

On The Randomness Complexity of Property Testing

inferred← citeshttps://doi.org/10.1007/s00037-011-0006-4openalex-snapshot

Weak Derandomization of Weak Algorithms: Explicit Versions of Yao’s Lemma

inferred← citeshttps://doi.org/10.1007/s00037-016-0128-9openalex-snapshot

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions

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/s00037-021-00205-2openalex-snapshot

Lower Bounds for Matrix Factorization

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/s00224-008-9133-yopenalex-snapshot

Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits

inferred← citeshttps://doi.org/10.1007/s00224-011-9321-zopenalex-snapshot

Variations on Muchnik’s Conditional Complexity Theorem

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-026-10294-7openalex-snapshot

Real $$\tau $$-Conjecture for Sum-of-squares: A Unified Approach to Lower Bound and Derandomization

inferred← citeshttps://doi.org/10.1007/s00493-006-0036-8openalex-snapshot

Reducing The Seed Length In The Nisan-Wigderson Generator*

inferred← citeshttps://doi.org/10.1007/s00493-010-2463-9openalex-snapshot

Almost Euclidean subspaces of ℓ 1 N VIA expander codes

inferred← citeshttps://doi.org/10.1007/s00493-020-4360-1openalex-snapshot

Lossless Dimension Expanders Via Linearized Polynomials and Subspace Designs

inferred← citeshttps://doi.org/10.1007/s10878-011-9402-6openalex-snapshot

Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors

inferred← citeshttps://doi.org/10.1007/s11128-022-03487-9openalex-snapshot

Estimating security of the quantum key distribution from the guesswork

inferred← citeshttps://doi.org/10.1007/s11433-024-2378-1openalex-snapshot

Security of quantum key distribution with virtual mutually unbiased bases

inferred← citeshttps://doi.org/10.1016/b978-012373577-5/50010-7openalex-snapshot

Sampling and Partitioning

inferred← citeshttps://doi.org/10.1016/j.disc.2009.07.011openalex-snapshot

Representing (0, 1)-matrices by boolean circuits

inferred← citeshttps://doi.org/10.1016/j.jcss.2005.05.010openalex-snapshot

Extractors from Reed–Muller codes

inferred← citeshttps://doi.org/10.1016/j.jcss.2009.09.003openalex-snapshot

Min-rank conjecture for log-depth circuits

inferred← citeshttps://doi.org/10.1016/j.tcs.2009.10.020openalex-snapshot

Simple extractors via constructions of cryptographic pseudo-random generators

inferred← citeshttps://doi.org/10.1016/j.tcs.2011.11.036openalex-snapshot

Better short-seed quantum-proof extractors

inferred← citeshttps://doi.org/10.1038/s41534-022-00608-1openalex-snapshot

Efficient methods for one-shot quantum communication

inferred← citeshttps://doi.org/10.1038/s42005-022-00831-4openalex-snapshot

Improving the performance of practical decoy-state quantum key distribution with advantage distillation technology

inferred← citeshttps://doi.org/10.1103/physrevapplied.21.034005openalex-snapshot

Sampled subblock hashing for large-input randomness extraction

inferred← citeshttps://doi.org/10.1103/revmodphys.89.015004openalex-snapshot

Quantum random number generators

inferred← citeshttps://doi.org/10.1109/ccc.2002.1004348openalex-snapshot

Pseudorandomness and average-case complexity via uniform reductions

inferred← citeshttps://doi.org/10.1109/ccc.2006.24openalex-snapshot

How to Get More Mileage from Randomness Extractors

inferred← citeshttps://doi.org/10.1109/ccc.2007.38openalex-snapshot

Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes

inferred← citeshttps://doi.org/10.1109/ccc.2009.27openalex-snapshot

Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma

inferred← citeshttps://doi.org/10.1109/ccc.2012.39openalex-snapshot

Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators

inferred← citeshttps://doi.org/10.1109/ccc.2013.19openalex-snapshot

Short Lists with Short Programs in Short Time

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/csa.2009.5404261openalex-snapshot

A Fuzzy Extractor Based on Smooth Entropy

inferred← citeshttps://doi.org/10.1109/cyberc.2009.5342191openalex-snapshot

A fully robust fuzzy extractor

inferred← citeshttps://doi.org/10.1109/focs.2004.21openalex-snapshot

Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed

inferred← citeshttps://doi.org/10.1109/focs.2015.58openalex-snapshot

Three-Source Extractors for Polylogarithmic Min-Entropy

inferred← citeshttps://doi.org/10.1109/focs.2016.27openalex-snapshot

Extractors for Near Logarithmic Min-Entropy

inferred← citeshttps://doi.org/10.1109/focs.2019.00067openalex-snapshot

Efficient Construction of Rigid Matrices Using an NP Oracle

inferred← citeshttps://doi.org/10.1109/focs54457.2022.00047openalex-snapshot

Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds

inferred← citeshttps://doi.org/10.1109/hpsr.2007.4281250openalex-snapshot

Constructions of Given-Depth and Optimal Multirate Rearrangeably Nonblocking Distributors

inferred← citeshttps://doi.org/10.1109/isit.2012.6283024openalex-snapshot

Variable-length extractors

inferred← citeshttps://doi.org/10.1109/isit.2014.6875078openalex-snapshot

Variations on classical and quantum extractors

inferred← citeshttps://doi.org/10.1109/isit.2018.8437654openalex-snapshot

Inverted Leftover Hash Lemma

inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206607openalex-snapshot

ε-Almost Collision-Flat Universal Hash Functions Motivated by Information-Theoretic Security

inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653850openalex-snapshot

Capacity-Achieving Codes with Inverse-Ackermann-Depth Encoders

inferred← citeshttps://doi.org/10.1109/itw.2012.6404713openalex-snapshot

Two-source extractors for leaky sources

inferred← citeshttps://doi.org/10.1109/sfcs.2001.959940openalex-snapshot

Extractors from Reed-Muller codes

inferred← citeshttps://doi.org/10.1109/tit.2004.838377openalex-snapshot

Extractor Codes

inferred← citeshttps://doi.org/10.1109/tit.2006.878166openalex-snapshot

Improving the Alphabet-Size in Expander-Based Code Constructions

inferred← citeshttps://doi.org/10.1109/tit.2008.920211openalex-snapshot

Entropy Analysis and New Constructions of Biometric Key Generation Systems

inferred← citeshttps://doi.org/10.1109/tit.2010.2070170openalex-snapshot

A Lower Bound on List Size for List Decoding

inferred← citeshttps://doi.org/10.1109/tit.2010.2079012openalex-snapshot

Deterministic Extractors for Independent-Symbol Sources

inferred← citeshttps://doi.org/10.1109/tit.2011.2158898openalex-snapshot

Achieving Oblivious Transfer Capacity of Generalized Erasure Channels in the Malicious Model

inferred← citeshttps://doi.org/10.1109/tit.2012.2200290openalex-snapshot

Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets

inferred← citeshttps://doi.org/10.1109/tit.2013.2270275openalex-snapshot

Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates

inferred← citeshttps://doi.org/10.1109/tit.2013.2291780openalex-snapshot

Quantum to Classical Randomness Extractors

inferred← citeshttps://doi.org/10.1109/tit.2016.2627531openalex-snapshot

Quantum-Proof Randomness Extractors via Operator Space Theory

inferred← citeshttps://doi.org/10.1109/tit.2017.2735423openalex-snapshot

On the Oblivious Transfer Capacity of Generalized Erasure Channels Against Malicious Adversaries: The Case of Low Erasure Probability

inferred← citeshttps://doi.org/10.1109/tit.2019.2915242openalex-snapshot

Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction

inferred← citeshttps://doi.org/10.1109/tit.2019.2946896openalex-snapshot

An Entropy Lower Bound for Non-Malleable Extractors

inferred← citeshttps://doi.org/10.1109/tit.2020.2967048openalex-snapshot

On the Commitment Capacity of Unfair Noisy Channels

inferred← citeshttps://doi.org/10.1109/tit.2025.3605160openalex-snapshot

Nearly-Linear Time Seeded Extractors With Short Seeds

inferred← citeshttps://doi.org/10.1109/tnet.2008.2001728openalex-snapshot

Rearrangeable and Nonblocking $[w,f]$-Distributors

inferred← citeshttps://doi.org/10.1137/060651380openalex-snapshot

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

inferred← citeshttps://doi.org/10.1137/09076787xopenalex-snapshot

Short Seed Extractors against Quantum Storage

inferred← citeshttps://doi.org/10.1137/100813683openalex-snapshot

Trevisan's Extractor in the Presence of Quantum Side Information

inferred← citeshttps://doi.org/10.1137/16m1076666openalex-snapshot

Sampling Correctors

inferred← citeshttps://doi.org/10.1137/17m1133245openalex-snapshot

An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy

inferred← citeshttps://doi.org/10.1137/20m1322297openalex-snapshot

Efficient Construction of Rigid Matrices Using an NP Oracle

inferred← citeshttps://doi.org/10.1137/21m1443339openalex-snapshot

Kronecker Products, Low-Depth Circuits, and Matrix Rigidity

inferred← citeshttps://doi.org/10.1137/s0097539703431032openalex-snapshot

Extracting Randomness via Repeated Condensing

inferred← citeshttps://doi.org/10.1137/s0097539705447049openalex-snapshot

Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed

inferred← citeshttps://doi.org/10.1142/9789812562494_0013openalex-snapshot

RECENT DEVELOPMENTS IN EXPLICIT CONSTRUCTIONS OF EXTRACTORS

inferred← citeshttps://doi.org/10.1142/9789814324359_0165openalex-snapshot

The Unified Theory of Pseudorandomness

inferred← citeshttps://doi.org/10.1145/1007352.1007422openalex-snapshot

Better extractors for better codes?

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/1324215.1324225openalex-snapshot

The unified theory of pseudorandomness

inferred← citeshttps://doi.org/10.1145/1536414.1536470openalex-snapshot

Short seed extractors against quantum storage

inferred← citeshttps://doi.org/10.1145/1538902.1538904openalex-snapshot

Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes

inferred← citeshttps://doi.org/10.1145/1582716.1582738openalex-snapshot

Fast scalable deterministic consensus for crash failures

inferred← citeshttps://doi.org/10.1145/1806689.1806796openalex-snapshot

Privacy amplification with asymptotically optimal entropy loss

inferred← citeshttps://doi.org/10.1145/1907450.1907540openalex-snapshot

SIGACT news complexity theory column 68

inferred← citeshttps://doi.org/10.1145/2213977.2214023openalex-snapshot

Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates

inferred← citeshttps://doi.org/10.1145/2630064openalex-snapshot

Privacy amplification with asymptotically optimal entropy loss

inferred← citeshttps://doi.org/10.1145/3055399.3055423openalex-snapshot

An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy

inferred← citeshttps://doi.org/10.1145/3317691openalex-snapshot

On the Entropy Loss and Gap of Condensers

inferred← citeshttps://doi.org/10.1145/3406325.3451008openalex-snapshot

Kronecker products, low-depth circuits, and matrix rigidity

inferred← citeshttps://doi.org/10.1145/3555307openalex-snapshot

Nearly Optimal Pseudorandomness from Hardness

inferred← citeshttps://doi.org/10.1145/3564246.3585134openalex-snapshot

Almost Chor-Goldreich Sources and Adversarial Random Walks

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/3717823.3718142openalex-snapshot

Asymptotically Optimal Hardness for 𝑘-Set Packing and 𝑘-Matroid Intersection

inferred← citeshttps://doi.org/10.1145/3717823.3718143openalex-snapshot

Extractors for Samplable Distributions with Low Min-Entropy

inferred← citeshttps://doi.org/10.1145/3778858openalex-snapshot

Lower Bounds for Planar Arithmetic Circuits

inferred← citeshttps://doi.org/10.1145/3798129.3800844openalex-snapshot

Extractors for Samplable Distributions from the Two-Source Extractor Recipe

inferred← citeshttps://doi.org/10.1145/380752.380790openalex-snapshot

Loss-less condensers, unbalanced expanders, and extractors

inferred← citeshttps://doi.org/10.1145/380752.380800openalex-snapshot

Extractor codes

inferred← citeshttps://doi.org/10.1145/780542.780593openalex-snapshot

Sampling lower bounds via information theory

inferred← citeshttps://doi.org/10.11606/d.45.2007.tde-04052007-160412openalex-snapshot

Extração de aleatoriedade a partir de fontes defeituosas

inferred← citeshttps://doi.org/10.1287/opre.2015.1416openalex-snapshot

Optimal Sparse Designs for Process Flexibility via Probabilistic Expanders

inferred← citeshttps://doi.org/10.14288/1.0388334openalex-snapshot

Efficient methods for one-shot quantum communication

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.1515/dma.2008.011openalex-snapshot

On complexity of linear operators on the class of circuits of depth 2

inferred← citeshttps://doi.org/10.1515/dma.2011.031openalex-snapshot

Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements

inferred← citeshttps://doi.org/10.1561/0400000011openalex-snapshot

Complexity Lower Bounds using Linear Algebra

inferred← citeshttps://doi.org/10.1561/0400000063openalex-snapshot

Complexity of Linear Boolean Operators

inferred← citeshttps://doi.org/10.1587/transfun.2022cil0001openalex-snapshot

On the Limitations of Computational Fuzzy Extractors

inferred← citeshttps://doi.org/10.2172/877141openalex-snapshot

Key management and encryption under the bounded storage model.

inferred← citeshttps://doi.org/10.22331/q-2023-12-06-1201openalex-snapshot

Improving the performance of twin-field quantum key distribution with advantage distillation technology

inferred← citeshttps://doi.org/10.22331/q-2025-01-08-1584openalex-snapshot

Cryptomite: A versatile and user-friendly library of randomness extractors

inferred← citeshttps://doi.org/10.26512/2009.12.tcc.1618openalex-snapshot

Achieving oblivious transfer capacit of generalized erasure channels in the malicious model

inferred← citeshttps://doi.org/10.31237/osf.io/rx6ztopenalex-snapshot

Property Testing and Probability Distributions: New Techniques, New Models, and New Goals

inferred← citeshttps://doi.org/10.31237/osf.io/rx6zt_v1openalex-snapshot

Property Testing and Probability Distributions: New Techniques, New Models, and New Goals

inferred← citeshttps://doi.org/10.3233/com-160066openalex-snapshot

Dimension, pseudorandomness and extraction of pseudorandomness

inferred← citeshttps://doi.org/10.4086/toc.2013.v009a030openalex-snapshot

inferred← citeshttps://doi.org/10.4213/dm1160openalex-snapshot

Нижние оценки сложности булевых схем конечной глубины с произвольными элементами

inferred← citeshttps://doi.org/10.4213/dm994openalex-snapshot

О сложности линейных операторов в классе схем глубины 2

inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2015.497openalex-snapshot

On Fortification of Projection Games

inferred← citeshttps://doi.org/10.4230/lipics.ccc.2020.5openalex-snapshot

Lower Bounds for Matrix Factorization

inferred← citeshttps://doi.org/10.4230/oasics.iccsw.2014.83openalex-snapshot

On Recent Advances in Key Derivation via the Leftover Hash Lemma

inferred← citeshttps://doi.org/10.48550/arxiv.0709.0887openalex-snapshot

Almost Euclidean subspaces of \ell_1^N via expander codes

inferred← citeshttps://doi.org/10.48550/arxiv.0808.1994openalex-snapshot

Short seed extractors against quantum storage

inferred← citeshttps://doi.org/10.48550/arxiv.0904.3116openalex-snapshot

Variations on Muchnik's Conditional Complexity Theorem

inferred← citeshttps://doi.org/10.48550/arxiv.1004.3737openalex-snapshot

Better short-seed quantum-proof extractors

inferred← citeshttps://doi.org/10.48550/arxiv.1004.5236openalex-snapshot

Circuits with arbitrary gates for random operators

inferred← citeshttps://doi.org/10.48550/arxiv.1104.0872openalex-snapshot

Possibilities and impossibilities in Kolmogorov complexity extraction

inferred← citeshttps://doi.org/10.48550/arxiv.1201.1377openalex-snapshot

On Zarankiewicz Problem and Depth-Two Superconcentrators

inferred← citeshttps://doi.org/10.48550/arxiv.1209.0734openalex-snapshot

Efficiently Extracting Randomness from Imperfect Stochastic Processes

inferred← citeshttps://doi.org/10.48550/arxiv.1212.0520openalex-snapshot

A modular framework for randomness extraction based on Trevisan's construction

inferred← citeshttps://doi.org/10.48550/arxiv.1410.2862openalex-snapshot

On the Oblivious Transfer Capacity of Generalized Erasure Channels against Malicious Adversaries

inferred← citeshttps://doi.org/10.48550/arxiv.1504.05556openalex-snapshot

On Fortification of Projection Games

inferred← citeshttps://doi.org/10.48550/arxiv.1507.07459openalex-snapshot

On local search and LP and SDP relaxations for k-Set Packing

inferred← citeshttps://doi.org/10.48550/arxiv.1605.04194openalex-snapshot

Quantum-Proof Extractors: Optimal up to Constant Factors

inferred← citeshttps://doi.org/10.48550/arxiv.1903.12165openalex-snapshot

Faster Spectral Sparsification in Dynamic Streams

inferred← citeshttps://doi.org/10.5040/9780755625963.0007openalex-snapshot

Chapter Notes and References

inferred← citeshttps://doi.org/10.70675/b9265bdaz95daz4c9fz908aze65ebbd2d662openalex-snapshot

Security Assessment Against Side-Channel Attacks : Insights from an Information-Theoretic Perspective

inferred← citeshttps://doi.org/10.7907/82kv-2h11openalex-snapshot

Randomness and Noise in Information Systems

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.