Darin Goldstein
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
7
Venues
6
Active years
2002–2007
Best venue rank
A*
Where they publish
Papers
7 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2007 | ISAAC | On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem. | Darin Goldstein, Kojiro Kobayashi |
| 2006 | STACS | On the Complexity of the "Most General" Firing Squad Synchronization Problem. | Darin Goldstein, Kojiro Kobayashi |
| 2005 | OPODIS | Can Memory Be Used Adaptively by Uniform Algorithms? | Burkhard Englert, Darin Goldstein |
| 2005 | SAC | A "Go With the Winners" approach to finding frequent patterns. | Todd Ebert, Darin Goldstein |
| 2005 | UC | On Formulations of Firing Squad Synchronization Problems. | Kojiro Kobayashi, Darin Goldstein |
| 2004 | ISAAC | On the Complexity of Network Synchronization. | Darin Goldstein, Kojiro Kobayashi |
| 2002 | SODA | The wake up and report problem is time-equivalent to the firing squad synchronization problem. | Darin Goldstein, Nick Meyer |