Learning Propositional Functions for Planning and Reinforcement Learning. - David Ellis Hershkowitz; James MacGlashan; Stefanie Tellex (AAAI Fall Symposia, 2015)

Goal-Based Action Priors. - David Abel; D. Ellis Hershkowitz; Gabriel Barth-Maron; Stephen Brawner; Kevin O'Farrell; James MacGlashan; Stefanie Tellex (ICAPS, 2015)

Near Optimal Behavior via Approximate State Abstraction. - David Abel; D. Ellis Hershkowitz; Michael L. Littman (ICML, 2016)

Broadcasting in Noisy Radio Networks. - Keren Censor-Hillel; Bernhard Haeupler; D. Ellis Hershkowitz; Goran Zuzic (PODC, 2017)

Round- and Message-Optimal Distributed Graph Algorithms. - Bernhard Haeupler; D. Ellis Hershkowitz; David Wajc (PODC, 2018)

Round- and Message-Optimal Distributed Part-Wise Aggregation. - Bernhard Haeupler; D. Ellis Hershkowitz; David Wajc (CoRR, 2018)

A Computational Approach to Organizational Structure. - Bernhard Haeupler; D. Ellis Hershkowitz; Anson Kahng; Ariel D. Procaccia (CoRR, 2018)

Reverse Greedy is Bad for k-Center. - D. Ellis Hershkowitz; Gregory Kehne (CoRR, 2018)

Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty. - David Ellis Hershkowitz; R. Ravi 001; Sahil Singla 001 (APPROX-RANDOM, 2019)

Finding Options that Minimize Planning Time. - Yuu Jinnai; David Abel; David Ellis Hershkowitz; Michael L. Littman; George Dimitri Konidaris (ICML, 2019)

Erasure Correction for Noisy Radio Networks. - Keren Censor-Hillel; Bernhard Haeupler; D. Ellis Hershkowitz; Goran Zuzic (DISC, 2019)

Computation-Aware Data Aggregation. - Bernhard Haeupler; D. Ellis Hershkowitz; Anson Kahng; Ariel D. Procaccia (ITCS, 2020)

Reverse greedy is bad for k-center. - D. Ellis Hershkowitz; Gregory Kehne (Inf. Process. Lett., 2020)

District-Fair Participatory Budgeting. - D. Ellis Hershkowitz; Anson Kahng; Dominik Peters; Ariel D. Procaccia (AAAI, 2021)

Near-Optimal Schedules for Simultaneous Multicasts. - Bernhard Haeupler; D. Ellis Hershkowitz; David Wajc (ICALP, 2021)

Tree embeddings for hop-constrained network design. - Bernhard Haeupler; D. Ellis Hershkowitz; Goran Zuzic (STOC, 2021)

Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries. - Bernhard Haeupler; D. Ellis Hershkowitz; Goran Zuzic (CoRR, 2021)

Bad-Policy Density: A Measure of Reinforcement Learning Hardness. - David Abel; Cameron Allen; Dilip Arumugam; D. Ellis Hershkowitz; Michael L. Littman; Lawson L. S. Wong (CoRR, 2021)

Fast Algorithms for Hop-Constrained Flows and Moving Cuts. - Bernhard Haeupler; D. Ellis Hershkowitz; Thatchaphol Saranurak (CoRR, 2021)

An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph. - D. Ellis Hershkowitz; Gregory Kehne; R. Ravi 001 (Inf. Process. Lett., 2021)

Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings. - Bernhard Haepler; D. Ellis Hershkowitz; Goran Zuzic (ESA, 2022)

O(1) Steiner Point Removal in Series-Parallel Graphs. - D. Ellis Hershkowitz; Jason Li (ESA, 2022)

One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree. - Costas Busch; Da Qi Chen; Arnold Filtser; Daniel Hathcock; D. Ellis Hershkowitz; Rajmohan Rajaraman (FOCS, 2023)

Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast. - Bernhard Haeupler; D. Ellis Hershkowitz; Thatchaphol Saranurak (STOC, 2023)

Parallel Greedy Spanners. - Bernhard Haeupler; D. Ellis Hershkowitz; Zihan Tan (CoRR, 2023)

Ghost Value Augmentation for k-ECSS and k-ECSM. - D. Ellis Hershkowitz; Nathan Klein; Rico Zenklusen (CoRR, 2023)

New Structures and Algorithms for Length-Constrained Expander Decompositions. - Bernhard Haeupler; D. Ellis Hershkowitz; Zihan Tan (FOCS, 2024)

It's Hard to HAC Average Linkage! - MohammadHossein Bateni; Laxman Dhulipala; Kishen N. Gowda; D. Ellis Hershkowitz; Rajesh Jayaram; Jakub Lacki (ICALP, 2024)

Efficient Centroid-Linkage Clustering. - Mohammad Hossein Bateni 001; Laxman Dhulipala; Willem Fletcher; Kishen N. Gowda; D. Ellis Hershkowitz; Rajesh Jayaram; Jakub Lacki (NeurIPS, 2024)

Low-Step Multi-commodity Flow Emulators. - Bernhard Haeupler; D. Ellis Hershkowitz; Jason Li 006; Antti Roeyskoe; Thatchaphol Saranurak (STOC, 2024)

Ghost Value Augmentation for k-Edge-Connectivity. - D. Ellis Hershkowitz; Nathan Klein; Rico Zenklusen (STOC, 2024)

Simple Length-Constrained Minimum Spanning Trees. - D. Ellis Hershkowitz; Richard Z. Huang (SOSA, 2025)

Parallel Hierarchical Agglomerative Clustering in Low Dimensions. - MohammadHossein Bateni; Laxman Dhulipala; Willem Fletcher; Kishen N. Gowda; D. Ellis Hershkowitz; Rajesh Jayaram; Jakub Lacki (CoRR, 2025)