Darin Goldstein

According to our database, Darin Goldstein authored at least 10 papers between 2002 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2012

On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks.

Darin Goldstein, Kojiro Kobayashi

SIAM J. Comput., 2012

2007

On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem.

Darin Goldstein, Kojiro Kobayashi

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

On the Complexity of the "Most General" Firing Squad Synchronization Problem.

Darin Goldstein, Kojiro Kobayashi

Proceedings of the STACS 2006, 2006

2005

On Formulations of Firing Squad Synchronization Problems.

Kojiro Kobayashi, Darin Goldstein

Proceedings of the Unconventional Computation, 4th International Conference, 2005

A "Go With the Winners" approach to finding frequent patterns.

Todd Ebert, Darin Goldstein

Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

Can Memory Be Used Adaptively by Uniform Algorithms?

Burkhard Englert, Darin Goldstein

Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

2004

On the Complexity of Network Synchronization.

Darin Goldstein, Kojiro Kobayashi

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

Using Artificial Intelligence for Model Selection

Darin Goldstein, William Murray, Binh Yang

CoRR, 2003

2002

The wake up and report problem is time-equivalent to the firing squad synchronization problem.

Darin Goldstein, Nick Meyer

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Determination of the Topology of a Directed Network.

Darin Goldstein

Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002