Skip to main content

Search

Reset

Add filters:

Use filters to refine the search results.

 | 
Item hits:
Publication DateArticle TitleAuthor(s)
2017A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk)Farzan, Azadeh; Kincaid, Zachary
2017Superquadratic Lower Bound for 3-Query Locally Correctable Codes over the RealsDvir, Zeev; Saraf, Shubhangi; Wigderson, Avi
2012Extractors for varietiesDvir, Zeev
Jun-2019Static data structure lower bounds imply rigidityDvir, Zeev; Golovnev, Alexander; Weinstein, Omri
2011Tight Lower Bounds for 2-query LCCs over Finite FieldsBhattacharyya, Arnab; Dvir, Zeev; Shpilka, Amir; Saraf, Shubhangi
2018Rank bounds for design matrices with block entries and geometric applicationsDvir, Zeev; Garg, Ankit; Oliveira, Rafael; Solymosi, József
2014Improved Rank Bounds for Design Matrices and a New Proof of Kelly's TheoremDvir, Zeev; Saraf, Shubhangi; Wigderson, Avi
2019On the Number of Ordinary Lines Determined by Sets in Complex SpaceBasit, Abdul; Dvir, Zeev; Saraf, Shubhangi; Wolf, Charles
2014Sylvester-Gallai Type Theorems for Approximate CollinearityAi, Albert; Dvir, Zeev; Saraf, Shubhangi; Wigderson, Avi
2019Matrix Rigidity and the Croot-Lev-Pach LemmaDvir, Zeev; Edelman, Benjamin L