Below is a complete list of my published work.
Distributed Almost Stable Matchings. PhD Dissertation, UCLA, 2016. (pdf)
Analysis on Circles: A Modern View of Fourier Series. Undergraduate Thesis, Reed College, 2009. (pdf)
Preprints & In Submission
The Arboricity Captures the Complexity of Sampling Edges (with Talya Eden and Dana Ron). (arXiv)
With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing (with Avery Miller and Boaz Patt-Shamir). (arXiv)
Fault Tolerant Gradient Clock Synchronization (with Johannes Bund and Christoph Lenzen). (arXiv)
Refereed Conference Proceedings
Space-Optimal Nearly-Local Forwarding on Trees (with Boaz Patt-Shamir). IEEE International Conference on Computer Communications (INFOCOM) 2019.
Lower Bounds for Approximating Graph Parameters via Communication Complexity (with Talya Eden). The 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2018. (DROPS, arXiv)
The Space Requirement of Local Forwarding on Acyclic Networks (with Boaz Patt-Shamir). ACM Symposium on Principles of Distributed Computing (PODC), 2017. (ACM-DL)
Brief Announcement: Space-Time Tradeoffs for Distributed Verification (with Mor Baruch and Rafail Ostrovsky). ACM Symposium on Principles of Distributed Computing (PODC), 2016. (ACM-DL)
It’s Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems (with Rafail Ostrovsky). International Workshop on Matching Under Preferences (MATCH-UP), 2015. (arXiv)