( en | de | ru )

 

Disambiguation of "Moran, Shlomo"

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of Simple Arithmetic Expressions.

, , and . ICALP, volume 115 of Lecture Notes in Computer Science, page 294-304. Springer, (1981)

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 Peer

Shlomo Havlin

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)Possibility and Impossibility Results in a Shared Memory Environment., and . Acta Inf., 33 (1): 1-20 (1996)Gap Theorems for Distributed Computation., and . SIAM J. Comput., 22 (2): 379-394 (1993)The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing., , and . SIROCCO, page 99-111. Carleton Scientific, (1997)A Distributed Channel-Access Protocol for Fully-Connected Networks with Mobile Nodes., , and . IEEE Trans. Computers, 32 (2): 133-147 (1983)A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms., , and . PODC, page 163-174. ACM, (1985)Bit complexity of breaking and achieving symmetry in chains and rings., , and . J. ACM, 55 (1): 3:1-3:28 (2008)Predictive caching and prefetching of query results in search engines., and . WWW, page 19-28. ACM, (2003)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)On the Complexity of Simple Arithmetic Expressions., , and . ICALP, volume 115 of Lecture Notes in Computer Science, page 294-304. Springer, (1981)