Darin Goldstein

15 papers A* 1A 2B 3C 1Misc 1Journal 7
YearRankTypeTitle / Venue / Authors
2012 J jnl
On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks.
SIAM J. Comput.
Darin Goldstein, Kojiro Kobayashi
2007 B conf
On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem.
ISAAC
Darin Goldstein, Kojiro Kobayashi
2006 A conf
On the Complexity of the "Most General" Firing Squad Synchronization Problem.
STACS
Darin Goldstein, Kojiro Kobayashi
2005 Misc conf
A "Go With the Winners" approach to finding frequent patterns.
SAC
Todd Ebert, Darin Goldstein
2005 B conf
Can Memory Be Used Adaptively by Uniform Algorithms?
OPODIS
Burkhard Englert, Darin Goldstein
2005 C conf
On Formulations of Firing Squad Synchronization Problems.
UC
Kojiro Kobayashi, Darin Goldstein
2005 J jnl
On the Complexity of Network Synchronization.
SIAM J. Comput.
Darin Goldstein, Kojiro Kobayashi
2004 B conf
On the Complexity of Network Synchronization.
ISAAC
Darin Goldstein, Kojiro Kobayashi
2004 J jnl
The wake up and report problem is time-equivalent to the firing squad synchronization problem.
Distributed Comput.
Darin Goldstein, Nick Meyer
2003 J jnl
Determination of the Topology of a Directed Network
CoRR
Darin Goldstein
2003 J jnl
Determination of the topology of a directed network.
Inf. Process. Lett.
Darin Goldstein
2003 J jnl
The Wake Up and Report Problem is Time-Equivalent to the Firing Squad Synchronization Problem
CoRR
Darin Goldstein, Nick Meyer
2003 J jnl
Using Artificial Intelligence for Model Selection
CoRR
Darin Goldstein, William Murray, Binh Yang
2002 A conf
Determination of the Topology of a Directed Network.
IPDPS
Darin Goldstein
2002 A* conf
The wake up and report problem is time-equivalent to the firing squad synchronization problem.
SODA
Darin Goldstein, Nick Meyer