David Eisenstat

According to our database, David Eisenstat authored at least 28 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering.

Shangdi Yu, Jessica Shi, Jamison Meindl, David Eisenstat, Xiaoen Ju, Sasan Tavakkol, Laxman Dhulipala, Jakub Lacki, Vahab Mirrokni, Julian Shun

CoRR, 2024

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

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth.

Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Scalable Community Detection via Parallel Correlation Clustering.

Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni

Proc. VLDB Endow., 2021

Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time.

Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi

Proceedings of the 38th International Conference on Machine Learning, 2021

2017

Time-Space Trade-offs in Population Protocols.

Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2014

Toward Practical Planar Graph Algorithms.

David Eisenstat

PhD thesis, 2014

Effective storage capacity of labeled graphs.

Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod

Inf. Comput., 2014

Approximating <i>k</i>-center in planar graphs.

David Eisenstat, Philip N. Klein, Claire Mathieu

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Facility Location in Evolving Metrics.

David Eisenstat, Claire Mathieu, Nicolas Schabanel

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs.

David Eisenstat, Philip N. Klein

Proceedings of the Symposium on Theory of Computing Conference, 2013

2012

Low-contention data structures.

James Aspnes, David Eisenstat, Yitong Yin

J. Parallel Distributed Comput., 2012

An efficient polynomial-time approximation scheme for Steiner forest in planar graphs.

David Eisenstat, Philip N. Klein, Claire Mathieu

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Random Road Networks: The Quadtree Model.

David Eisenstat

Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

2010

Storage Capacity of Labeled Graphs.

Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Lower Bounds on Learning Random Structures with Statistical Queries.

Dana Angluin, David Eisenstat, Leonid Kontorovich, Lev Reyzin

Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009

Learning Acyclic Probabilistic Circuits Using Test Paths.

Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin

J. Mach. Learn. Res., 2009

k-Fold unions of low-dimensional concept classes.

David Eisenstat

Inf. Process. Lett., 2009

2008

Combinatorial Properties of a Rooted Graph Polynomial.

David Eisenstat, Gary Gordon, Amanda Redlich

SIAM J. Discret. Math., 2008

Fast computation by population protocols with a leader.

Dana Angluin, James Aspnes, David Eisenstat

Distributed Comput., 2008

A simple population protocol for fast robust approximate majority.

Dana Angluin, James Aspnes, David Eisenstat

Distributed Comput., 2008

Expected rank and randomness in rooted graphs.

David Eisenstat, Jennifer Feder, Greg Francos, Gary Gordon, Amanda Redlich

Discret. Appl. Math., 2008

A two-enqueuer queue

David Eisenstat

CoRR, 2008

2007

The VC dimension of k-fold union.

David Eisenstat, Dana Angluin

Inf. Process. Lett., 2007

The computational power of population protocols.

Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert

Distributed Comput., 2007

2006

Non-isomorphic caterpillars with identical subtree data.

David Eisenstat, Gary Gordon

Discret. Math., 2006

Stably computable predicates are semilinear.

Dana Angluin, James Aspnes, David Eisenstat

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

2005

On the Power of Anonymous One-Way Communication.

Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert

Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005