No photo of Shlomo Moran

View Scopus Profile

Shlomo Moran

Professor Emeritus

Former affiliation
 https://orcid.org/0000-0003-3222-3308
    Calculated based on number of publications stored in Pure and citations from Scopus
    1977 …2022

    Research activity per year

    Search results

    • 2022

      Brief Announcement: Self Masking for Hardening Inversions

      Cyprys, P., Dolev, S. & Moran, S., 2022, Stabilization, Safety, and Security of Distributed Systems - 24th International Symposium, SSS 2022, Proceedings. Devismes, S., Petit, F., Altisen, K., Di Luna, G. A. & Fernandez Anta, A. (eds.). p. 331-334 4 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13751 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2021

      Adjustable Coins

      Moran, S. & Yavneh, I., 2021, In: recreational mathematics magazine. 8, 15, p. 27-39 13 p.

      Research output: Contribution to journal › Article › peer-review

    • Elementary Derivations of the Euclidean Hurwitz Algebras Adapted from Gadi Moran’s last paper

      Moran, T., Moran, S. & Moran, S., 14 Sep 2021, In: American Mathematical Monthly. 128, 8, p. 726-736 11 p., 8.

      Research output: Contribution to journal › Article › peer-review

    • 2018

      Comparing evolutionary distances via adaptive distance functions

      Damti, Y., Gronau, I., Moran, S. & Yavneh, I., 7 Mar 2018, In: Journal of Theoretical Biology. 440, p. 88-99 12 p.

      Research output: Contribution to journal › Article › peer-review

    • 2016

      Simple and optimal randomized fault-tolerant rumor spreading

      Doerr, B., Doerr, C., Moran, S. & Moran, S., 1 Apr 2016, In: Distributed Computing. 29, 2, p. 89-104 16 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      2 Scopus citations
    • 2012

      Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges

      Gronau, I., Moran, S. & Snir, S., May 2012, In: Random Structures and Algorithms. 40, 3, p. 350-384 35 p.

      Research output: Contribution to journal › Article › peer-review

      11 Scopus citations

    • Stochastic errors vs. modeling errors in distance based phylogenetic reconstructions

      Doerr, D., Gronau, I., Moran, S. & Yavneh, I., 31 Aug 2012, In: Algorithms for Molecular Biology. 7, 1, 22.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      2 Scopus citations
    • 2011

      Stochastic errors vs. modeling errors in distance based phylogenetic reconstructions

      Doerr, D., Gronau, I., Moran, S. & Yavneh, I., 2011, Algorithms in Bioinformatics - 11th International Workshop, WABI 2011, Proceedings. p. 49-60 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6833 LNBI).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      1 Scopus citations
    • 2010

      Adaptive distance measures for resolving K2P quartets: Metric separation versus stochastic noise

      Gronau, I., Moran, S. & Yavneh, I., 1 Nov 2010, In: Journal of Computational Biology. 17, 11, p. 1391-1400 10 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      3 Scopus citations
    • 2008

      Convex recolorings of strings and trees: Definitions, hardness results and algorithms

      Moran, S. & Snir, S., Aug 2008, In: Journal of Computer and System Sciences. 74, 5, p. 850-869 20 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      37 Scopus citations

    • Fast and reliable reconstruction of phylogenetic trees with very short edges extended abstract

      Gronau, I., Moran, S. & Snir, S., 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 379-388 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      22 Scopus citations
    • 2007

      On the hardness of inferring phylogenies from triplet-dissimilarities

      Gronau, I. & Moran, S., 10 Dec 2007, In: Theoretical Computer Science. 389, 1-2, p. 44-55 12 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      1 Scopus citations

    • Optimal implementations of UPGMA and other common clustering algorithms

      Gronau, I. & Moran, S., 16 Dec 2007, In: Information Processing Letters. 104, 6, p. 205-210 6 p.

      Research output: Contribution to journal › Article › peer-review

      136 Scopus citations
    • 2005

      Using semi-definite programming to enhance supertree resolvability

      Moran, S., Rao, S. & Snir, S., 2005, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). p. 89-103 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3692 LNBI).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      7 Scopus citations
    • 2002

      Introducing Regulated Bias into Co-Citation Ranking Schemes on the Web

      Lempel, R. & Moran, S., 2002, In: Proceedings of the ASIST Annual Meeting. 39, p. 425-435 11 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      2 Scopus citations

    • Lightpath arrangement in survivable rings to minimize the switching cost

      Eilam, T., Moran, S. & Zaks, S., Jan 2002, In: IEEE Journal on Selected Areas in Communications. 20, 1, p. 172-182 11 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      29 Scopus citations

    • Public data structures: Counters as a special case

      Brit, H., Moran, S. & Taubenfeld, G., 23 Oct 2002, In: Theoretical Computer Science. 289, 1, p. 401-423 23 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      1 Scopus citations

    • The complexity of the characterization of networks supporting shortest-path interval routing

      Eilam, T., Moran, S. & Zaks, S., 23 Oct 2002, In: Theoretical Computer Science. 289, 1, p. 85-104 20 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      6 Scopus citations
    • 2001

      Minimum propositional proof length is NP-hard to linearly approximate

      Alekhnovich, M., Buss, S., Moran, S. & Pitassi, T., Mar 2001, In: Journal of Symbolic Logic. 66, 1, p. 171-191 21 p.

      Research output: Contribution to journal › Article › peer-review

      34 Scopus citations
    • 2000

      Approximation algorithms for survivable optical networks

      Eilam, T., Moran, S. & Zaks, S., 2000, Distributed Computing-14th InternationalConference, DISC 2000, Proceedings. Herlihy, M. (ed.). p. 104-118 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1914).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      5 Scopus citations

    • On the totalk-diameter of connection networks

      Dinitz, Y., Eilam, T., Moran, S. & Zaks, S., 28 Sep 2000, In: Theoretical Computer Science. 247, 1-2, p. 213-228 16 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      1 Scopus citations

    • Simple and efficient network decomposition and synchronization

      Moran, S. & Snir, S., 28 Jul 2000, In: Theoretical Computer Science. 243, 1-2, p. 217-241 25 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      10 Scopus citations

    • Stochastic approach for link-structure analysis (SALSA) and the TKC effect

      Lempel, R. & Moran, S., Jun 2000, In: Computer Networks. 33, 1, p. 387-401 15 p.

      Research output: Contribution to journal › Conference article › peer-review

      Open Access
      279 Scopus citations
    • 1999

      Bit complexity of breaking and achieving symmetry in chains and rings

      Dinitz, Y., Moran, S. & Rajsbaum, S., 1999, In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 265-274 10 p.

      Research output: Contribution to journal › Conference article › peer-review

      4 Scopus citations

    • Lower bounds for linear interval routing

      Eilam, T., Moran, S. & Zaks, S., Aug 1999, In: Networks. 34, 1, p. 37-46 10 p.

      Research output: Contribution to journal › Article › peer-review

      4 Scopus citations
    • 1998

      Minimum propositional proof length is NP-hard to linearly approximate

      Alekhnovich, M., Buss, S., Moran, S. & Pitassi, T., 1998, Mathematical Foundations of Computer Science 1998 - 23rd International Symposium, MFCS 1998, Proceedings. Brim, L., Gruska, J. & Zlatuska, J. (eds.). p. 176-184 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1450 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      18 Scopus citations
    • 1997

      A simple DFS-based algorithm for linear interval routing

      Eilam, T., Moran, S. & Zaks, S., 1997, Distributed Algorithms - 11th International Workshop, WDAG 1997, Proceedings. Mavronicolas, M. & Tsigas, P. (eds.). p. 37-51 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1320).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      2 Scopus citations

    • On the totalk-diameter of connection networks

      Dinitz, Y., Eilam, T., Moran, S. & Zaks, S., 1997, p. 96-106. 11 p.

      Research output: Contribution to conference › Paper › peer-review

      1 Scopus citations

    • Resource bounds for self-stabilizing message-driven protocols

      Dolev, S., Israeli, A. & Moran, S., Feb 1997, In: SIAM Journal on Computing. 26, 1, p. 273-290 18 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      28 Scopus citations

    • Uniform dynamic self-stabilizing leader election

      Dolev, S., Israeli, A. & Moran, S., 1997, In: IEEE Transactions on Parallel and Distributed Systems. 8, 4, p. 424-440 17 p.

      Research output: Contribution to journal › Article › peer-review

      130 Scopus citations
    • 1996

      A lower bound for linear interval routing

      Eilam, T., Moran, S. & Zaks, S., 1996, Distributed Algorithms - 10th International Workshop, WDAG 1996, Proceedings. Babaoglu, O. & Marzullo, K. (eds.). p. 191-205 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1151).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      9 Scopus citations

    • Average and randomized complexity of distributed problems

      Allenberg-Navony, N., Itai, A. & Moran, S., Dec 1996, In: SIAM Journal on Computing. 25, 6, p. 1254-1267 14 p.

      Research output: Contribution to journal › Article › peer-review

      2 Scopus citations

    • Concurrent counting

      Moran, S., Taubenfeld, G. & Yadin, I., Aug 1996, In: Journal of Computer and System Sciences. 53, 1, p. 61-78 18 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      11 Scopus citations

    • On the robustness of hrm(Preliminary version)

      Moran, S. & Rappoport, L., 1996, Distributed Algorithms - 10th International Workshop, WDAG 1996, Proceedings. Babaoglu, O. & Marzullo, K. (eds.). p. 344-361 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1151).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      10 Scopus citations

    • The wakeup problem

      Fischer, M. J., Moran, S., Rudich, S. & Taubenfeld, G., Dec 1996, In: SIAM Journal on Computing. 25, 6, p. 1332-1357 26 p.

      Research output: Contribution to journal › Article › peer-review

      20 Scopus citations

    • Wait-freedom vs. bounded wait-freedom in public data structures

      Brit, H. & Moran, S., 1996, In: Journal of Universal Computer Science. 2, 1, p. 2-19 18 p.

      Research output: Contribution to journal › Article › peer-review

      5 Scopus citations
    • 1995

      Analyzing Expected Time by Scheduler-Luck Games

      Dolev, S., Israeli, A. & Moran, S., May 1995, In: IEEE Transactions on Software Engineering. 21, 5, p. 429-439 11 p.

      Research output: Contribution to journal › Article › peer-review

      33 Scopus citations

    • Tight bounds on the round complexity of distributed 1-solvable tasks

      Biran, O., Moran, S. & Zaks, S., 10 Jul 1995, In: Theoretical Computer Science. 145, 1-2, p. 271-290 20 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      8 Scopus citations

    • Using approximate agreement to obtain complete disagreement: The output structure of input-free asynchronous computations

      Moran, S., 1995, Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems. p. 251-257 7 p. 377025. (Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      3 Scopus citations
    • 1994

      Average and randomized complexity of distributed problems

      Allenberg-Navony, N., Itai, A. & Moran, S., 1994, Distributed Algorithms - 8th International Workshop, WDAG 1994, Proceedings. Tel, G. & Vitanyi, P. (eds.). p. 311-325 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 857 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Wait-freedom vs. bounded wait-freedom in public data structures

      Brit, H. & Moran, S., 14 Aug 1994, Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994. p. 52-60 9 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; vol. Part F129432).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      7 Scopus citations
    • 1993

      A lower bound on the period length of a distributed scheduler

      Malka, Y., Moran, S. & Zaks, S., Nov 1993, In: Algorithmica. 10, 5, p. 383-398 16 p.

      Research output: Contribution to journal › Article › peer-review

      11 Scopus citations

    • Gap theorems for distributed computation

      Moran, S. & Warmuth, M. K., 1993, In: SIAM Journal on Computing. 22, 2, p. 379-394 16 p.

      Research output: Contribution to journal › Article › peer-review

      14 Scopus citations

    • Lower bound on wait-free counting

      Moran, S. & Taubenfeld, G., 1993, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Anon (ed.). p. 251-259 9 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      9 Scopus citations

    • Rotating-table games and derivatives of words

      Bar Yehuda, R., Etzion, T. & Moran, S., 15 Feb 1993, In: Theoretical Computer Science. 108, 2, p. 311-329 19 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      17 Scopus citations

    • Self-stabilization of dynamic systems assuming only read/write atomicity

      Dolev, S., Israeli, A. & Moran, S., Nov 1993, In: Distributed Computing. 7, 1, p. 3-16 14 p.

      Research output: Contribution to journal › Article › peer-review

      172 Scopus citations

    • Space-efficient asynchronous consensus without shared memory initialization

      Fischer, M. J., Moran, S. & Taubenfeld, G., 26 Feb 1993, In: Information Processing Letters. 45, 2, p. 101-105 5 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      4 Scopus citations

    • Two-page book embedding of trees under vertex-neighborhood constraints

      Moran, S. & Wolfsthal, Y., 10 Jun 1993, In: Discrete Applied Mathematics. 43, 3, p. 233-241 9 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      2 Scopus citations
    • 1991

      Deciding 1-solvability of distributed task is np-hard

      Biran, O., Moran, S. & Zaks, S., 1991, Graph-Theoretic Concepts in Computer Science - 16th International Workshop WG 1990, Proceedings. Mohring, R. H. (ed.). p. 206-220 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 484 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      9 Scopus citations

    • Optimal covering of cacti by vertex-disjoint paths

      Moran, S. & Wolfstahl, Y., 29 Jul 1991, In: Theoretical Computer Science. 84, 2, p. 179-197 19 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      19 Scopus citations