World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
36
Citations
7797
World Ranking
11053
National Ranking
177

Shlomo Moran publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Shlomo Moran sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 174 publications — 36th percentile

36% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Shlomo Moran D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Shlomo Moran sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 36 D-Index — 23rd percentile

23% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Overview

Shlomo Moran is affiliated with the Technion - Israel Institute of Technology in Israel. Their research spans multiple fields, predominantly computer science, mathematics, and engineering. Within these disciplines, their work frequently addresses subfields such as computer networks and communications, computational theory and mathematics, artificial intelligence, theoretical computer science, and geometry and topology.

Their main research topics include distributed systems and fault tolerance, history and theory of mathematics, mathematics and applications, algebraic and geometric analysis, advanced surface polishing techniques, advancements in photolithography techniques, and handwritten text recognition techniques.

Among recent publications authored or coauthored by Shlomo Moran are:

  • MinMax algorithms for stabilizing consensus, 2021, Distributed Computing
  • Wait-Freedom vs. Bounded Wait Freedom in Public Data Structures, 2020, TUGraz OPEN Library (Graz University of Technology)
  • Elementary Derivations of the Real Composition Algebras, 2020, arXiv (Cornell University)
  • Elementary Derivations of the Euclidean Hurwitz Algebras Adapted from Gadi Moran's last paper, 2021, American Mathematical Monthly
  • Adjustable Coins, 2021, Recreational mathematics magazine

Shlomo Moran has published frequently in venues such as arXiv (Cornell University), Distributed Computing, TUGraz OPEN Library (Graz University of Technology), American Mathematical Monthly, and Recreational mathematics magazine.

They have collaborated multiple times with several coauthors, including Paweł Cyprys, Shlomi Dolev, Shay Moran, Tomer Moran, and Irad Yavneh.

Best Publications

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

    R. Lempel;S. Moran

  • Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class

    László Babai;Shlomo Moran

  • Geometric applications of a matrix-searching algorithm

    Alok Aggarwal;Maria M. Klawe;Shlomo Moran;Peter W. Shor

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

    Shlomi Dolev;Amos Israeli;Shlomo Moran

  • SALSA: the stochastic approach for link-structure analysis

    R. Lempel;S. Moran

  • Predictive caching and prefetching of query results in search engines

    Ronny Lempel;Shlomo Moran

  • Uniform dynamic self-stabilizing leader election

    S. Dolev;A. Israeli;S. Moran

  • Optimal implementations of UPGMA and other common clustering algorithms

    Ilan Gronau;Shlomo Moran

  • Non deterministic polynomial optimization problems and their approximations

    Azaria Paz;Shlomo Moran

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

    Shlomo Dalev;Amos Israeli;Shlomo Moran

  • A generalization of the fast LUP matrix decomposition algorithm and applications

    Oscar H Ibarra;Shlomo Moran;Roger Hui

  • Tight lower and upper bounds for some distributed algorithms for a complete network of processors

    E. Korach;S. Moran;S. Zaks

  • On the np‐completeness of certain network testing problems

    Shimon Even;Oded Goldreich;Shlomo Moran;Po Tong

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

    E. Korach;S. Kutten;S. Moran

  • Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs

    Oscar H. Ibarra;Shlomo Moran

  • Extended impossibility results for asynchronous complete networks

    S. Moran;Y. Wolfstahl

  • Rank-Stability and Rank-Similarity of Link-Based Web Ranking Algorithms in Authority-Connected Graphs

    R. Lempel;S. Moran

  • A combinatorial characterization of the distributed 1-solvable tasks

    Ofer Biran;Shlomo Moran;Shumuel Zaks

  • Computing in totally anonymous asynchronous shared memory systems

    Hagit Attiya;Alla Gorbach;Shlomo Moran

  • Sequential Machine Characterizations of Trellis and Cellular Automata and Applications

    Oscar H. Ibarra;Sam M. Kim;Shlomo Moran

  • Non-Deterministic Polynomial Optimization Problems and Their Approximation

    Azaria Paz;Shlomo Moran

Frequent Co-Authors

Oscar H. Ibarra
Oscar H. Ibarra University of California, Santa Barbara
Shlomi Dolev
Shlomi Dolev Ben-Gurion University of the Negev
Sergio Rajsbaum
Sergio Rajsbaum National Autonomous University of Mexico
Michael J. Fischer
Michael J. Fischer Yale University
Benjamin Doerr
Benjamin Doerr École Polytechnique
Manfred K. Warmuth
Manfred K. Warmuth Google (United States)
Shmuel Katz
Shmuel Katz Technion – Israel Institute of Technology
Toniann Pitassi
Toniann Pitassi Columbia University
Samuel R. Buss
Samuel R. Buss University of California, San Diego

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online learning options can open new doors for students at all stages of their academic journey. For those just starting out, online associate degree programs offer an affordable and flexible entry point into computer science and related fields. Many students also search for the cheapest online college options to help minimize debt while gaining quality education.

Worried about your academic history? Some of the best online colleges that accept low GPA allow non-traditional or returning students to start fresh and pursue a computer science degree at their own pace.

With a degree in computer science or related fields, career options extend into numerous industries, including data analysis, software engineering, and even roles that intersect with environmental solutions. Curious about more interdisciplinary options? Explore what can i do with an environmental science degree to see how tech skills can blend with fields like environmental science for innovative careers.

Best Scientists Citing Shlomo Moran

Trending Scientists

Recently Published Articles