# David Eisenstat

According to our database

Collaborative distances:

^{1}, David Eisenstat authored at least 22 papers between 2005 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

Time-Space Trade-offs in Population Protocols.

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

2014

Effective storage capacity of labeled graphs.

Inf. Comput., 2014

Approximating

*k*-center in planar graphs.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Facility Location in Evolving Metrics.

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.

Proceedings of the Symposium on Theory of Computing Conference, 2013

2012

Low-contention data structures.

J. Parallel Distributed Comput., 2012

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

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

2011

Random Road Networks: The Quadtree Model.

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

2010

Storage Capacity of Labeled Graphs.

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

Lower Bounds on Learning Random Structures with Statistical Queries.

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

2009

Learning Acyclic Probabilistic Circuits Using Test Paths.

J. Mach. Learn. Res., 2009

k-Fold unions of low-dimensional concept classes.

Inf. Process. Lett., 2009

2008

Combinatorial Properties of a Rooted Graph Polynomial.

SIAM J. Discret. Math., 2008

Fast computation by population protocols with a leader.

Distributed Comput., 2008

A simple population protocol for fast robust approximate majority.

Distributed Comput., 2008

Expected rank and randomness in rooted graphs.

Discret. Appl. Math., 2008

A two-enqueuer queue

CoRR, 2008

2007

The VC dimension of k-fold union.

Inf. Process. Lett., 2007

The computational power of population protocols.

Distributed Comput., 2007

2006

Non-isomorphic caterpillars with identical subtree data.

Discret. Math., 2006

Stably computable predicates are semilinear.

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

2005

On the Power of Anonymous One-Way Communication.

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