- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j10 |      | James Aspnes, David Eisenstat, Yitong Yin: Low-contention data structures. J. Parallel Distrib. Comput. 72(5): 705-715 (2012) |
| c10 | | David Eisenstat, Philip N. Klein, Claire Mathieu: An efficient polynomial-time approximation scheme for Steiner forest in planar graphs. SODA 2012: 626-638 |
| 2011 | ||
| c9 | | |
| i4 | | 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 | ||
| c8 | | Dana Angluin, David Eisenstat, Leonid Kontorovich, Lev Reyzin: Lower Bounds on Learning Random Structures with Statistical Queries. ALT 2010: 194-208 |
| c7 | | |
| c6 | | Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod: Storage Capacity of Labeled Graphs. SSS 2010: 573-587 |
| i3 | | |
| 2009 | ||
| j9 | | David Eisenstat: k-Fold unions of low-dimensional concept classes. Inf. Process. Lett. 109(23-24): 1232-1234 (2009) |
| j8 | | 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 | ||
| j7 | | 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) |
| j6 | | Dana Angluin, James Aspnes, David Eisenstat: A simple population protocol for fast robust approximate majority. Distributed Computing 21(2): 87-102 (2008) |
| j5 | | Dana Angluin, James Aspnes, David Eisenstat: Fast computation by population protocols with a leader. Distributed Computing 21(3): 183-199 (2008) |
| j4 | | David Eisenstat, Gary Gordon, Amanda Redlich: Combinatorial Properties of a Rooted Graph Polynomial. SIAM J. Discrete Math. 22(2): 776-785 (2008) |
| c5 | | Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin: Learning Acyclic Probabilistic Circuits Using Test Paths. COLT 2008: 169-180 |
| i2 | | |
| 2007 | ||
| j3 | | Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: The computational power of population protocols. Distributed Computing 20(4): 279-304 (2007) |
| j2 | | David Eisenstat, Dana Angluin: The VC dimension of k-fold union. Inf. Process. Lett. 101(5): 181-184 (2007) |
| c4 | | Dana Angluin, James Aspnes, David Eisenstat: A Simple Population Protocol for Fast Robust Approximate Majority. DISC 2007: 20-32 |
| 2006 | ||
| j1 | | David Eisenstat, Gary Gordon: Non-isomorphic caterpillars with identical subtree data. Discrete Mathematics 306(8-9): 827-830 (2006) |
| c3 | | Dana Angluin, James Aspnes, David Eisenstat: Stably computable predicates are semilinear. PODC 2006: 292-299 |
| c2 | | Dana Angluin, James Aspnes, David Eisenstat: Fast Computation by Population Protocols with a Leader. DISC 2006: 61-75 |
| i1 | | Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: The computational power of population protocols. CoRR abs/cs/0608084 (2006) |
| 2005 | ||
| c1 | | Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: On the Power of Anonymous One-Way Communication. OPODIS 2005: 396-411 |
| 1 | Dana Angluin | |
| 2 | James Aspnes | |
| 3 | Rida A. Bazzi | |
| 4 | Jiang Chen | |
| 5 | Jennifer Feder | |
| 6 | Greg Francos | |
| 7 | Gary Gordon | |
| 8 | Philip N. Klein | |
| 9 | Goran Konjevod | |
| 10 | Aryeh Kontorovich (Leonid Kontorovich) | |
| 11 | Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu) | |
| 12 | Amanda Redlich | |
| 13 | Lev Reyzin | |
| 14 | Eric Ruppert | |
| 15 | Yitong Yin |
Colors in the list of coauthors
Last update Tue May 21 11:05:27 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page