No. Title Author Year
1 High-Probability List-Recovery, and Applications to Heavy Hitters Doron, Dean et al. 2022
2 New Near-Linear Time Decodable Codes Closer to the GV Bound Blanc, Guy et al. 2022
3 Error Reduction for Weighted PRGs Against Read Once Branching Programs Cohen, Gil et al. 2021
4 Pseudorandom Generators for Read-Once Monotone Branching Programs Doron, Dean et al. 2021
5 Log-Seed Pseudorandom Generators via Iterated Restrictions Doron, Dean et al. 2020
6 Near-Optimal Erasure List-Decodable Codes Ben-Aroya, Avraham et al. 2020
7 On Hitting-Set Generators for Polynomials That Vanish Rarely Doron, Dean et al. 2020
8 Spectral Sparsification via Bounded-Independence Sampling Doron, Dean et al. 2020
9 Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas Doron, Dean et al. 2019
10 Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions Ben-Aroya, Avraham et al. 2019
11 A New Approach for Constructing Low-Error, Two-Source Extractors Ben-Aroya, Avraham et al. 2018
12 Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers Doron, Dean et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 12

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI