( en | de | ru )

 

Disambiguation of "Moran, Shlomo"

Author of the publication

copydeleteadd this publication to your clipboard
Deciding 1-sovability of distributed task is NP-hard.

, , and . WG, volume 484 of Lecture Notes in Computer Science, page 206-220. Springer, (1990)

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.

Shlomo Kipnis

Diana Westfalia Morán Puente

Shlomo Havlin

Shlomo Peer

Shlomo Berger

 

Other publications of authors with the same name

Fast and reliable reconstruction of phylogenetic trees with very short edges., , and . SODA, page 379-388. SIAM, (2008)The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing., , and . SIROCCO, page 99-111. Carleton Scientific, (1997)Gap Theorems for Distributed Computation., and . SIAM J. Comput., 22 (2): 379-394 (1993)A Distributed Channel-Access Protocol for Fully-Connected Networks with Mobile Nodes., , and . IEEE Trans. Computers, 32 (2): 133-147 (1983)Possibility and Impossibility Results in a Shared Memory Environment., and . Acta Inf., 33 (1): 1-20 (1996)Computing in Totally Anonymous Asynchronous Shared Memory Systems., , and . DISC, volume 1499 of Lecture Notes in Computer Science, page 49-61. Springer, (1998)On the Robustness of h^r_m., and . WDAG, volume 1151 of Lecture Notes in Computer Science, page 344-361. Springer, (1996)Stochastic Errors vs. Modeling Errors in Distance Based Phylogenetic Reconstructions - (Extended Abstract)., , , and . WABI, volume 6833 of Lecture Notes in Computer Science, page 49-60. Springer, (2011)Simple and efficient network decomposition and synchronization., and . Theor. Comput. Sci., 243 (1-2): 217-241 (2000)Competitive caching of query results in search engines., and . Theor. Comput. Sci., 324 (2-3): 253-271 (2004)