Author of the publication

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

, and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 244-255. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem., and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 244-255. Springer, (2007)On the Complexity of the "Most General" Firing Squad Synchronization Problem., and . STACS, volume 3884 of Lecture Notes in Computer Science, page 696-711. Springer, (2006)Determination of the Topology of a Directed Network.. IPDPS, IEEE Computer Society, (2002)On Formulations of Firing Squad Synchronization Problems., and . UC, volume 3699 of Lecture Notes in Computer Science, page 157-168. Springer, (2005)On the Complexity of Network Synchronization., and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 496-507. Springer, (2004)Can Memory Be Used Adaptively by Uniform Algorithms?, and . OPODIS, volume 3974 of Lecture Notes in Computer Science, page 32-46. Springer, (2005)Using Artificial Intelligence for Model Selection, , and . CoRR, (2003)The wake up and report problem is time-equivalent to the firing squad synchronization problem., and . SODA, page 578-587. ACM/SIAM, (2002)A "Go With the Winners" approach to finding frequent patterns., and . SAC, page 498-502. ACM, (2005)