David Eisenstat

	2012
23		David Eisenstat, Philip N. Klein, Claire Mathieu: An efficient polynomial-time approximation scheme for Steiner forest in planar graphs. SODA 2012: 626-638
22		James Aspnes, David Eisenstat, Yitong Yin: Low-contention data structures. J. Parallel Distrib. Comput. 72(5): 705-715 (2012)
	2011
21		David Eisenstat, Philip N. Klein, Claire Mathieu: An efficient polynomial-time approximation scheme for Steiner forest in planar graphs CoRR abs/1110.1320: (2011)
	2010
20		Dana Angluin, David Eisenstat, Leonid Kontorovich, Lev Reyzin: Lower Bounds on Learning Random Structures with Statistical Queries. ALT 2010: 194-208
19		James Aspnes, David Eisenstat, Yitong Yin: Low-contention data structures. SPAA 2010: 345-354
18		Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod: Storage Capacity of Labeled Graphs. SSS 2010: 573-587
17		David Eisenstat: Random road networks: the quadtree model CoRR abs/1008.4916: (2010)
	2009
16		David Eisenstat: k-Fold unions of low-dimensional concept classes. Inf. Process. Lett. 109(23-24): 1232-1234 (2009)
15		Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin: Learning Acyclic Probabilistic Circuits Using Test Paths. Journal of Machine Learning Research 10: 1881-1911 (2009)
	2008
14		Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin: Learning Acyclic Probabilistic Circuits Using Test Paths. COLT 2008: 169-180
13		David Eisenstat: A two-enqueuer queue CoRR abs/0805.0444: (2008)
12		David Eisenstat, Jennifer Feder, Greg Francos, Gary Gordon, Amanda Redlich: Expected rank and randomness in rooted graphs. Discrete Applied Mathematics 156(5): 746-756 (2008)
11		Dana Angluin, James Aspnes, David Eisenstat: A simple population protocol for fast robust approximate majority. Distributed Computing 21(2): 87-102 (2008)
10		Dana Angluin, James Aspnes, David Eisenstat: Fast computation by population protocols with a leader. Distributed Computing 21(3): 183-199 (2008)
9		David Eisenstat, Gary Gordon, Amanda Redlich: Combinatorial Properties of a Rooted Graph Polynomial. SIAM J. Discrete Math. 22(2): 776-785 (2008)
	2007
8		Dana Angluin, James Aspnes, David Eisenstat: A Simple Population Protocol for Fast Robust Approximate Majority. DISC 2007: 20-32
7		Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: The computational power of population protocols. Distributed Computing 20(4): 279-304 (2007)
6		David Eisenstat, Dana Angluin: The VC dimension of k-fold union. Inf. Process. Lett. 101(5): 181-184 (2007)
	2006
5		Dana Angluin, James Aspnes, David Eisenstat: Fast Computation by Population Protocols with a Leader. DISC 2006: 61-75
4		Dana Angluin, James Aspnes, David Eisenstat: Stably computable predicates are semilinear. PODC 2006: 292-299
3		Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: The computational power of population protocols CoRR abs/cs/0608084: (2006)
2		David Eisenstat, Gary Gordon: Non-isomorphic caterpillars with identical subtree data. Discrete Mathematics 306(8-9): 827-830 (2006)
	2005
1		Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: On the Power of Anonymous One-Way Communication. OPODIS 2005: 396-411

Coauthor Index

1	Dana Angluin	[1] [3] [4] [5] [6] [7] [8] [10] [11] [14] [15] [18] [20]
2	James Aspnes	[1] [3] [4] [5] [7] [8] [10] [11] [14] [15] [18] [19] [22]
3	Rida A. Bazzi	[18]
4	Jiang Chen	[14] [15] [18]
5	Jennifer Feder	[12]
6	Greg Francos	[12]
7	Gary Gordon	[2] [9] [12]
8	Philip N. Klein	[21] [23]
9	Goran Konjevod	[18]
10	Leonid Kontorovich	[20]
11	Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu)	[21] [23]
12	Amanda Redlich	[9] [12]
13	Lev Reyzin	[14] [15] [20]
14	Eric Ruppert	[1] [3] [7]
15	Yitong Yin	[19] [22]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page