Papers


Parallel Greedy SpannersPreprint
with Bernhard Haeupler, Zihan Tan
[pdf]

Simple Length-Constrained Minimum Spanning TreesSOSA 2025
with Richard Z Huang
(Symposium on Simplicity in Algorithms)
[pdf]

Efficient Centroid-Linkage ClusteringNeurIPS 2024
with M.H. Bateni, L. Dhulipala, W. Fletcher, K. Gowda, R. Jayaram, J. Lacki
(Conference on Neural Information Processing Systems)
[pdf]

New Structures and Algorithms for LC Expander DecompositionsFOCS 2024
with Bernhard Haeupler, Zihan Tan
(Symposium on Foundations of Computer Science)

It’s Hard to HAC with Average Linkage!ICALP 2024
with M.H. Bateni, L. Dhulipala, K. Gowda, R. Jayaram, J. Lacki
(Int'l Colloquium on Automata, Languages and Programming)
[pdf]

Ghost Value Augmentation for k-Edge-ConnectivitySTOC 2024
with Nathan Klein, Rico Zenklusen
(Symposium on Theory of Computing)
Invited to SICOMP Special Issue

Low-Step Multi-Commodity Flow EmulatorsSTOC 2024
with B. Haeupler, J. Li, A. Röyskö, T. Saranurak
(Symposium on Theory of Computing)

One Tree to Rule Them All: Poly-Logarithmic Universal Steiner TreeFOCS 2023
with C. Busch, D.Q. Chen, A. Filtser, D. Hathcock, R. Rajaraman
(Symposium on Foundations of Computer Science)

Maximum Length-Constrained Flows and Disjoint Paths...STOC 2023
with Bernhard Haeupler, Thatchaphol Saranurak
(Symposium on Theory of Computing)

O(1) Steiner Point Removal in Series-Parallel GraphsESA 2022
with Jason Li
(European Symposium on Algorithms)
[pdf]

Deterministic Tree Embeddings with Copies...ESA 2022
with Bernhard Haeupler, Goran Zuzic
(European Symposium on Algorithms)
[pdf]

Near-Optimal Schedules for Simultaneous MulticastsICALP 2021
with Bernhard Haeupler, David Wajc
(Int'l Colloquium on Automata, Languages and Programming)

Tree Embeddings for Hop-Constrained Network DesignSTOC 2021
with Bernhard Haeupler, Goran Zuzic
(Symposium on Theory of Computing)

District-Fair Participatory BudgetingAAAI 2021
with Anson Kahng, Dominik Peters, Ariel D. Procaccia
(AAAI Conference on Artificial Intelligence)

An Optimal Rounding for Half-Integral Weighted MSCSSIPL 2020
with Gregory Kehne, R. Ravi
(Information Processing Letters)
[pdf]

Reverse Greedy is Bad for k-CenterIPL 2020
with Gregory Kehne
(Information Processing Letters)
[pdf]

Computation-Aware Data AggregationITCS 2020
with Bernhard Haeupler, Anson Kahng, Ariel D. Procaccia
(Innovations in Theoretical Computer Science)
[pdf]

Erasure Correction for Noisy Radio NetworksDISC 2019
with Keren Censor-Hillel, Bernhard Haeupler, Goran Zuzic
(Int'l Symposium on Distributed Computing)

...Algorithms for Reconfigurable Resources Under UncertaintyAPPROX 2019
with R. Ravi, Sahil Singla
(Int'l Conference on Apx. Algos. for Comb. Opt. Problems)
[pdf]

Finding Options that Minimize Planning TimeICML 2019
with Yuu Jinnai, David Abel, Michael L. Littman, George Konidaris
(Int'l Conference on Machine Learning)
[pdf]

Round- and Message-Optimal Distributed Graph AlgorithmsPODC 2018
with Bernhard Haeupler, David Wajc
(Symposium on Principles of Distributed Computing)

Broadcasting in Noisy Radio NetworksPODC 2017
with Keren Censor-Hillel, Bernhard Haeupler, Goran Zuzic
(Symposium on Principles of Distributed Computing)

Near Optimal Behavior via Approximate State AbstractionICML 2016
with David Abel, Michael L. Littman
(Int'l Conference on Machine Learning)
[pdf]

Goal-Based Action PriorsICAPS 2015
with David Abel, Gabriel Barth-Maron, Stephen Brawner, Kevin O'Farrell, James MacGlashan, Stefanie Tellex
(Int'l Conference on Automated Planning and Scheduling)