Publications

These papers represent my attempts to do econ and finance:

1. Six solutions to the money supply problem

   [Research Works 2025], [SSRN 2025]
2. Decentralized money supply: A new paradigm for reserve currencies

   [Research Works 2025, SSRN 2025]
3. Elastic cash

   [arxiv 2023]
4. A theory of market efficiency

   [arxiv 2017], Slides, [Code for Demo]

1. Monotone circuit lower bounds from spread matchings

   [Manuscript, 2026]
2. The story of sunflowers

   [Journal of the London Mathematical Society, 2025]
3. An XOR lemma for deterministic communication complexity

   with Siddharth Iyer. [FOCS 2024]
4. XOR lemmas for communication via marginal information

   with Siddharth Iyer. [STOC 2024]
5. A criterion for decoding on the BSC

   with Oscar Sprumont. [Advances in Mathematics of Communication 2024]
6. Sunflowers: From soil to oil

   [Bulletin of the AMS, 2023] [video]
7. Anti-concentration and the exact gap-Hamming problem

   with Amir Yehudayoff. [Siam Journal on Discrete Mathematics 2022], [video]
8. Tight bounds on the Fourier growth of bounded functions on the hypercube

   with Siddharth Iyer, Victor Reis, Thomas Rothvoss and Amir Yehudayoff. [Manuscript 2021]
9. Coding for sunflowers

   [Discrete Analysis 2020], [video]
10. Lower bounds on balancing sets and depth-2 threshhold circuits

    with Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy and Amir Yehudayoff. [ICALP 2019]
11. On expressing majority as a majority of majorities

    with Christian Engels, Mohit Garg and Kazuhisa Makino. [Siam Journal on Discrete Mathematics 2019]
12. Lower bounds on non-adaptive data structures maintaining sets of numbers, from sunflowers

    with Sivaramakrishnan Natarajan Ramamoorthy. [CCC 2018]
13. Simplified separation of information and communication

    with Makrand Sinha [Theory of Computing 2017]
14. A direct sum theorem for read-once branching programs

    with Makrand Sinha [Random 2016]
15. Forbidden subgraph bounds for parallel repetition and the density Hales-Jewett theorem

    with Jan Hazla and Thomas Holenstein. [Manuscript 2016]
16. How to compress asymmetric communication

    with Sivaramakrishnan Ramamoorthy. [CCC 2015]
17. Simplified lower bounds on the multiparty communication complexity of disjointness

    with Amir Yehudayoff. [CCC 2015]
18. Circuits with medium fan-in

    with Pavel Hrubes. [CCC 2015]
19. Direct products in communication complexity

    with Mark Braverman, Omri Weinstein, and Amir Yehudayoff. [FOCS 2013] (video)
20. Direct products via round-preserving compression

    with Mark Braverman, Omri Weinstein, and Amir Yehudayoff. [ICALP 2013]
21. Restriction access

    with Zeev Dvir, Avi Wigderson and Amir Yehudayoff. [ITCS 2012]
22. Formulas resilient to short-circuit errors

    with Yael Tauman Kalai and Allison Lewko. [FOCS 2012]
23. Towards coding for maximum errors in interactive communication

    with Mark Braverman. [STOC 2011] (video)
24. Information equals amortized communication

    with Mark Braverman. [FOCS 2011]
25. How to compress interactive communication

    with Boaz Barak, Mark Braverman and Xi Chen. [STOC 2010] (video)
26. A strong parallel repetition theorem for free projection games

    with Boaz Barak, Ran Raz, Ricky Rosen and Ronen Shaltiel. [Random 2009]
27. Rounding parallel repetitions of unique games

    with Boaz Barak, Moritz Hardt, Ishay Haviv, Oded Regev and David Steurer. [FOCS 2008]
28. Spherical cubes and rounding in high dimensions

    with Guy Kindler, Ryan O'Donnell and Avi Wigderson. [FOCS 2008]
29. Parallel repetition in projection games and a concentration bound

    [STOC 2008, SICOMP Special Issue for STOC08]

1. Pseudorandom generators for regular branching programs

   with Mark Braverman, Ran Raz and Amir Yehudayoff. [FOCS 2010] (video)
2. 2-source extractors under computational assumptions and cryptography with defective randomness

   with Yael Tauman Kalai and Xin Li. [FOCS 2009] (hi-res video) (low-res video)
3. Extractors for low-weight affine sources

   [CCC 2009]
4. Network extractor protocols

   with Yael Tauman Kalai, Xin Li and David Zuckerman. [FOCS 2008]
5. Extractors for three uneven-length sources

   with David Zuckerman. [Random 2008]
6. A 2-source almost-extractor for linear entropy

   [Random 2008]
7. Randomness extractors for independent sources and applications (Ph.D. Thesis)
8. An exposition of Bourgain's 2-source extractor

   [ECCC Technical Report 2007]
9. 2-source dispersers for n^o(1) entropy and Ramsey graphs beating the Frankl-Wilson construction

   with Boaz Barak, Ronen Shaltiel and Avi Wigderson. [STOC 2006]
10. Deterministic extractors for small space sources

    with Jesse Kamp, Salil Vadhan and David Zuckerman. [STOC 2006, J. of Computer and System Sciences] (talk)
11. Extractors for a constant number of polynomially small min-entropy independent sources

    [STOC 2006, Volume 39, Issue 1, Siam Journal on Computing]. Co-Winner of the Best Student Paper Award. (video), (talk.ppt)

1. A technique for dynamic updating of Java software

   with Alessandro Orso and Mary Jean Harrold. International Conference on Software Maintanence 2002, pp. 649--658.