( en | de | ru )

 

Disambiguation of "Moran, Shlomo"

Author of the publication

copydeleteadd this publication to your clipboard
Fair Deriviations in Context-Free Grammars

, , , and . Inf. Control., 55 (1-3): 108-116 (October 1982)

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

On Some Decision Problems for RAM Programs., and . J. Comput. Syst. Sci., 24 (1): 69-81 (1982)On the totalk-diameter of connection networks., , , and . Theor. Comput. Sci., 247 (1-2): 213-228 (2000)The Firing Squad Problem Revisited., and . STACS, volume 96 of LIPIcs, page 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case., , and . FCT, volume 380 of Lecture Notes in Computer Science, page 58-67. Springer, (1989)Simple and optimal randomized fault-tolerant rumor spreading., , , and . Distributed Comput., 29 (2): 89-104 (2016)Geometric Applications of a Matrix Searching Algorithm., , , , and . SCG, page 285-292. ACM, (1986)Dynamic selection of a performance-effective transmission sequence for token-passing networks with mobile nodes., and . SIGCOMM, page 177-180. ACM, (1983)Deciding 1-sovability of distributed task is NP-hard., , and . WG, volume 484 of Lecture Notes in Computer Science, page 206-220. Springer, (1990)Uniform Dynamic Self-Stabilizing Leader Election., , and . IEEE Trans. Parallel Distributed Syst., 8 (4): 424-440 (1997)The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case, , and . Inf. Comput., 108 (1): 34-50 (January 1994)