On the Power of Anonymous One-Way Communication. - Dana Angluin; James Aspnes; David Eisenstat; Eric Ruppert (OPODIS, 2005)

Stably computable predicates are semilinear. - Dana Angluin; James Aspnes; David Eisenstat (PODC, 2006)

Non-isomorphic caterpillars with identical subtree data. - David Eisenstat; Gary Gordon (Discret. Math., 2006)

The computational power of population protocols. - Dana Angluin; James Aspnes; David Eisenstat; Eric Ruppert (Distributed Comput., 2007)

The VC dimension of k-fold union. - David Eisenstat; Dana Angluin (Inf. Process. Lett., 2007)

A two-enqueuer queue - David Eisenstat (CoRR, 2008)

Expected rank and randomness in rooted graphs. - David Eisenstat; Jennifer Feder; Greg Francos; Gary Gordon; Amanda Redlich (Discret. Appl. Math., 2008)

A simple population protocol for fast robust approximate majority. - Dana Angluin; James Aspnes; David Eisenstat (Distributed Comput., 2008)

Fast computation by population protocols with a leader. - Dana Angluin; James Aspnes; David Eisenstat (Distributed Comput., 2008)

Combinatorial Properties of a Rooted Graph Polynomial. - David Eisenstat; Gary Gordon; Amanda Redlich (SIAM J. Discret. Math., 2008)

k-Fold unions of low-dimensional concept classes. - David Eisenstat (Inf. Process. Lett., 2009)

Learning Acyclic Probabilistic Circuits Using Test Paths. - Dana Angluin; James Aspnes; Jiang Chen; David Eisenstat; Lev Reyzin (J. Mach. Learn. Res., 2009)

Lower Bounds on Learning Random Structures with Statistical Queries. - Dana Angluin; David Eisenstat; Leonid Kontorovich; Lev Reyzin (ALT, 2010)

Storage Capacity of Labeled Graphs. - Dana Angluin; James Aspnes; Rida A. Bazzi; Jiang Chen; David Eisenstat; Goran Konjevod (SSS, 2010)

Random Road Networks: The Quadtree Model. - David Eisenstat (ANALCO, 2011)

An efficient polynomial-time approximation scheme for Steiner forest in planar graphs. - David Eisenstat; Philip N. Klein; Claire Mathieu (SODA, 2012)

Low-contention data structures. - James Aspnes; David Eisenstat; Yitong Yin (J. Parallel Distributed Comput., 2012)

Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs. - David Eisenstat; Philip N. Klein (STOC, 2013)

Facility Location in Evolving Metrics. - David Eisenstat; Claire Mathieu; Nicolas Schabanel (ICALP (2), 2014)

Approximating k-center in planar graphs. - David Eisenstat; Philip N. Klein; Claire Mathieu (SODA, 2014)

Effective storage capacity of labeled graphs. - Dana Angluin; James Aspnes; Rida A. Bazzi; Jiang Chen; David Eisenstat; Goran Konjevod (Inf. Comput., 2014)

Toward Practical Planar Graph Algorithms. - David Eisenstat (2014)

Time-Space Trade-offs in Population Protocols. - Dan Alistarh; James Aspnes; David Eisenstat; Rati Gelashvili; Ronald L. Rivest (SODA, 2017)

Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. - Laxman Dhulipala; David Eisenstat; Jakub Lacki; Vahab S. Mirrokni; Jessica Shi 001 (ICML, 2021)

Scalable Community Detection via Parallel Correlation Clustering. - Jessica Shi 001; Laxman Dhulipala; David Eisenstat; Jakub Lacki; Vahab S. Mirrokni (Proc. VLDB Endow., 2021)

Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. - Laxman Dhulipala; David Eisenstat; Jakub Lacki; Vahab Mirrokni; Jessica Shi 001 (NeurIPS, 2022)

Design and Analysis of Bipartite Experiments Under a Linear Exposure-response Model. - Christopher Harshaw; Fredrik Sävje; David Eisenstat; Vahab Mirrokni; Jean Pouget-Abadie (EC, 2022)

The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering. - Shangdi Yu; Jessica Shi 001; Jamison Meindl; David Eisenstat; Xiaoen Ju; Sasan Tavakkol; Laxman Dhulipala; Jakub Lacki; Vahab Mirrokni; Julian Shun (Proc. VLDB Endow., 2024)