On the public citation graph
Pseudorandomness
0 signed · 453 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<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.1002/(sici)1098-2418(199808)13:1<1::aid-rsa1>3.0.co;2-wopenalex-snapshot
Efficient approximation of product distributions
inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1002/j.1538-7305.1952.tb01393.xopenalex-snapshot
A Comparison of Signalling Alphabets
inferredcites →https://doi.org/10.1002/rsa.20188openalex-snapshot
Quasi‐random graphs with given degree sequences
inferredcites →https://doi.org/10.1002/rsa.3240030308openalex-snapshot
Simple Constructions of Almost k‐wise Independent Random Variables
inferredcites →https://doi.org/10.1002/rsa.3240050203openalex-snapshot
Random Cayley graphs and expanders
inferredcites →https://doi.org/10.1006/jcom.1997.0439openalex-snapshot
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
inferredcites →https://doi.org/10.1006/jcss.1997.1545openalex-snapshot
The Space Complexity of Approximating the Frequency Moments
inferredcites →https://doi.org/10.1006/jcss.1997.1546openalex-snapshot
Extracting Randomness: A Survey and New Constructions
inferredcites →https://doi.org/10.1006/jcss.1999.1652openalex-snapshot
Computational Indistinguishability: A Sample Hierarchy
inferredcites →https://doi.org/10.1006/jcss.2000.1730openalex-snapshot
Pseudorandom Generators without the XOR Lemma
inferredcites →https://doi.org/10.1006/jcss.2001.1780openalex-snapshot
Randomness vs Time: Derandomization under a Uniform Assumption
inferredcites →https://doi.org/10.1006/jcss.2002.1824openalex-snapshot
Extracting all the Randomness and Reducing the Error in Trevisan's Extractors
inferredcites →https://doi.org/10.1007/3-540-09519-5_73openalex-snapshot
Probabilistic algorithms for sparse polynomials
inferredcites →https://doi.org/10.1007/3-540-45539-6_33openalex-snapshot
Exposure-Resilient Functions and All-or-Nothing Transforms
inferredcites →https://doi.org/10.1007/978-3-540-45198-3_18openalex-snapshot
Computational Analogues of Entropy
inferredcites →https://doi.org/10.1007/978-3-642-22935-0_41openalex-snapshot
Extractors and Lower Bounds for Locally Samplable Sources
inferredcites →https://doi.org/10.1007/978-3-642-22953-4_7openalex-snapshot
Computational Randomness from Generalized Hardcore Sets
inferredcites →https://doi.org/10.1007/bf01200056openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1007/bf01200907openalex-snapshot
Efficient construction of a small hitting set for combinatorial rectangles in high dimension
inferredcites →https://doi.org/10.1007/bf01275486openalex-snapshot
BPP has subexponential time simulations unlessEXPTIME has publishable proofs
inferredcites →https://doi.org/10.1007/bf01305237openalex-snapshot
Pseudorandom generators for space-bounded computation
inferredcites →https://doi.org/10.1007/bf01375474openalex-snapshot
Pseudorandom bits for constant depth circuits
inferredcites →https://doi.org/10.1007/bf01940870openalex-snapshot
Simulating BPP using a general weak random source
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1007/bf02579167openalex-snapshot
Independent unbiased coin flips from a correlated biased source—A finite state markov chain
inferredcites →https://doi.org/10.1007/bf02579322openalex-snapshot
Expanders obtained from affine transformations
inferredcites →https://doi.org/10.1007/bf02579323openalex-snapshot
One way functions and pseudorandom generators
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/bf02579382openalex-snapshot
Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory
inferredcites →https://doi.org/10.1007/bf02579407openalex-snapshot
Constructing a perfect matching is in random NC
inferredcites →https://doi.org/10.1007/bf02579457openalex-snapshot
Intersection theorems with geometric consequences
inferredcites →https://doi.org/10.1007/bfb0052242openalex-snapshot
“Pseudo-random” number generation within cryptographic algorithms: The DDS case
inferredcites →https://doi.org/10.1007/pl00009813openalex-snapshot
Approximating Probability Distributions Using Small Sample Spaces
inferredcites →https://doi.org/10.1007/s00037-005-0197-7openalex-snapshot
Derandomizing Arthur–Merlin Games using Hitting Sets
inferredcites →https://doi.org/10.1007/s00037-007-0218-9openalex-snapshot
Pseudorandomness for Approximate Counting and Sampling
inferredcites →https://doi.org/10.1007/s00037-007-0226-9openalex-snapshot
Polynomial Identity Testing for Depth 3 Circuits
inferredcites →https://doi.org/10.1007/s00037-007-0233-xopenalex-snapshot
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
inferredcites →https://doi.org/10.1007/s00037-007-0238-5openalex-snapshot
Randomness-Efficient Sampling within NC1
inferredcites →https://doi.org/10.1007/s00037-009-0258-4openalex-snapshot
Extractors And Rank Extractors For Polynomial Sources
inferredcites →https://doi.org/10.1007/s00037-009-0273-5openalex-snapshot
The Sum of D Small-Bias Generators Fools Polynomials of Degree D
inferredcites →https://doi.org/10.1007/s00037-011-0003-7openalex-snapshot
Complexity of Hard-Core Set Proofs
inferredcites →https://doi.org/10.1007/s00037-011-0006-4openalex-snapshot
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao’s Lemma
inferredcites →https://doi.org/10.1007/s00037-011-0010-8openalex-snapshot
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds
inferredcites →https://doi.org/10.1007/s00039-001-0332-9openalex-snapshot
A new proof of Szemerédi's theorem
inferredcites →https://doi.org/10.1007/s00039-004-0451-1openalex-snapshot
A sum-product estimate in finite fields, and applications
inferredcites →https://doi.org/10.1007/s00039-007-0593-zopenalex-snapshot
On the Construction of Affine Extractors
inferredcites →https://doi.org/10.1007/s000390050065openalex-snapshot
A New Proof of Szemer�di's Theorem for Arithmetic Progressions of Length Four
inferredcites →https://doi.org/10.1007/s00145-003-0237-xopenalex-snapshot
Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model
inferredcites →https://doi.org/10.1007/s00493-006-0029-7openalex-snapshot
Lifts, Discrepancy and Nearly Optimal Spectral Gap*
inferredcites →https://doi.org/10.1007/s00493-007-0053-2openalex-snapshot
Lossless Condensers, Unbalanced Expanders, And Extractors
inferredcites →https://doi.org/10.1007/s00493-008-2259-3openalex-snapshot
Deterministic extractors for affine sources over large fields
inferredcites →https://doi.org/10.1007/s00493-011-2604-9openalex-snapshot
Affine extractors over prime fields
inferredcites →https://doi.org/10.1007/s004930200021openalex-snapshot
Improved Pseudorandom Generators for Combinatorial Rectangles
inferredcites →https://doi.org/10.1016/0012-365x(72)90027-1openalex-snapshot
Upper bounds for constant weight error correcting codes
inferredcites →https://doi.org/10.1016/0012-365x(91)90112-fopenalex-snapshot
On the second eigenvalue of a graph
inferredcites →https://doi.org/10.1016/0020-0190(78)90067-4openalex-snapshot
A probabilistic remark on algebraic program testing
inferredcites →https://doi.org/10.1016/0020-0190(83)90044-3openalex-snapshot
BPP and the polynomial hierarchy
inferredcites →https://doi.org/10.1016/0020-0190(84)90018-8openalex-snapshot
On computing the determinant in small parallel time using a small number of processors
inferredcites →https://doi.org/10.1016/0020-0190(92)90195-2openalex-snapshot
Highly resilient correctors for polynomials
inferredcites →https://doi.org/10.1016/0020-0190(94)00171-topenalex-snapshot
Lower bounds for sampling algorithms for estimating the average
inferredcites →https://doi.org/10.1016/0020-0190(95)00032-8openalex-snapshot
ϵ-discrepancy sets and their application for interpolation of sparse polynomials
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/0022-0000(81)90033-7openalex-snapshot
New hash functions and their use in authentication and set equality
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(84)90070-9openalex-snapshot
Probabilistic encryption
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)90003-7openalex-snapshot
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
inferredcites →https://doi.org/10.1016/0022-0000(88)90028-1openalex-snapshot
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
inferredcites →https://doi.org/10.1016/0022-0000(88)90035-9openalex-snapshot
Expanders, randomness, or time versus space
inferredcites →https://doi.org/10.1016/0022-0000(89)90018-4openalex-snapshot
On hiding information from an oracle
inferredcites →https://doi.org/10.1016/0022-0000(93)90033-sopenalex-snapshot
Removing randomness in parallel computation without a processor penalty
inferredcites →https://doi.org/10.1016/0022-0000(93)90044-wopenalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1016/0022-314x(80)90084-0openalex-snapshot
Probabilistic algorithm for testing primality
inferredcites →https://doi.org/10.1016/0196-6774(89)90038-2openalex-snapshot
Monte-Carlo approximation algorithms for enumeration problems
inferredcites →https://doi.org/10.1016/0196-6774(92)90054-gopenalex-snapshot
How to predict congruential generators
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
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/j.jcss.2004.01.001openalex-snapshot
Hardness amplification within NP
inferredcites →https://doi.org/10.1016/j.jcss.2005.05.010openalex-snapshot
Extractors from Reed–Muller codes
inferredcites →https://doi.org/10.1016/j.jcss.2010.06.014openalex-snapshot
Deterministic extractors for small-space sources
inferredcites →https://doi.org/10.1016/j.tcs.2006.10.009openalex-snapshot
Improved hardness amplification in NP
inferredcites →https://doi.org/10.1016/s0019-9958(84)80056-xopenalex-snapshot
The complexity of promise problems with applications to public-key cryptography
inferredcites →https://doi.org/10.1016/s0022-0000(02)00024-7openalex-snapshot
In search of an easy witness: exponential time vs. probabilistic polynomial time
inferredcites →https://doi.org/10.1016/s0022-0000(03)00046-1openalex-snapshot
Pseudo-random generators for all hardnesses
inferredcites →https://doi.org/10.1016/s0022-0000(05)80007-8openalex-snapshot
Combinatorial techniques for universal hashing
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1016/s0022-0000(76)80041-4openalex-snapshot
Graph-theoretic properties in computational complexity
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1017/cbo9780511626265openalex-snapshot
Fourier Analysis on Finite Groups and Applications
inferredcites →https://doi.org/10.1017/cbo9780511895593openalex-snapshot
Some Applications of Modular Forms
inferredcites →https://doi.org/10.1017/s0963548300000870openalex-snapshot
Constructing Small Sets that are Uniform in Arithmetic Progressions
inferredcites →https://doi.org/10.1017/s0963548305007352openalex-snapshot
Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
inferredcites →https://doi.org/10.1023/a:1022949332276openalex-snapshot
Boosting and Hard-Core Set Construction
inferredcites →https://doi.org/10.1080/00029890.1954.11988567openalex-snapshot
Boolean Algebras in Electric Circuit Design
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1090/memo/0910openalex-snapshot
A proof of Alon’s second eigenvalue conjecture and related problems
inferredcites →https://doi.org/10.1090/s0002-9904-1947-08785-1openalex-snapshot
Some remarks on the theory of graphs
inferredcites →https://doi.org/10.1090/s0002-9939-1971-0279857-5openalex-snapshot
On a Sequence of Almost Deterministic Pairwise Independent Random Variables
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0170805-7openalex-snapshot
On the Computational Complexity of Algorithms
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0276200-xopenalex-snapshot
Factoring polynomials over large finite fields
inferredcites →https://doi.org/10.1090/s0273-0979-06-01126-8openalex-snapshot
Expander graphs and their applications
inferredcites →https://doi.org/10.1090/s0273-0979-2011-01359-3openalex-snapshot
Expander graphs in pure and applied mathematics
inferredcites →https://doi.org/10.1090/s0894-0347-1989-0965007-8openalex-snapshot
An Estimate for Character Sums
inferredcites →https://doi.org/10.1093/biomet/33.4.305openalex-snapshot
THE DESIGN OF OPTIMUM MULTIFACTORIAL EXPERIMENTS
inferredcites →https://doi.org/10.1109/18.61123openalex-snapshot
Error-correcting codes for list decoding
inferredcites →https://doi.org/10.1109/18.782097openalex-snapshot
Improved decoding of Reed-Solomon and algebraic-geometry codes
inferredcites →https://doi.org/10.1109/18.995539openalex-snapshot
Combinatorial bounds for list decoding
inferredcites →https://doi.org/10.1109/focs.2009.40openalex-snapshot
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
inferredcites →https://doi.org/10.1109/focs.2011.37openalex-snapshot
Dispersers for Affine Sources with Sub-polynomial Entropy
inferredcites →https://doi.org/10.1109/fscs.1990.89550openalex-snapshot
Security preserving amplification of hardness
inferredcites →https://doi.org/10.1109/sfcs.1978.37openalex-snapshot
Two theorems on random polynomial time
inferredcites →https://doi.org/10.1109/sfcs.1979.34openalex-snapshot
Random walks, universal traversal sequences, and the complexity of maze problems
inferredcites →https://doi.org/10.1109/sfcs.1989.63449openalex-snapshot
Dispersers, deterministic amplification, and weak random sources
inferredcites →https://doi.org/10.1109/sfcs.1989.63529openalex-snapshot
Conductance and convergence of Markov chains-a combinatorial treatment of expanders
inferredcites →https://doi.org/10.1109/sfcs.2000.892063openalex-snapshot
Extracting randomness from samplable distributions
inferredcites →https://doi.org/10.1109/tit.1979.1055985openalex-snapshot
On the Shannon capacity of a graph
inferredcites →https://doi.org/10.1109/tit.2007.911222openalex-snapshot
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
inferredcites →https://doi.org/10.1109/tit.2010.2095170openalex-snapshot
On the List-Decodability of Random Linear Codes
inferredcites →https://doi.org/10.1112/blms/22.6.583openalex-snapshot
Construction of a Thin Set with small Fourier Coefficients
inferredcites →https://doi.org/10.1137/0108018openalex-snapshot
Polynomial Codes Over Certain Finite Fields
inferredcites →https://doi.org/10.1137/0205040openalex-snapshot
Fast Parallel Matrix Inversion Algorithms
inferredcites →https://doi.org/10.1137/0206006openalex-snapshot
A Fast Monte-Carlo Test for Primality
inferredcites →https://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
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/0217016openalex-snapshot
Reconstructing Truncated Integer Variables Satisfying Linear Congruences
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/0222053openalex-snapshot
Small-Bias Probability Spaces: Efficient Constructions and Applications
inferredcites →https://doi.org/10.1137/0222069openalex-snapshot
On the Existence of Pseudorandom Generators
inferredcites →https://doi.org/10.1137/05063605xopenalex-snapshot
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
inferredcites →https://doi.org/10.1137/050640941openalex-snapshot
Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates
inferredcites →https://doi.org/10.1137/0605030openalex-snapshot
Explicit Concentrators from Generalized N -Gons
inferredcites →https://doi.org/10.1137/060671218openalex-snapshot
Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
inferredcites →https://doi.org/10.1137/070683994openalex-snapshot
Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification
inferredcites →https://doi.org/10.1137/070698348openalex-snapshot
Low-End Uniform Hardness versus Randomness Tradeoffs for AM
inferredcites →https://doi.org/10.1137/080734030openalex-snapshot
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
inferredcites →https://doi.org/10.1137/1.9781611973068.129openalex-snapshot
The Uniform Hardcore Lemma via Approximate Bregman Projections
inferredcites →https://doi.org/10.1137/12089003xopenalex-snapshot
From Affine to Two-Source Extractors via Approximate Duality
inferredcites →https://doi.org/10.1137/s0097539703431032openalex-snapshot
Extracting Randomness via Repeated Condensing
inferredcites →https://doi.org/10.1137/s0097539705446810openalex-snapshot
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
inferredcites →https://doi.org/10.1137/s0097539705446846openalex-snapshot
Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
inferredcites →https://doi.org/10.1137/s0097539705447141openalex-snapshot
Extracting Randomness Using Few Independent Sources
inferredcites →https://doi.org/10.1137/s0097539705447281openalex-snapshot
Using Nondeterminism to Amplify Hardness
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1137/s0097539794268765openalex-snapshot
A Chernoff Bound for Random Walks on Expander Graphs
inferredcites →https://doi.org/10.1137/s0097539796297577openalex-snapshot
Reconstructing Algebraic Functions from Mixed Data
inferredcites →https://doi.org/10.1137/s009753979630091xopenalex-snapshot
Computing with Very Weak Random Sources
inferredcites →https://doi.org/10.1137/s0097539797325636openalex-snapshot
Weak Random Sources, Hitting Sets, and BPP Simulations
inferredcites →https://doi.org/10.1137/s089548019223872xopenalex-snapshot
Chernoff–Hoeffding Bounds for Applications with Limited Independence
inferredcites →https://doi.org/10.1145/1008731.1008738openalex-snapshot
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
inferredcites →https://doi.org/10.1145/103418.103428openalex-snapshot
Checking computations in polylogarithmic time
inferredcites →https://doi.org/10.1145/103418.103429openalex-snapshot
Self-testing/correcting for polynomials and for approximate functions
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.1060595openalex-snapshot
On uniform amplification of hardness in NP
inferredcites →https://doi.org/10.1145/1060590.1060689openalex-snapshot
Key agreement from weak bit agreement
inferredcites →https://doi.org/10.1145/1132516.1132583openalex-snapshot
Pseudorandom walks on regular digraphs and the RL vs. L problem
inferredcites →https://doi.org/10.1145/1250790.1250832openalex-snapshot
Circuit lower bounds for Merlin-Arthur classes
inferredcites →https://doi.org/10.1145/1290672.1290679openalex-snapshot
Guessing secrets efficiently via list decoding
inferredcites →https://doi.org/10.1145/1326554.1326555openalex-snapshot
Towards 3-query locally decodable codes of subexponential length
inferredcites →https://doi.org/10.1145/1391289.1391291openalex-snapshot
Undirected connectivity in log-space
inferredcites →https://doi.org/10.1145/1538902.1538904openalex-snapshot
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
inferredcites →https://doi.org/10.1145/1754399.1754401openalex-snapshot
Polylogarithmic independence fools AC 0 circuits
inferredcites →https://doi.org/10.1145/1993636.1993660openalex-snapshot
High-rate codes with sublinear-time decoding
inferredcites →https://doi.org/10.1145/1993636.1993672openalex-snapshot
Pseudorandom generators for group products
inferredcites →https://doi.org/10.1145/200836.200880openalex-snapshot
Designing programs that check their work
inferredcites →https://doi.org/10.1145/210118.210136openalex-snapshot
Eigenvalues and expansion of regular graphs
inferredcites →https://doi.org/10.1145/2213977.2214009openalex-snapshot
Folded codes from function field towers and improved optimal rate list decoding
showing the first 200 of 229 · page through all 229
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/qute.202400025openalex-snapshot
Improved Real‐Time Post‐Processing for Quantum Random Number Generators
inferred← citeshttps://doi.org/10.1007/978-1-4614-6642-0_4openalex-snapshot
Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
inferred← citeshttps://doi.org/10.1007/978-3-030-01261-8_2openalex-snapshot
Deep Expander Networks: Efficient Deep Networks from Graph Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_1openalex-snapshot
Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-030-45374-9_22openalex-snapshot
Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More
inferred← citeshttps://doi.org/10.1007/978-3-030-45727-3_27openalex-snapshot
Quantum-Access-Secure Message Authentication via Blind-Unforgeability
inferred← citeshttps://doi.org/10.1007/978-3-030-53288-8_22openalex-snapshot
Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling
inferred← citeshttps://doi.org/10.1007/978-3-030-57675-2_24openalex-snapshot
On the Power of Randomization in Distributed Algorithms in Dynamic Networks with Adaptive Adversaries
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-75242-2_10openalex-snapshot
Fragile Complexity of Adaptive Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-75245-3_16openalex-snapshot
Rate-1 Key-Dependent Message Security via Reusable Homomorphic Extractor Against Correlated-Source Attacks
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-78230-6_16openalex-snapshot
On the Usefulness of Linear Modular Arithmetic in Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-84252-9_20openalex-snapshot
Adaptive Extractors and Their Application to Leakage Resilient Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-030-97131-1_8openalex-snapshot
Leakage-Resilient $$\mathsf {IBE}$$/$$\mathsf {ABE}$$ with Optimal Leakage Rates from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-031-15777-6_8openalex-snapshot
Secure Sketch and Fuzzy Extractor with Imperfect Randomness: An Information-Theoretic Study
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-21017-4_5openalex-snapshot
Plateau: A Secure and Scalable Overlay Network for Large Distributed Trust Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-30620-4_15openalex-snapshot
Fully Adaptive Decentralized Multi-Authority ABE
inferred← citeshttps://doi.org/10.1007/978-3-031-48621-0_4openalex-snapshot
Multi-instance Randomness Extraction and Security Against Bounded-Storage Mass Surveillance
inferred← citeshttps://doi.org/10.1007/978-3-031-58737-5_14openalex-snapshot
A Direct PRF Construction from Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1007/978-3-031-58751-1_9openalex-snapshot
Strong Batching for Non-interactive Statistical Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-031-68388-6_16openalex-snapshot
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-78017-2_11openalex-snapshot
Worst-Case to Average-Case Hardness of LWE: An Alternative Perspective
inferred← citeshttps://doi.org/10.1007/978-3-031-78023-3_16openalex-snapshot
Distributing Keys and Random Secrets with Constant Complexity
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-032-12290-2_9openalex-snapshot
Generalized and Unified Equivalences Between Hardness and Pseudoentropy
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-07536-5_7openalex-snapshot
Leakage Resilient Proofs of Ownership in Cloud Storage, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-17296-5_7openalex-snapshot
On the Error-Correcting Radius of Folded Reed–Solomon Code Designs
inferred← citeshttps://doi.org/10.1007/978-3-319-25903-1_28openalex-snapshot
A Predictive Model for Human Activity Recognition by Observing Actions and Context
inferred← citeshttps://doi.org/10.1007/978-3-319-26784-5_12openalex-snapshot
PageRank in Undirected Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-78375-8_5openalex-snapshot
Multi-Collision Resistant Hash Functions and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-42033-7_10openalex-snapshot
Computational Fuzzy Extractors
inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_18openalex-snapshot
Randomness vs. Time in Anonymous Networks
inferred← citeshttps://doi.org/10.1007/978-981-95-5119-4_3openalex-snapshot
Fully Adaptive Decentralized MA-ABE: Simplified, Optimized, ASP Supported
inferred← citeshttps://doi.org/10.1007/978-981-96-0941-3_7openalex-snapshot
Leakage-Resilient Incompressible Cryptography: Constructions and Barriers
inferred← citeshttps://doi.org/10.1007/s00037-018-0175-5openalex-snapshot
Query-to-Communication Lifting for PNP
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/s00145-015-9219-zopenalex-snapshot
Non-malleable Coding Against Bit-Wise and Split-State Tampering
inferred← citeshttps://doi.org/10.1007/s00145-019-09339-7openalex-snapshot
Four-State Non-malleable Codes with Explicit Constant Rate
inferred← citeshttps://doi.org/10.1007/s00220-024-05156-7openalex-snapshot
Decoupling by Local Random Unitaries without Simultaneous Smoothing, and Applications to Multi-user Quantum Information Tasks
inferred← citeshttps://doi.org/10.1007/s00224-022-10113-9openalex-snapshot
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP
inferred← citeshttps://doi.org/10.1007/s00446-020-00376-1openalex-snapshot
Derandomizing local distributed algorithms under bandwidth restrictions
inferred← citeshttps://doi.org/10.1007/s00446-023-00455-zopenalex-snapshot
Near-optimal distributed computation of small vertex cuts
inferred← citeshttps://doi.org/10.1007/s00446-024-00461-9openalex-snapshot
Component stability in low-space massively parallel computation
inferred← citeshttps://doi.org/10.1007/s00453-024-01251-2openalex-snapshot
Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs
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/s00493-025-00190-yopenalex-snapshot
The Largest Subgraph Without A Forbidden Induced Subgraph
inferred← citeshttps://doi.org/10.1007/s10623-021-00843-1openalex-snapshot
Robustly reusable fuzzy extractor with imperfect randomness
inferred← citeshttps://doi.org/10.1007/s10623-024-01358-1openalex-snapshot
Leakage-resilient $$\textsf {IBE} $$/$$\textsf {ABE} $$ with optimal leakage rates from lattices
inferred← citeshttps://doi.org/10.1007/s10623-024-01523-6openalex-snapshot
Almost tight security in lattices with polynomial moduli—PRF, IBE, all-but-many LTF, and more
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105295openalex-snapshot
Derandomization of quantum algorithm for triangle finding
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.105841openalex-snapshot
Proving that prBPP = prP is as hard as proving that “almost NP” is not contained in P/poly
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.jisa.2025.104272openalex-snapshot
Entropy collapse in mobile sensors: The hidden risks of sensor-based security
inferred← citeshttps://doi.org/10.1016/j.jnca.2018.07.006openalex-snapshot
Survey on sybil attack defense mechanisms in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.09.004openalex-snapshot
On the power of randomization in distributed algorithms in dynamic networks with adaptive adversaries
inferred← citeshttps://doi.org/10.1016/j.neunet.2025.107517openalex-snapshot
The informativeness of the gradient revisited
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.034openalex-snapshot
Fragile complexity of adaptive algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113711openalex-snapshot
Superfast coloring in CONGEST via efficient color sampling
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115818openalex-snapshot
Pseudorandom generators for sliding-window algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115912openalex-snapshot
Parallel derandomization for coloring
inferred← citeshttps://doi.org/10.1016/j.vlsi.2026.102715openalex-snapshot
ExpanderGraph-128: A novel graph-theoretic block cipher with formal security analysis and hardware implementation
inferred← citeshttps://doi.org/10.1017/jfm.2019.875openalex-snapshot
Area of scalar isosurfaces in homogeneous isotropic turbulence as a function of Reynolds and Schmidt numbers
inferred← citeshttps://doi.org/10.1038/s41598-022-11613-xopenalex-snapshot
Design of a cryptographically secure pseudo random number generator with grammatical evolution
inferred← citeshttps://doi.org/10.1063/5.0113731openalex-snapshot
A construction of combinatorial NLTS
inferred← citeshttps://doi.org/10.1080/01621459.2025.2520455openalex-snapshot
Debiasing Watermarks for Large Language Models via Maximal Coupling
inferred← citeshttps://doi.org/10.1086/701074openalex-snapshot
Diversity, Not Randomness, Trumps Ability
inferred← citeshttps://doi.org/10.1088/1367-2630/18/3/035007openalex-snapshot
Randomness in post-selected events
inferred← citeshttps://doi.org/10.1088/1751-8121/ab69a3openalex-snapshot
Organisational hierarchy constructions with easy Kuramoto synchronisation
inferred← citeshttps://doi.org/10.1090/noti2166openalex-snapshot
Dimensionality Reduction in Euclidean Space
inferred← citeshttps://doi.org/10.1090/tran/9205openalex-snapshot
Strong blocking sets and minimal codes from expander graphs
inferred← citeshttps://doi.org/10.1098/rsta.2015.0238openalex-snapshot
Grounding the randomness of quantum measurement
inferred← citeshttps://doi.org/10.1103/physreva.88.032309openalex-snapshot
Weak randomness in device-independent quantum key distribution and the advantage of using high-dimensional entanglement
inferred← citeshttps://doi.org/10.1103/physrevlett.115.250403openalex-snapshot
Generation of Fresh and Pure Random Numbers for Loophole-Free Bell Tests
inferred← citeshttps://doi.org/10.1103/revmodphys.89.015002openalex-snapshot
Entropic uncertainty relations and their applications
inferred← citeshttps://doi.org/10.1109/access.2019.2905278openalex-snapshot
A Generalized Constraint of Privacy: $\alpha$ -Mutual Information Security
inferred← citeshttps://doi.org/10.1109/access.2024.3472014openalex-snapshot
Lightweight Cryptanalysis of IoT Encryption Algorithms: Is Quota Sampling the Answer?
inferred← citeshttps://doi.org/10.1109/allerton.2019.8919797openalex-snapshot
Explicit Low-complexity Codes for Multiple Access Channel Resolvability
inferred← citeshttps://doi.org/10.1109/cdc.2018.8618904openalex-snapshot
POMDP Model Learning for Human Robot Collaboration
inferred← citeshttps://doi.org/10.1109/comsnets51098.2021.9352899openalex-snapshot
Demand-aware Channel Topologies for Off-chain Payments
inferred← citeshttps://doi.org/10.1109/csf64896.2025.00024openalex-snapshot
Improving Count-Mean Sketch as the Leading Locally Differentially Private Frequency Estimator for Large Dictionaries
inferred← citeshttps://doi.org/10.1109/eeei.2014.7005791openalex-snapshot
Randomness extractors and data storage
inferred← citeshttps://doi.org/10.1109/focs.2013.34openalex-snapshot
Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs
inferred← citeshttps://doi.org/10.1109/focs.2015.69openalex-snapshot
Lower Bounds for Clique vs. Independent Set
inferred← citeshttps://doi.org/10.1109/focs.2017.19openalex-snapshot
Random Θ(log n)-CNFs Are Hard for Cutting Planes
inferred← citeshttps://doi.org/10.1109/focs.2017.21openalex-snapshot
Query-to-Communication Lifting for BPP
inferred← citeshttps://doi.org/10.1109/focs.2017.74openalex-snapshot
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More
inferred← citeshttps://doi.org/10.1109/focs.2017.79openalex-snapshot
Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space
inferred← citeshttps://doi.org/10.1109/focs.2018.00029openalex-snapshot
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes
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/focs.2018.00093openalex-snapshot
Pseudorandom Generators for Read-Once Branching Programs, in Any Order
inferred← citeshttps://doi.org/10.1109/focs.2019.00090openalex-snapshot
Junta Correlation is Testable
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00117openalex-snapshot
Extractors and Secret Sharing Against Bounded Collusion Protocols
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00066openalex-snapshot
Improved Extractors for Small-Space Sources
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00075openalex-snapshot
List-Decodability With Large Radius for Reed-Solomon Codes
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00019openalex-snapshot
Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00054openalex-snapshot
Singular Value Approximation and Sparsifying Random Walks on Directed Graphs
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/focs61266.2024.00033openalex-snapshot
On Pigeonhole Principles and Ramsey in TFNP
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00096openalex-snapshot
Improved Condensers for Chor-Goldreich Sources
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00111openalex-snapshot
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
inferred← citeshttps://doi.org/10.1109/icca66035.2025.11430991openalex-snapshot
Quantum-Resilient Zero-Trust Architectures in Edge Computing Networks: Theoretical Foundations and Complexity Bounds
inferred← citeshttps://doi.org/10.1109/icfpt51103.2020.00029openalex-snapshot
Cloud FPGA Security with RO-Based Primitives
inferred← citeshttps://doi.org/10.1109/ipdps57955.2024.00098openalex-snapshot
Parallel Derandomization for Coloring*
inferred← citeshttps://doi.org/10.1109/isc2.2018.8656945openalex-snapshot
Distributed, Private, and Derandomized Allocation Algorithm for EV Charging
inferred← citeshttps://doi.org/10.1109/isit.2017.8007016openalex-snapshot
Asymptotically optimal sticky-insertion-correcting codes with efficient encoding and decoding
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174255openalex-snapshot
Explicit Construction of Multiple Access Channel Resolvability Codes from Source Resolvability Codes
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206999openalex-snapshot
Data Compression with Private Local Decodability
inferred← citeshttps://doi.org/10.1109/ita.2018.8503262openalex-snapshot
Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds
inferred← citeshttps://doi.org/10.1109/jlt.2026.3665249openalex-snapshot
100 Gbit/s Secure and Real-Time Vacuum Fluctuation Based Quantum Random Number Generator
inferred← citeshttps://doi.org/10.1109/q-se59154.2023.00012openalex-snapshot
Can Quantum Computing Improve Uniform Random Sampling of Large Configuration Spaces?
inferred← citeshttps://doi.org/10.1109/smds53860.2021.00038openalex-snapshot
Decentralized Collaborative Learning with Probabilistic Data Protection
inferred← citeshttps://doi.org/10.1109/tcsi.2026.3662486openalex-snapshot
Preserving the Confidentiality of Clinical Images Through a Chaotic Low-Power Hardware Platform and DNA Coding-Based Encryption
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3543044openalex-snapshot
Exfiltration-Resistant Proxy Re-Encryption for IoT Data Sharing in Unreliable Clouds
inferred← citeshttps://doi.org/10.1109/ted.2024.3399170openalex-snapshot
Novel Postprocessing and Sampling Point Optimization Techniques for Enhancing Quality of Randomness in MTJ-Based TRNGs
inferred← citeshttps://doi.org/10.1109/tifs.2025.3581028openalex-snapshot
Error Correction Code Verifiable Computation Consensus
inferred← citeshttps://doi.org/10.1109/tit.2014.2371464openalex-snapshot
Entanglement Sampling and Applications
inferred← citeshttps://doi.org/10.1109/tit.2018.2817519openalex-snapshot
Empirical and Strong Coordination via Soft Covering With Polar Codes
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.1109/tit.2018.2875527openalex-snapshot
Algebraic List-Decoding in Projective Space: Decoding With Multiplicities and Rank-Metric Codes
inferred← citeshttps://doi.org/10.1109/tit.2018.2883306openalex-snapshot
Quantum Query Complexity of Entropy Estimation
inferred← citeshttps://doi.org/10.1109/tit.2019.2946364openalex-snapshot
Communication for Generating Correlation: A Unifying Survey
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.3041650openalex-snapshot
Improved List-Decodability of Random Linear Binary Codes
inferred← citeshttps://doi.org/10.1109/tit.2022.3214372openalex-snapshot
Bias vs Structure of Polynomials in Large Fields, and Applications in Information Theory
inferred← citeshttps://doi.org/10.1109/tit.2023.3306849openalex-snapshot
Decoding Multivariate Multiplicity Codes on Product Sets
inferred← citeshttps://doi.org/10.1109/tit.2023.3345890openalex-snapshot
Ideal-Theoretic Explanation of Capacity-Achieving Decoding
inferred← citeshttps://doi.org/10.1109/tit.2024.3357703openalex-snapshot
Threshold Rates of Code Ensembles: Linear Is Best
inferred← citeshttps://doi.org/10.1109/tit.2024.3402171openalex-snapshot
Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes
inferred← citeshttps://doi.org/10.1109/tit.2025.3577765openalex-snapshot
Rényi Divergence Guarantees for Hashing With Linear Codes
inferred← citeshttps://doi.org/10.1109/tit.2025.3605160openalex-snapshot
Nearly-Linear Time Seeded Extractors With Short Seeds
inferred← citeshttps://doi.org/10.1109/tit.2025.3619440openalex-snapshot
Rényi Divergence-Based Uniformity Guarantees for k -Universal Hash Functions
inferred← citeshttps://doi.org/10.1109/tmc.2016.2561275openalex-snapshot
Anti-Jamming Rendezvous Scheme for Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1109/tnet.2024.3445274openalex-snapshot
Topologies for Blockchain Payment Channel Networks: Models and Constructions
inferred← citeshttps://doi.org/10.1109/tpds.2019.2905568openalex-snapshot
Slow Links, Fast Links, and the Cost of Gossip
inferred← citeshttps://doi.org/10.1109/tvlsi.2019.2927816openalex-snapshot
An Asynchronous and Low-Power True Random Number Generator Using STT-MTJ
inferred← citeshttps://doi.org/10.1109/twc.2017.2728659openalex-snapshot
A Jamming-Resistant Channel Hopping Scheme for Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1112/blms.70161openalex-snapshot
Expanders and growth of normal subsets in finite simple groups of Lie type
inferred← citeshttps://doi.org/10.1134/s0001434624010218openalex-snapshot
Estimates of the Number of Edges in Subgraphs of Johnson Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch23openalex-snapshot
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform
inferred← citeshttps://doi.org/10.1137/120888909openalex-snapshot
Submodular Functions: Learnability, Structure, and Optimization
inferred← citeshttps://doi.org/10.1137/140985251openalex-snapshot
Non-Malleable Codes from Additive Combinatorics
inferred← citeshttps://doi.org/10.1137/15m1027206openalex-snapshot
Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources
inferred← citeshttps://doi.org/10.1137/18m1166869openalex-snapshot
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More
inferred← citeshttps://doi.org/10.1137/18m1197734openalex-snapshot
Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs
inferred← citeshttps://doi.org/10.1137/18m1198429openalex-snapshot
Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds
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/20m1310321openalex-snapshot
Corrigendum: Explicit Construction of a Small 𝜖-Net for Linear Threshold Functions
inferred← citeshttps://doi.org/10.1137/20m134109xopenalex-snapshot
Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space
inferred← citeshttps://doi.org/10.1137/20m1364886openalex-snapshot
Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization
inferred← citeshttps://doi.org/10.1137/20m1366502openalex-snapshot
Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC
inferred← citeshttps://doi.org/10.1137/20m138795xopenalex-snapshot
Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
inferred← citeshttps://doi.org/10.1142/s0129183125500421openalex-snapshot
A pseudo-random number generator on elliptic curves over Galois field using 2D enhanced logistic-quadratic map
inferred← citeshttps://doi.org/10.1145/3029050openalex-snapshot
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform
inferred← citeshttps://doi.org/10.1145/3188745.3188790openalex-snapshot
Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds
inferred← citeshttps://doi.org/10.1145/3188745.3188900openalex-snapshot
An exponential lower bound for individualization-refinement algorithms for graph isomorphism
inferred← citeshttps://doi.org/10.1145/3212734.3212771openalex-snapshot
Interactive Distributed Proofs
inferred← citeshttps://doi.org/10.1145/3309193openalex-snapshot
Optimal Streaming and Tracking Distinct Elements with High Probability
inferred← citeshttps://doi.org/10.1145/3350755.3400282openalex-snapshot
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
inferred← citeshttps://doi.org/10.1145/3356867openalex-snapshot
An Operational Characterization of Mutual Information in Algorithmic Information Theory
inferred← citeshttps://doi.org/10.1145/3357713.3384251openalex-snapshot
Unexpected hardness results for Kolmogorov complexity under uniform reductions
inferred← citeshttps://doi.org/10.1145/3357713.3384279openalex-snapshot
Strong average-case lower bounds from non-trivial derandomization
inferred← citeshttps://doi.org/10.1145/3357713.3384283openalex-snapshot
Sharp threshold results for computational complexity
inferred← citeshttps://doi.org/10.1145/3357713.3384295openalex-snapshot
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
inferred← citeshttps://doi.org/10.1145/3373718.3394809openalex-snapshot
Sparse Hashing for Scalable Approximate Model Counting
inferred← citeshttps://doi.org/10.1145/3382734.3404504openalex-snapshot
Efficient Deterministic Distributed Coloring with Small Bandwidth
inferred← citeshttps://doi.org/10.1145/3404860openalex-snapshot
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators
inferred← citeshttps://doi.org/10.1145/3406325.3451027openalex-snapshot
Decoding multivariate multiplicity codes on product sets
inferred← citeshttps://doi.org/10.1145/3465084.3467903openalex-snapshot
Component Stability in Low-Space Massively Parallel Computation
inferred← citeshttps://doi.org/10.1145/3465084.3467909openalex-snapshot
Can We Break Symmetry with o(m) Communication?
inferred← citeshttps://doi.org/10.1145/3465084.3467937openalex-snapshot
Improved Deterministic (Δ+1) Coloring in Low-Space MPC
inferred← citeshttps://doi.org/10.1145/3470861openalex-snapshot
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates
inferred← citeshttps://doi.org/10.1145/3486680openalex-snapshot
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes
inferred← citeshttps://doi.org/10.1145/3519270.3538438openalex-snapshot
Overcoming Congestion in Distributed Coloring
inferred← citeshttps://doi.org/10.1145/3519270.3538472openalex-snapshot
Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling Sets
inferred← citeshttps://doi.org/10.1145/3538391openalex-snapshot
Beyond Natural Proofs: Hardness Magnification and Locality
inferred← citeshttps://doi.org/10.1145/3555307openalex-snapshot
Nearly Optimal Pseudorandomness from Hardness
inferred← citeshttps://doi.org/10.1145/3564246.3585109openalex-snapshot
Extractors for Images of Varieties
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/3618260.3649711openalex-snapshot
Hardness Condensation by Restriction
inferred← citeshttps://doi.org/10.1145/3708891openalex-snapshot
The Iteration Number of the Weisfeiler-Leman Algorithm
inferred← citeshttps://doi.org/10.1145/3716368.3735287openalex-snapshot
Robust Data Processing for Vector Symbolic Computing
inferred← citeshttps://doi.org/10.1145/3717823.3718155openalex-snapshot
Quantum Communication Advantage in TFNP
inferred← citeshttps://doi.org/10.1145/3760771openalex-snapshot
The Computational Advantage of MIP* Vanishes in the Presence of Noise
inferred← citeshttps://doi.org/10.1145/3798129.3800838openalex-snapshot
Hardness Amplification beyond Boolean Functions
inferred← citeshttps://doi.org/10.1145/3798129.3800842openalex-snapshot
A Theory for Probabilistic Polynomial-Time Reasoning
inferred← citeshttps://doi.org/10.1145/3798129.3800879openalex-snapshot
SVP p Is Deterministically NP-Hard for All p > 2, Even to Approximate within a Factor of 2 log 1-ε n
inferred← citeshttps://doi.org/10.1145/3798129.3800891openalex-snapshot
Testing Distributions against Bounded Distinguishers
inferred← citeshttps://doi.org/10.1145/3807503.3819358openalex-snapshot
Learning and Neutralizing Structured Stochasticity in DNA Synthesis for Deterministic Entropy Conditioning
inferred← citeshttps://doi.org/10.1145/3816782.3819203openalex-snapshot
Deterministic Distance Approximation in MPC via Improved Hitting Sets
showing the first 200 of 224 · page through all 224
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.