No. Title Author Year
1 Lifting with Sunflowers Lovett, Shachar et al. 2022
2 Fractional Pseudorandom Generators from Any Fourier Level Chattopadhyay, Eshan et al. 2021
3 Singularity of Random Integer Matrices with Large Entries Karingula, Sankeerth Rao et al. 2021
4 Sign Rank vs Discrepancy Hatami, Hamed et al. 2020
5 Equality Alone Does not Simulate Randomness Chattopadhyay, Arkadev et al. 2019
6 From DNF Compression to Sunflower Theorems via Regularity Lovett, Shachar et al. 2019
7 Optimality of Linear Sketching Under Modular Updates Hosseini, Kaave et al. 2019
8 Generalized Comparison Trees for Point-Location Problems Kane, Daniel M. et al. 2018
9 Hardness Amplification for Non-Commutative Arithmetic Circuits Carmosino, Marco L. et al. 2018
10 Pseudorandom Generators from Polarizing Random Walks Chattopadhyay, Eshan et al. 2018
11 Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates Chattopadhyay, Eshan et al. 2018
12 Sunflowers and Quasi-Sunflowers from Randomness Extractors Li, Xin et al. 2018
13 Torus Polynomials: An Algebraic Approach to ACC Lower Bounds Bhrushundi, Abhishek et al. 2018
14 On the Beck-Fiala Conjecture for Random Set Systems Ezra, Esther et al. 2016
15 Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem Dadush, Daniel et al. 2016
16 Large Supports are Required for Well-Supported Nash Equilibria Anbalagan, Yogesh et al. 2015
17 Nonclassical Polynomials as a Barrier to Polynomial Lower Bounds Bhowmick, Abhishek et al. 2015
18 Lower bounds for adaptive linearity tests Lovett, Shachar 2008
Current Page :
Number of result pages: 1
Number of documents: 18


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