# publications

a compendium of my publications

Graduate student co-authors are indicated with an asterisk (*), and undergraduate student co-authors are indicated with a double asterisk (**).

## 2023

## 2022

## 2021

## 2020

## 2019

- The Arboricity Captures the Complexity of Sampling Edges
*In 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece.*2019 - With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing
*In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019.*2019 - Fault Tolerant Gradient Clock Synchronization
*In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019.*2019 - Space-Optimal Packet Routing on Trees
*In 2019 IEEE Conference on Computer Communications, INFOCOM 2019, Paris, France, April 29 - May 2, 2019*2019

## 2018

- Lower Bounds for Approximating Graph Parameters via Communication Complexity
*In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, August 20-22, 2018 - Princeton, NJ, USA*2018 - On Sampling Edges Almost Uniformly
*In 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA*2018

## 2017

- The Space Requirement of Local Forwarding on Acyclic Networks
*In Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017*2017 - Space-Time Tradeoffs for Distributed Verification
*In Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Porquerolles, France, June 19-22, 2017, Revised Selected Papers*2017

## 2016

- Brief Announcement: Space-Time Tradeoffs for Distributed Verification
*In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016*2016 - Distributed Almost Stable Matchings (PhD Thesis)2016

## 2015

- Fast Distributed Almost Stable Matchings
*In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebastián, Spain, July 21 - 23, 2015*2015 - A Stable Marriage Requires Communication
*In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015*2015 - It’s Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems
*In Proceedings of the 3rd International Workshop on Matching Under Preferences*2015