( en | de | ru )

 

Disambiguation of "Moran, Shlomo"

Author of the publication

copydeleteadd this publication to your clipboard
Optimizing result prefetching in web search engines with segmented indices.

, and . ACM Trans. Internet Techn., 4 (1): 31-59 (2004)

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

Analysis of a Distributed Scheduler for Communication Networks., , and . AWOC, volume 319 of Lecture Notes in Computer Science, page 351-360. Springer, (1988)The Firing Squad Problem Revisited., and . STACS, volume 96 of LIPIcs, page 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)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)Optimal implementations of UPGMA and other common clustering algorithms., and . Inf. Process. Lett., 104 (6): 205-210 (2007)Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM's., and . SIAM J. Comput., 12 (2): 388-394 (1983)On the Accepting Density Hierarchy in NP.. SIAM J. Comput., 11 (2): 344-349 (1982)A Note on the Parallel Complexity of Computing the Rank of Order n Matrices., , and . Inf. Process. Lett., 11 (4/5): 162 (1980)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)