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

    Filter
    Conference contribution

    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

    • 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
    • 2008

      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
    • 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
    • 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
    • 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
    • 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

    • 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
    • 1995

      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

      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
    • 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

    • Resource bounds for self stabilizing message driven protocols

      Dolev, S., Israeli, A. & Moran, S., 1 Jul 1991, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. p. 281-293 13 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

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

      Open Access
      28 Scopus citations

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

      Biran, O., Moran, S. & Zaks, S., 1991, Distributed Algorithms - 4th International Workshop, Proceedings. van Leeuwen, J. & Santoro, N. (eds.). p. 373-389 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 486 LNCS).

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

      Open Access
      1 Scopus citations
    • 1990

      Wakeup problem

      Fischer, M. J., Moran, S., Rudich, S. & Taubenfeld, G., 1990, Proc 22nd Annu ACM Symp Theory Comput. p. 106-116 11 p. (Proc 22nd Annu ACM Symp Theory Comput).

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

      Open Access
      10 Scopus citations
    • 1989

      Computing the minimum visible vertex distance between two polygons

      Aggarwal, A., Moran, S., Shor, P. W. & Suri, S., 1989, Algorithms and Data Structures - Workshop, WADS 1989, Proceedings. Dehne, F., Sack, J-R. & Santoro, N. (eds.). p. 115-134 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 382 LNCS).

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

      8 Scopus citations
    • 1988

      A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor

      Biran, O., Moran, S. & Zaks, S., 1 Jan 1988, Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, PODC 1988. p. 263-275 13 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; vol. Part F130192).

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

      36 Scopus citations

    • Analysis of a distributed scheduler for communication networks

      Malka, Y., Moran, S. & Zaks, S., 1988, VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings. Reif, J. H. (ed.). p. 351-360 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 319 LNCS).

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

      5 Scopus citations
    • 1985

      A modular technique for the design of efficient distributed leader finding algorithms

      Korach, E., Kutten, S. & Moran, S., 1 Aug 1985, Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985. Strong, R. & Malcolm, M. (eds.). p. 163-174 12 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

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

      Open Access
      14 Scopus citations

    • The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors

      Korach, E., Moran, S. & Zaks, S., 1 Aug 1985, Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985. Strong, R. & Malcolm, M. (eds.). p. 277-286 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

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

      2 Scopus citations
    • 1984

      APPLICATIONS OF RAMSEY'S THEOREM TO DECISION TREES COMPLEXITY.

      Moran, S., Snir, M. & Manber, U., 1984, Annual Symposium on Foundations of Computer Science (Proceedings). p. 332-337 6 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

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

      2 Scopus citations

    • TIGHT LOWER AND UPPER BOUNDS FOR SOME DISTRIBUTED ALGORITHMS FOR A COMPLETE NETWORK OF PROCESSORS.

      Korach, E., Moran, S. & Zaks, S., 1984, Unknown Host Publication Title. p. 199-207 9 p.

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

      Open Access
      81 Scopus citations
    • 1983

      DYNAMIC SELECTION OF A PERFORMANCE-EFFECTIVE TRANSMISSION SEQUENCE FOR TOKEN-PASSING NETWORKS WITH MOBILE NODES.

      Gold, Y. I. & Moran, S., 1983, Proceedings - Data Communications Symposium. p. 177-180 4 p. (Proceedings - Data Communications Symposium).

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

      Open Access
    • 1981

      On the complexity of simple arithmetic expressions

      Ibarra, O. H., Leininger, B. S. & Moran, S., 1981, Automata, Languages and Programming - 8th Colloquium. Even, S. & Kariv, O. (eds.). p. 294-304 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 115 LNCS).

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

      Open Access
    • 1977

      Non-deterministic polynomial optimization problems and their approximation: Abridged version

      Paz, A. & Moran, S., 1977, Automata, Languages and Programming - 4th Colloquium. Salomaa, A. & Steinby, M. (eds.). p. 370-379 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 52 LNCS).

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

      Open Access
      8 Scopus citations