 | 2007 |
|---|
| 14 |       | Darin Goldstein,
Kojiro Kobayashi:
On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem.
ISAAC 2007: 244-255 |
| 2006 |
|---|
| 13 | | Darin Goldstein,
Kojiro Kobayashi:
On the Complexity of the "Most General" Firing Squad Synchronization Problem.
STACS 2006: 696-711 |
| 2005 |
|---|
| 12 | | Burkhard Englert,
Darin Goldstein:
Can Memory Be Used Adaptively by Uniform Algorithms?
OPODIS 2005: 32-46 |
| 11 | | Todd Ebert,
Darin Goldstein:
A "Go With the Winners" approach to finding frequent patterns.
SAC 2005: 498-502 |
| 10 | | Kojiro Kobayashi,
Darin Goldstein:
On Formulations of Firing Squad Synchronization Problems.
UC 2005: 157-168 |
| 9 | | Darin Goldstein,
Kojiro Kobayashi:
On the Complexity of Network Synchronization.
SIAM J. Comput. 35(3): 567-589 (2005) |
| 2004 |
|---|
| 8 | | Darin Goldstein,
Kojiro Kobayashi:
On the Complexity of Network Synchronization.
ISAAC 2004: 496-507 |
| 7 | | Darin Goldstein,
Nick Meyer:
The wake up and report problem is time-equivalent to the firing squad synchronization problem.
Distributed Computing 17(1): 21-31 (2004) |
| 2003 |
|---|
| 6 | | Darin Goldstein,
William Murray,
Binh Yang:
Using Artificial Intelligence for Model Selection
CoRR cs.AI/0310005: (2003) |
| 5 | | Darin Goldstein,
Nick Meyer:
The Wake Up and Report Problem is Time-Equivalent to the Firing Squad Synchronization Problem
CoRR cs.DC/0310003: (2003) |
| 4 | | Darin Goldstein:
Determination of the Topology of a Directed Network
CoRR cs.DC/0310004: (2003) |
| 3 | | Darin Goldstein:
Determination of the topology of a directed network.
Inf. Process. Lett. 88(3): 121-131 (2003) |
| 2002 |
|---|
| 2 | | Darin Goldstein:
Determination of the Topology of a Directed Network.
IPDPS 2002 |
| 1 | | Darin Goldstein,
Nick Meyer:
The wake up and report problem is time-equivalent to the firing squad synchronization problem.
SODA 2002: 578-587 |
