On the public citation graph
Small-Bias Probability Spaces: Efficient Constructions and Applications
0 signed · 532 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/rsa.3240020403openalex-snapshot
A parallel algorithmic version of the local lemma
inferredcites →https://doi.org/10.1002/rsa.3240030308openalex-snapshot
Simple Constructions of Almost k‐wise Independent Random Variables
inferredcites →https://doi.org/10.1007/3-540-09526-8_5openalex-snapshot
Fast probabilistic algorithms
inferredcites →https://doi.org/10.1016/0012-365x(73)90098-8openalex-snapshot
Families of k-independent sets
inferredcites →https://doi.org/10.1016/0012-365x(86)90161-5openalex-snapshot
Explicit construction of exponential sized families of k-independent sets
inferredcites →https://doi.org/10.1016/0022-0000(81)90040-4openalex-snapshot
Explicit constructions of linear-sized superconcentrators
inferredcites →https://doi.org/10.1016/0022-0000(88)90003-7openalex-snapshot
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
inferredcites →https://doi.org/10.1016/0022-0000(88)90035-9openalex-snapshot
Expanders, randomness, or time versus space
inferredcites →https://doi.org/10.1016/0196-6774(86)90019-2openalex-snapshot
A fast and simple randomized parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1016/0196-6774(87)90026-5openalex-snapshot
Efficient parallel algorithms for edge coloring problems
inferredcites →https://doi.org/10.1016/0885-064x(89)90015-0openalex-snapshot
On the power of two-point based sampling
inferredcites →https://doi.org/10.1016/0890-5401(87)90023-xopenalex-snapshot
On using deterministic functions to reduce randomness in probabilistic algorithms
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1063/1.3034322openalex-snapshot
An Introduction to Probability Theory and Its Applications, Vol. 2
inferredcites →https://doi.org/10.1109/18.119713openalex-snapshot
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
inferredcites →https://doi.org/10.1109/18.6031openalex-snapshot
Vector sets for exhaustive testing of logic circuits
inferredcites →https://doi.org/10.1109/tit.1972.1054893openalex-snapshot
Class of constructive asymptotically good algebraic codes
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/0222080openalex-snapshot
Learning Decision Trees Using the Fourier Spectrum
inferredcites →https://doi.org/10.1137/1.9781611970074openalex-snapshot
Ten Lectures on the Probabilistic Method
inferredcites →https://doi.org/10.1145/115234.115347openalex-snapshot
Simulating (log c n )-wise independence in NC
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/4221.4226openalex-snapshot
A fast parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1214/lnms/1215467407openalex-snapshot
Group representations in probability and statistics
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.4845497openalex-extracted
Optimal Rip Matrices with Slightly Less Randomness
inferred← citeshttps://doi.org/10.5281/zenodo.17343522zenodo-depositor-declared
Deterministic Framework toward P = NP: A Polynomial-Time Uniqueness Test and Explicit Linear Isolation Scheme
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(200001)16:1<4::aid-rsa2>3.0.co;2-2openalex-snapshot
Improved bounds and algorithms for hypergraph 2-coloring
inferred← citeshttps://doi.org/10.1002/1098-2418(200007)16:4<293::aid-rsa1>3.0.co;2-fopenalex-snapshot
MODp-tests, almost independence and small probability spaces
inferred← citeshttps://doi.org/10.1002/1098-2418(200010/12)17:3/4<213::aid-rsa3>3.0.co;2-yopenalex-snapshot
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma
inferred← citeshttps://doi.org/10.1002/jcd.3180010106openalex-snapshot
Covering arrays and intersecting codes
inferred← citeshttps://doi.org/10.1002/rsa.10078openalex-snapshot
Three theorems regarding testing graph properties
inferred← citeshttps://doi.org/10.1002/rsa.20423openalex-snapshot
Robust characterizations of k‐wise independence over product spaces and related testing results
inferred← citeshttps://doi.org/10.1002/rsa.20914openalex-snapshot
New bounds for the Moser‐Tardos distribution
inferred← citeshttps://doi.org/10.1002/rsa.3240030308openalex-snapshot
Simple Constructions of Almost k‐wise Independent Random Variables
inferred← citeshttps://doi.org/10.1002/stvr.1689openalex-snapshot
Approaches for computing test‐case‐aware covering arrays
inferred← citeshttps://doi.org/10.1006/inco.2000.3012openalex-snapshot
On the Decisional Complexity of Problems Over the Reals
inferred← citeshttps://doi.org/10.1006/jagm.1996.0027openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1006/jcss.1997.1532openalex-snapshot
(De)randomized Construction of Small Sample Spaces in NC
inferred← citeshttps://doi.org/10.1006/jcss.1997.1546openalex-snapshot
Extracting Randomness: A Survey and New Constructions
inferred← citeshttps://doi.org/10.1006/jcss.1998.1589openalex-snapshot
Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets
inferred← citeshttps://doi.org/10.1006/jcss.1998.1593openalex-snapshot
Approximating Hyper-Rectangles: Learning and Pseudorandom Sets
inferred← citeshttps://doi.org/10.1006/jcss.1999.1695openalex-snapshot
Improved Algorithms via Approximations of Probability Distributions
inferred← citeshttps://doi.org/10.1007/0-387-25036-0_10openalex-snapshot
Software and Hardware Testing Using Combinatorial Covering Suites
inferred← citeshttps://doi.org/10.1007/10719839_20openalex-snapshot
Almost k-Wise Independence and Hard Boolean Functions
inferred← citeshttps://doi.org/10.1007/11535218_24openalex-snapshot
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
inferred← citeshttps://doi.org/10.1007/11558859_10openalex-snapshot
Efficient Steganography with Provable Security Guarantees
inferred← citeshttps://doi.org/10.1007/11599371_20openalex-snapshot
Constructions of Almost Resilient Functions
inferred← citeshttps://doi.org/10.1007/11681878_24openalex-snapshot
On the Complexity of Parallel Hardness Amplification for One-Way Functions
inferred← citeshttps://doi.org/10.1007/11767480_29openalex-snapshot
Results on Almost Resilient Functions
inferred← citeshttps://doi.org/10.1007/11786986_9openalex-snapshot
Deterministic Extractors for Independent-Symbol Sources
inferred← citeshttps://doi.org/10.1007/11818175_2openalex-snapshot
On the Power of the Randomized Iterate
inferred← citeshttps://doi.org/10.1007/11818175_30openalex-snapshot
Scalable Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1007/11830924_25openalex-snapshot
On Pseudorandom Generators with Linear Stretch in NC0
inferred← citeshttps://doi.org/10.1007/11830924_37openalex-snapshot
Randomness-Efficient Sampling Within NC 1
inferred← citeshttps://doi.org/10.1007/11944836_12openalex-snapshot
On Obtaining Pseudorandomness from Error-Correcting Codes
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_24openalex-snapshot
Approximate Swapped Matching
inferred← citeshttps://doi.org/10.1007/3-540-44598-6_33openalex-snapshot
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_28openalex-snapshot
The Cell Probe Complexity of Succinct Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_33openalex-snapshot
Exposure-Resilient Functions and All-or-Nothing Transforms
inferred← citeshttps://doi.org/10.1007/3-540-45726-7_14openalex-snapshot
Quantum Walks on the Hypercube
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_9openalex-snapshot
How to Fool an Unbounded Adversary with a Short Key
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_75openalex-snapshot
Secure Multiparty Computation of Approximations
inferred← citeshttps://doi.org/10.1007/3-540-48658-5_36openalex-snapshot
A Randomness-Rounds Tradeoff in Private Computation
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_3openalex-snapshot
Software Performance of Universal Hash Functions
inferred← citeshttps://doi.org/10.1007/3-540-49264-x_24openalex-snapshot
New Hash Functions for Message Authentication
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_10openalex-snapshot
The complexity of graph connectivity
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_134openalex-snapshot
Quasilinear time complexity theory
inferred← citeshttps://doi.org/10.1007/3-540-58520-6_70openalex-snapshot
A note on learning DNF formulas using equivalence and incomplete membership queries
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_46openalex-snapshot
Universal hashing and k-wise independent random variables via integer arithmetic without primes
inferred← citeshttps://doi.org/10.1007/3-540-61422-2_115openalex-snapshot
Derandomization via small sample spaces
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_159openalex-snapshot
Improved parallel approximation of a class of integer programming problems
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_70openalex-snapshot
Polynomial time algorithms for some self-duality problems
inferred← citeshttps://doi.org/10.1007/3-540-63248-4_9openalex-snapshot
Sample spaces with small bias on neighborhoods and error-correcting communication protocols
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_34openalex-snapshot
Improved Deterministic Parallel Padded Sorting
inferred← citeshttps://doi.org/10.1007/3-540-69053-0_28openalex-snapshot
Almost k-wise Independent Sample Spaces and Their Cryptologic Applications
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_11openalex-snapshot
Polynomials and Combinatorial Definitions of Languages
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-17653-2_20openalex-snapshot
Revisiting Non-Malleable Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-030-43662-9_15openalex-snapshot
Worst-Case to Average-Case Reductions for Subclasses of P
inferred← citeshttps://doi.org/10.1007/978-3-030-43662-9_17openalex-snapshot
On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-43662-9_18openalex-snapshot
Constant-Round Interactive Proof Systems for AC0[2] and NC1
inferred← citeshttps://doi.org/10.1007/978-3-030-64378-2_6openalex-snapshot
Batch Verification for Statistical Zero Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-71522-9_300346openalex-snapshot
Exposure-Resilient Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-77883-5_8openalex-snapshot
Public-Coin Statistical Zero-Knowledge Batch Verification Against Malicious Verifiers
inferred← citeshttps://doi.org/10.1007/978-3-030-84259-8_17openalex-snapshot
Low-Complexity Weak Pseudorandom Functions in $$\mathtt {AC}0[\mathtt {MOD}2]$$
inferred← citeshttps://doi.org/10.1007/978-3-030-90456-2_13openalex-snapshot
Simple and Efficient Batch Verification Techniques for Verifiable Delay Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-92078-4_6openalex-snapshot
Bit Security as Computational Cost for Winning Games with High Probability
inferred← citeshttps://doi.org/10.1007/978-3-031-22963-3_15openalex-snapshot
Random Sources in Private Computation
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_33openalex-snapshot
Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-68391-6_10openalex-snapshot
Pseudorandom Error-Correcting Codes
inferred← citeshttps://doi.org/10.1007/978-3-0348-8974-2_1openalex-snapshot
Randomness and Pseudo-Randomness in Discrete Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-0348-9110-3_2openalex-snapshot
Transparent Proofs and Limits to Approximation
inferred← citeshttps://doi.org/10.1007/978-3-0348-9328-2_2openalex-snapshot
Transparent Proofs and Limits to Approximation
inferred← citeshttps://doi.org/10.1007/978-3-319-04298-5_33openalex-snapshot
Deterministic Verification of Integer Matrix Multiplication in Quadratic Time
inferred← citeshttps://doi.org/10.1007/978-3-319-05446-9_7openalex-snapshot
Progress on Polynomial Identity Testing-II
inferred← citeshttps://doi.org/10.1007/978-3-319-13039-2_6openalex-snapshot
Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_5openalex-snapshot
Efficiently Correcting Matrix Products
inferred← citeshttps://doi.org/10.1007/978-3-319-18173-8_5openalex-snapshot
Linear Time Constructions of Some $$d$$-Restriction Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_39openalex-snapshot
Entropy of Weight Distributions of Small-Bias Spaces and Pseudobinomiality
inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_18openalex-snapshot
Randomized OBDD-Based Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-26617-6_16openalex-snapshot
Non-malleable Extractors with Shorter Seeds and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_13openalex-snapshot
Almost Optimal Cover-Free Families
inferred← citeshttps://doi.org/10.1007/978-3-319-78375-8_6openalex-snapshot
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions
inferred← citeshttps://doi.org/10.1007/978-3-540-24638-1_23openalex-snapshot
Composition of Random Systems: When Two Weak Make One Strong
inferred← citeshttps://doi.org/10.1007/978-3-540-27821-4_23openalex-snapshot
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
inferred← citeshttps://doi.org/10.1007/978-3-540-27821-4_37openalex-snapshot
A Note on Approximate Counting for k-DNF
inferred← citeshttps://doi.org/10.1007/978-3-540-30576-7_30openalex-snapshot
Entropic Security and the Encryption of High Entropy Messages
inferred← citeshttps://doi.org/10.1007/978-3-540-40061-5_12openalex-snapshot
Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_39openalex-snapshot
Balanced Families of Perfect Hash Functions and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_63openalex-snapshot
Checking and Spot-Checking the Correctness of Priority Queues
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_32openalex-snapshot
Checking Value-Sensitive Data Structures in Sublinear Space
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_33openalex-snapshot
Saving Private Randomness in One-Way Functions and Pseudorandom Generators
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_9openalex-snapshot
Derandomizing Graph Tests for Homomorphism
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_30openalex-snapshot
Improved Separations between Nondeterministic and Randomized Multiparty Communication
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_30openalex-snapshot
How Efficient Can Memory Checking Be?
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_16openalex-snapshot
Message Authentication Codes from Unpredictable Block Ciphers
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_38openalex-snapshot
Hierarchy Theorems for Property Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_46openalex-snapshot
Pseudorandom Bit Generators That Fool Modular Sums
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_49openalex-snapshot
Small-Bias Spaces for Group Products
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_48openalex-snapshot
Testing Non-uniform k-Wise Independent Distributions over Product Spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_38openalex-snapshot
Improved Pseudorandom Generators for Depth 2 Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_43openalex-snapshot
On Testing Computability by Small Width OBDDs
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_22openalex-snapshot
Hierarchy Theorems for Property Testing
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-20728-0_1openalex-snapshot
Correlation Extractors and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_34openalex-snapshot
A Dichotomy for Local Small-Bias Generators
inferred← citeshttps://doi.org/10.1007/978-3-642-31662-3_3openalex-snapshot
A New Method for Constructing Small-Bias Spaces from Hermitian Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_5openalex-snapshot
Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_36openalex-snapshot
Optimal Hitting Sets for Combinatorial Shapes
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_53openalex-snapshot
On Deterministic Sketching and Streaming for Sparse Recovery and Norm Estimation
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_35openalex-snapshot
Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-642-38236-9_19openalex-snapshot
On Efficient Constructions of Short Lists Containing Mostly Ramsey Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_49openalex-snapshot
Robust Pseudorandom Generators
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_31openalex-snapshot
Small-Bias Sets for Nonabelian Groups
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_45openalex-snapshot
Pseudorandomness for Regular Branching Programs via Fourier Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-41383-4_4openalex-snapshot
Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces
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-43948-7_71openalex-snapshot
Fast Pseudorandomness for Independence and Load Balancing
inferred← citeshttps://doi.org/10.1007/978-3-662-44602-7_11openalex-snapshot
Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_11openalex-snapshot
Polynomial Decompositions in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-662-46494-6_3openalex-snapshot
The Power of Negations in Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-662-46706-0_3openalex-snapshot
SPRING: Fast Pseudorandom Functions from Rounded Ring Products
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_46openalex-snapshot
Interactive Communication with Unknown Noise Rate
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_28openalex-snapshot
Zero-Fixing Extractors for Sub-Logarithmic Entropy
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_21openalex-snapshot
Consensus Patterns (Probably) Has no EPTAS
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_46openalex-snapshot
Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints
inferred← citeshttps://doi.org/10.1007/978-3-662-49099-0_13openalex-snapshot
Interactive Coding for Interactive Proofs
inferred← citeshttps://doi.org/10.1007/978-3-662-53641-4_2openalex-snapshot
Fast Pseudorandom Functions Based on Expander Graphs
inferred← citeshttps://doi.org/10.1007/b104335openalex-snapshot
List Decoding of Error-Correcting Codes
inferred← citeshttps://doi.org/10.1007/bf01787419openalex-snapshot
On the capacity of boolean graph formulæ
inferred← citeshttps://doi.org/10.1007/bf01940869openalex-snapshot
Introduction to special issue on randomized and derandomized algorithms
inferred← citeshttps://doi.org/10.1007/bf01940874openalex-snapshot
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
inferred← citeshttps://doi.org/10.1007/bf02523683openalex-snapshot
Improved parallel approximation of a class of integer programming problems
inferred← citeshttps://doi.org/10.1007/bfb0023455openalex-snapshot
MODp-tests, almost independence and small probability spaces
inferred← citeshttps://doi.org/10.1007/bfb0027919openalex-snapshot
Practical memory checkers for stacks, queues and deques
inferred← citeshttps://doi.org/10.1007/bfb0035458openalex-snapshot
Deterministic sampling and optimization
inferred← citeshttps://doi.org/10.1007/bfb0055056openalex-snapshot
Improved pseudorandom generators for combinatorial rectangles
inferred← citeshttps://doi.org/10.1007/bfb0058020openalex-snapshot
Solving Some Discrepancy Problems in NC
inferred← citeshttps://doi.org/10.1007/pl00003817openalex-snapshot
On the Construction of Pseudorandom Permutations: Luby—Rackoff Revisited
inferred← citeshttps://doi.org/10.1007/pl00009813openalex-snapshot
Approximating Probability Distributions Using Small Sample Spaces
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-0267-3openalex-snapshot
On Approximate Majority and Probabilistic Time
inferred← citeshttps://doi.org/10.1007/s00037-011-0022-4openalex-snapshot
Hierarchy Theorems for Property Testing
inferred← citeshttps://doi.org/10.1007/s00037-011-0029-xopenalex-snapshot
More on Average Case vs Approximation Complexity
inferred← citeshttps://doi.org/10.1007/s00037-012-0036-6openalex-snapshot
Pseudorandom Generators for Combinatorial Checkerboards
inferred← citeshttps://doi.org/10.1007/s00037-012-0051-7openalex-snapshot
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields
inferred← citeshttps://doi.org/10.1007/s00037-013-0068-6openalex-snapshot
DNF sparsification and a faster deterministic counting algorithm
inferred← citeshttps://doi.org/10.1007/s00037-015-0112-9openalex-snapshot
On Rigid Matrices and U-Polynomials
inferred← citeshttps://doi.org/10.1007/s00037-015-0121-8openalex-snapshot
Cryptographic Hardness of Random Local Functions
inferred← citeshttps://doi.org/10.1007/s00037-016-0144-9openalex-snapshot
Matrix rigidity of random Toeplitz matrices
inferred← citeshttps://doi.org/10.1007/s00037-022-00224-7openalex-snapshot
Improved bounds on the AN-complexity of $$O(1)$$-linear functions
inferred← citeshttps://doi.org/10.1007/s00037-022-00229-2openalex-snapshot
On Hitting-Set Generators for Polynomials that Vanish Rarely
inferred← citeshttps://doi.org/10.1007/s000370100001openalex-snapshot
A characterization of span program size and improved lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.1007/s00145-001-0010-yopenalex-snapshot
Almost k -Wise Independent Sample Spaces and Their Cryptologic Applications
inferred← citeshttps://doi.org/10.1007/s00145-012-9135-4openalex-snapshot
A One-Time Stegosystem and Applications to Efficient Covert Communication
inferred← citeshttps://doi.org/10.1007/s00145-015-9202-8openalex-snapshot
A Dichotomy for Local Small-Bias Generators
inferred← citeshttps://doi.org/10.1007/s00145-021-09376-1openalex-snapshot
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe
inferred← citeshttps://doi.org/10.1007/s001459910005openalex-snapshot
Randomness versus Fault-Tolerance
inferred← citeshttps://doi.org/10.1007/s00224-011-9381-0openalex-snapshot
Parameterized Random Complexity
inferred← citeshttps://doi.org/10.1007/s00224-016-9680-6openalex-snapshot
Small-Bias is Not Enough to Hit Read-Once CNF
inferred← citeshttps://doi.org/10.1007/s002240000075openalex-snapshot
Isolating an Odd Number of Elements and Applications in Complexity Theory
inferred← citeshttps://doi.org/10.1007/s00440-017-0804-yopenalex-snapshot
A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting
inferred← citeshttps://doi.org/10.1007/s00453-001-0020-zopenalex-snapshot
Sample Spaces with Small Bias on Neighborhoods and Error-Correcting Communication Protocols
inferred← citeshttps://doi.org/10.1007/s00453-014-9946-9openalex-snapshot
$$\mathrm {3SUM}$$ 3 SUM , $$\mathrm {3XOR}$$ 3 XOR , Triangles
inferred← citeshttps://doi.org/10.1007/s00453-016-0202-3openalex-snapshot
Efficiently Correcting Matrix Products
inferred← citeshttps://doi.org/10.1007/s00453-022-00943-xopenalex-snapshot
Deterministic Constructions of High-Dimensional Sets with Small Dispersion
inferred← citeshttps://doi.org/10.1007/s004539900059openalex-snapshot
Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions
inferred← citeshttps://doi.org/10.1007/s00493-006-0029-7openalex-snapshot
Lifts, Discrepancy and Nearly Optimal Spectral Gap*
inferred← citeshttps://doi.org/10.1007/s00493-014-2715-1openalex-snapshot
Symmetric LDPC codes and local testing
inferred← citeshttps://doi.org/10.1007/s00493-014-3078-3openalex-snapshot
The communication complexity of addition
inferred← citeshttps://doi.org/10.1007/s004930200021openalex-snapshot
Improved Pseudorandom Generators for Combinatorial Rectangles
inferred← citeshttps://doi.org/10.1007/s10623-017-0359-zopenalex-snapshot
Constructions of almost secure frameproof codes with applications to fingerprinting schemes
inferred← citeshttps://doi.org/10.1007/s10878-007-9082-4openalex-snapshot
Locating and detecting arrays for interaction faults
inferred← citeshttps://doi.org/10.1007/s11128-015-1054-5openalex-snapshot
Secure sequential transmission of quantum information
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00032-8openalex-snapshot
ϵ-discrepancy sets and their application for interpolation of sparse polynomials
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00031-qopenalex-snapshot
On quasilinear-time complexity theory
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50014-0openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2008.09.001openalex-snapshot
An efficient cryptosystem Delta for stream cipher applications
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113916openalex-snapshot
Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
inferred← citeshttps://doi.org/10.1016/j.future.2021.05.002openalex-snapshot
Blockchain enabled verification for cellular-connected unmanned aircraft system networking
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.05.002openalex-snapshot
Explicit small sets with ε-discrepancy on Bohr sets
inferred← citeshttps://doi.org/10.1016/j.ipl.2024.106553openalex-snapshot
Satisfying the restricted isometry property with the optimal number of rows and slightly less randomness
inferred← citeshttps://doi.org/10.1016/j.jco.2005.05.002openalex-snapshot
Bounds and constructions for the star-discrepancy via δ -covers
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.10.002openalex-snapshot
More efficient PAC-learning of DNF with membership queries under the uniform distribution
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.2010.06.003openalex-snapshot
The isomorphism conjecture for constant depth reductions
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.05.007openalex-snapshot
New techniques and tighter bounds for local computation algorithms
inferred← citeshttps://doi.org/10.1016/j.laa.2012.12.025openalex-snapshot
On deterministic sketching and streaming for sparse recovery and norm estimation
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.047openalex-snapshot
The Cell Probe Complexity of Succinct Data Structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.046openalex-snapshot
On the derandomization of the graph test for homomorphism over groups
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.11.028openalex-snapshot
Randomized OBDD-based graph algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.034openalex-snapshot
A 2()n algorithm for k-cycle in minor-closed graph families
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114911openalex-snapshot
Finding and counting small tournaments in large tournaments
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115998openalex-snapshot
Hardness and fixed parameter tractability for pinwheel scheduling problems
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00044-1openalex-snapshot
Defaults and relevance in model-based reasoning
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00302-7openalex-snapshot
Approximate swapped matching
showing the first 200 of 507 · page through all 507
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.