| 2008 |
|---|
| 14 | EE | Dana Angluin,
James Aspnes,
Jiang Chen,
David Eisenstat,
Lev Reyzin:
Learning Acyclic Probabilistic Circuits Using Test Paths.
COLT 2008: 169-180 |
| 13 | EE | David Eisenstat:
A two-enqueuer queue
CoRR abs/0805.0444: (2008) |
| 12 | EE | 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 | EE | Dana Angluin,
James Aspnes,
David Eisenstat:
A simple population protocol for fast robust approximate majority.
Distributed Computing 21(2): 87-102 (2008) |
| 10 | EE | Dana Angluin,
James Aspnes,
David Eisenstat:
Fast computation by population protocols with a leader.
Distributed Computing 21(3): 183-199 (2008) |
| 9 | EE | David Eisenstat,
Gary Gordon,
Amanda Redlich:
Combinatorial Properties of a Rooted Graph Polynomial.
SIAM J. Discrete Math. 22(2): 776-785 (2008) |
| 2007 |
|---|
| 8 | EE | Dana Angluin,
James Aspnes,
David Eisenstat:
A Simple Population Protocol for Fast Robust Approximate Majority.
DISC 2007: 20-32 |
| 7 | EE | Dana Angluin,
James Aspnes,
David Eisenstat,
Eric Ruppert:
The computational power of population protocols.
Distributed Computing 20(4): 279-304 (2007) |
| 6 | EE | David Eisenstat,
Dana Angluin:
The VC dimension of k-fold union.
Inf. Process. Lett. 101(5): 181-184 (2007) |
| 2006 |
|---|
| 5 | EE | Dana Angluin,
James Aspnes,
David Eisenstat:
Fast Computation by Population Protocols with a Leader.
DISC 2006: 61-75 |
| 4 | EE | Dana Angluin,
James Aspnes,
David Eisenstat:
Stably computable predicates are semilinear.
PODC 2006: 292-299 |
| 3 | EE | Dana Angluin,
James Aspnes,
David Eisenstat,
Eric Ruppert:
The computational power of population protocols
CoRR abs/cs/0608084: (2006) |
| 2 | EE | David Eisenstat,
Gary Gordon:
Non-isomorphic caterpillars with identical subtree data.
Discrete Mathematics 306(8-9): 827-830 (2006) |
| 2005 |
|---|
| 1 | EE | Dana Angluin,
James Aspnes,
David Eisenstat,
Eric Ruppert:
On the Power of Anonymous One-Way Communication.
OPODIS 2005: 396-411 |
