| The stochastic approach for link-structure analysis (SALSA) and the TKC effect R Lempel, S Moran Computer Networks 33 (1-6), 387-401, 2000 | 775 | 2000 |
| Arthur-Merlin games : A randomized proof system and a hierarchy of complexity classes L Babai, S Moran Journal of Computer and System Sciences 36, 254-276, 1988 | 771 | 1988 |
| Geometric applications of a matrix searching algorithm A Aggarwal, M Klawe, S Moran, P Shor, R Wilber Proceedings of the second annual symposium on Computational geometry, 285-292, 1986 | 637 | 1986 |
| SALSA: the stochastic approach for link-structure analysis R Lempel, S Moran ACM Transactions on Information Systems (TOIS) 19 (2), 131-160, 2001 | 523 | 2001 |
| Self-stabilization of dynamic systems assuming only read/write atomicity S Dolev, A Israeli, S Moran Distributed Computing 7, 3-16, 1993 | 514 | 1993 |
| Self-stabilization of dynamic systems assuming only read/write atomicity S Dolev, A Israeli, S Moran Distributed Computing 7, 3-16, 1993 | 514 | 1993 |
| Adnexal torsion of hyperstimulated ovaries in pregnancies after gonadotropin therapy S Mashiach, D Bider, O Moran, M Goldenberg, Z Ben-Rafael Fertility and sterility 53 (1), 76-80, 1990 | 289 | 1990 |
| Predictive caching and prefetching of query results in search engines R Lempel, S Moran Proceedings of the 12th international conference on World Wide Web, 19-28, 2003 | 263 | 2003 |
| Non deterministic polynomial optimization problems and their approximations A Paz, S Moran Theoretical Computer Science 15 (3), 251-277, 1981 | 225 | 1981 |
| Optimal implementations of UPGMA and other common clustering algorithms I Gronau, S Moran Information processing letters 104 (6), 205-210, 2007 | 222 | 2007 |
| Uniform dynamic self-stabilizing leader election S Dolev, A Israeli, S Moran IEEE Transactions on Parallel and Distributed Systems 8 (4), 424-440, 1997 | 222 | 1997 |
| A generalization of the fast LUP matrix decomposition algorithm and applications OH Ibarra, S Moran, R Hui Journal of algorithms 3 (1), 45-56, 1982 | 186 | 1982 |
| Tight lower and upper bounds for some distributed algorithms for a complete network of processors E Korach, S Moran, S Zaks Proceedings of the third annual ACM symposium on Principles of distributed …, 1984 | 165 | 1984 |
| A modular technique for the design of efficient distributed leader finding algorithms E Korach, S Kutten, S Moran ACM Transactions on Programming Languages and Systems (TOPLAS) 12 (1), 84-101, 1990 | 148 | 1990 |
| A modular technique for the design of efficient distributed leader finding algorithms E Korach, S Kutten, S Moran ACM Transactions on Programming Languages and Systems (TOPLAS) 12 (1), 84-101, 1990 | 148 | 1990 |
| On the np‐completeness of certain network testing problems S Even, O Goldreich, S Moran, P Tong Networks 14 (1), 1-24, 1984 | 141 | 1984 |
| Probabilistic algorithms for deciding equivalence of straight-line programs OH Ibarra, S Moran Journal of the ACM (JACM) 30 (1), 217-228, 1983 | 132 | 1983 |
| Extended impossibility results for asynchronous complete networks S Moran, Y Wolfstahl Information Processing Letters 26 (3), 145-151, 1987 | 116 | 1987 |
| Rank-stability and rank-similarity of link-based web ranking algorithms in authority-connected graphs R Lempel, S Moran Information Retrieval 8 (2), 245-264, 2005 | 113 | 2005 |
| A combinatorial characterization of the distributed 1-solvable tasks O Biran, S Moran, S Zaks Journal of algorithms 11 (3), 420-440, 1990 | 112 | 1990 |
