
Search the dblp DataBase
David Eisenstat:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
On the Power of Anonymous OneWay Communication. [Citation Graph (0, 0)][DBLP] OPODIS, 2005, pp:396411 [Conf]
 Dana Angluin, James Aspnes, David Eisenstat
Stably computable predicates are semilinear. [Citation Graph (0, 0)][DBLP] PODC, 2006, pp:292299 [Conf]
 Dana Angluin, James Aspnes, David Eisenstat
Fast Computation by Population Protocols with a Leader. [Citation Graph (0, 0)][DBLP] DISC, 2006, pp:6175 [Conf]
 David Eisenstat, Gary Gordon
Nonisomorphic caterpillars with identical subtree data. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:89, pp:827830 [Journal]
 David Eisenstat, Dana Angluin
The VC dimension of kfold union. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:101, n:5, pp:181184 [Journal]
 Dana Angluin, James Aspnes, David Eisenstat
A Simple Population Protocol for Fast Robust Approximate Majority. [Citation Graph (0, 0)][DBLP] DISC, 2007, pp:2032 [Conf]
 Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
The computational power of population protocols [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp: [Journal]
Lower Bounds on Learning Random Structures with Statistical Queries. [Citation Graph (, )][DBLP]
Learning Acyclic Probabilistic Circuits Using Test Paths. [Citation Graph (, )][DBLP]
Lowcontention data structures. [Citation Graph (, )][DBLP]
Storage Capacity of Labeled Graphs. [Citation Graph (, )][DBLP]
A twoenqueuer queue [Citation Graph (, )][DBLP]
Random road networks: the quadtree model [Citation Graph (, )][DBLP]
Expected rank and randomness in rooted graphs. [Citation Graph (, )][DBLP]
The computational power of population protocols. [Citation Graph (, )][DBLP]
A simple population protocol for fast robust approximate majority. [Citation Graph (, )][DBLP]
Fast computation by population protocols with a leader. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
