4. Talks

With Great Speed Come Small Buffers, ACM Principles of Distributed Computing (PODC) 2019, Toronto, Canada. (slides) On the Volume Complexity of LCLs, Workshop on Local Algorithms (WOLA) 2019, Zurich, Switzerland. (slides) Space-Optimal Packet Routing on Trees, IEEE International Conference on Computer Communications (INFOCOM) 2019, Paris, France. (slides) Best In-Session Presentation Award On Sampling Edges Almost Uniformly, Symposium on Simplicity in Algorithms (SOSA) 2018, New Orleans, LA. (slides) The Space Requirement of Local Forwarding on Acyclic Networks, PODC 2017, Washington DC. (conference slides, seminar slides) Space-time Tradeoffs for Distributed Verification, PODC…

Keep reading

3. Journal Articles and Manuscripts

A stable marriage requires communication (with Yannai Gonczarowski, Noam Nisan, and Rafail Ostrovsky). Games and Economic Behavior, 2019. (ScienceDirect, arXiv) Distributed Almost Stable Matchings PhD Dissertation, UCLA 2016. (pdf) Analysis on Circles: A Modern View of Fourier Series Undergraduate Thesis, Reed College, 2019. (pdf)…

Keep reading

2. Refereed Conference Proceedings

Preprints & In Submission Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems (with Jukka Suomela). (arXiv) 2019 Space-Optimal Nearly-Local Forwarding on Trees (with Boaz Patt-Shamir). IEEE International Conference on Computer Communications (INFOCOM) 2019. (IEEE) The Arboricity Captures the Complexity of Sampling Edges (with Talya Eden and Dana Ron). International Colloquium on Automata, Languages and Programming (ICALP) 2019. (DROPS, arXiv) With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing (with Avery Miller and Boaz Patt-Shamir). ACM Symposium on Principles of Distributed Computing (PODC) 2019. (ACM-DL, arXiv) Fault…

Keep reading

1. Overview

It is a common theme in algorithm design—as in everyday life—that we must make decisions based on incomplete, inaccurate, or ambiguous information. Uncertainty may arise as a result of locality (relevant information is located far away), congestion (data can only be moved at a fixed rate), variability in the outcomes of concurrent and future events, or the behavior of noisy, self-interested, or malicious elements. Even if information can be obtained reliably, there may simply be too much data to disseminate before we must make a decision. The central…

Keep reading

Real Analysis

Introductory Real Analysis (Math 131A @ UCLA) Final Review Questions (Spring 2013) Final Review Solutions (Spring 2013) The Binomial Theorem (Spring 2013) The Triangle Inequality (Spring 2013)…

Keep reading