Pages that link to "Item:Q3452216"

The following pages link to Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes (Q3452216):

Displaying 50 items.

• Derandomized parallel repetition theorems for free games (Q371195) (← links)
• Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
• Short lists for shortest descriptions in short time (Q475336) (← links)
• Bounded-depth circuits cannot sample good codes (Q692999) (← links)
• Better short-seed quantum-proof extractors (Q764353) (← links)
• On rigid matrices and \(U\)-polynomials (Q901935) (← links)
• The complexity of the matroid-greedoid partition problem (Q1006060) (← links)
• Non-interactive timestamping in the bounded-storage model (Q1015360) (← links)
• How to extract useful randomness from unreliable sources (Q2055615) (← links)
• Low error efficient computational extractors in the CRS model (Q2055616) (← links)
• Side-channel masking with pseudo-random generator (Q2055660) (← links)
• Non-malleability against polynomial tampering (Q2102059) (← links)
• Expander-based cryptography meets natural proofs (Q2125080) (← links)
• Game-theoretic fairness meets multi-party protocols: the case of leader election (Q2128554) (← links)
• Improved computational extractors and their applications (Q2129010) (← links)
• Adaptive extractors and their application to leakage resilient secret sharing (Q2129011) (← links)
• A PCP theorem for interactive proofs and applications (Q2170038) (← links)
• Immunization against complete subversion without random oracles (Q2227487) (← links)
• Lossless dimension expanders via linearized polynomials and subspace designs (Q2236661) (← links)
• Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive'' derandomization (Q2254499) (← links)
• Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500) (← links)
• Explicit two-source extractors and resilient functions (Q2320598) (← links)
• Shift lifts preserving Ramanujan property (Q2361560) (← links)
• From graphs to keyed quantum hash functions (Q2361672) (← links)
• List-decoding Barnes-Wall lattices (Q2410678) (← links)
• A combinatorial approach to quantum random functions (Q2692397) (← links)
• Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
• Certifiable quantum dice (Q2941597) (← links)
• Derandomized Construction of Combinatorial Batch Codes (Q2947886) (← links)
• An Introduction to Randomness Extractors (Q3012907) (← links)
• A Sample of Samplers: A Computational Perspective on Sampling (Q3088190) (← links)
• Increasing the output length of zero-error dispersers (Q3119044) (← links)
• Local Correlation Breakers and Applications to Three-Source Extractors and Mergers (Q3187171) (← links)
• Zero-Fixing Extractors for Sub-Logarithmic Entropy (Q3448797) (← links)
• Parallel Hashing via List Recoverability (Q3457065) (← links)
• Increasing the Output Length of Zero-Error Dispersers (Q3541810) (← links)
• Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
• Flavors of Compressive Sensing (Q4609797) (← links)
• On Low-Risk Heavy Hitters and Sparse Recovery Schemes (Q5009511) (← links)
• (Q5009532) (← links)
• Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions (Q5048295) (← links)
• Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
• An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy (Q5073519) (← links)
• Expander-Based Cryptography Meets Natural Proofs (Q5090391) (← links)
• (Q5091259) (← links)
• (Q5091780) (← links)
• (Q5092476) (← links)
• (Q5092479) (← links)
• Local List Recovery of High-Rate Tensor Codes and Applications (Q5117374) (← links)
• (Q5121892) (← links)