Shlomo Moran | Academic Influence

Shlomo Moran's AcademicInfluence.com Rankings

Shlomo Moran

Computer Science

#1301

World Rank

#1344

Historical Rank

Database

#7659

World Rank

#7955

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Shlomo Moran's Degrees

Bachelors Computer Science Technion – Israel Institute of Technology
Masters Computer Science Technion – Israel Institute of Technology
PhD Computer Science Technion – Israel Institute of Technology

Similar Degrees You Can Earn

Why Is Shlomo Moran Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Shlomo Moran is an Israeli computer scientist, the Bernard Elkin Chair in Computer Science at the Technion – Israel Institute of Technology in Haifa, Israel. Moran received his Ph.D. in 1979 from the Technion, under the supervision of Azaria Paz; his dissertation was entitled "NP Optimization Problems and their Approximation".

(See a Problem?)

Shlomo Moran's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes (1988) (595)
The stochastic approach for link-structure analysis (SALSA) and the TKC effect (2000) (584)
Geometric applications of a matrix-searching algorithm (1987) (418)
SALSA: the stochastic approach for link-structure analysis (2001) (403)
Self-stabilization of dynamic systems assuming only read/write atomicity (1990) (385)
Predictive caching and prefetching of query results in search engines (2003) (204)
Uniform Dynamic Self-Stabilizing Leader Election (1997) (200)
Non Deterministic Polynomial Optimization Problems and their Approximations (1977) (194)
Optimal implementations of UPGMA and other common clustering algorithms (2007) (169)
A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications (1982) (151)
Tight lower and upper bounds for some distributed algorithms for a complete network of processors (1984) (129)
-(revised Version) (2013) (127)
A modular technique for the design of efficient distributed leader finding algorithms (1985) (110)
On the np-completeness of certain network testing problems (1984) (108)
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs (1983) (102)
Geometric Applications of a Matrix Searching Algorithm (1986) (99)
A Combinatorial Characterization of the Distributed 1-Solvable Tasks (1990) (96)
Rank-Stability and Rank-Similarity of Link-Based Web Ranking Algorithms in Authority-Connected Graphs (2005) (91)
Extended Impossibility Results for Asynchronous Complete Networks (1987) (91)
Minimum propositional proof length is NP-hard to linearly approximate (1998) (83)
A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor (1988) (78)
Resource bounds for self stabilizing message driven protocols (1991) (75)
Computing in Totally Anonymous Asynchronous Shared Memory Systems (1998) (73)
Sequential Machine Characterizations of Trellis and Cellular Automata and Applications (1985) (67)
Convex recolorings of strings and trees: Definitions, hardness results and algorithms (2005) (63)
A Note on the Parallel Complexity of Computing the Rank of Order n Matrices (1980) (55)
Analyzing Expected Time by Scheduler-Luck Games (1995) (53)
Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors (1989) (51)
On approximation problems related to the independent set and vertex cover problems (1984) (43)
The wakeup problem (1990) (43)
Efficient approximation of convex recolorings (2005) (42)
Optimizing result prefetching in web search engines with segmented indices (2002) (41)
Applications of Ramsey's theorem to decision tree complexity (1985) (40)
The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors (1987) (39)
Fast and reliable reconstruction of phylogenetic trees with very short edges (2008) (37)
Optimal Covering of Cacti by Vertex-Disjoint Paths (1991) (37)
Resource Bounds for Self-Stabilizing Message-Driven Protocols (1997) (35)
Lightpath arrangement in survivable rings to minimize the switching cost (2002) (34)
Gap Theorems for Distributed Computation (1993) (33)
The complexity of the characterization of networks supporting shortest-path interval routing (2002) (30)
Bit complexity of breaking and achieving symmetry in chains and rings (2008) (29)
Gap theorems for distributed computing (1986) (28)
Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact) (1991) (28)
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case (1989) (27)
On the Robustness of h^r_m (1996) (26)
Slowing sequential algorithms for obtaining fast distributed and parallel algorithms: maximum matchings (1986) (26)
A lower bound on wait-free counting (1993) (24)
Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching Via Fast Matrix Multiplication (1981) (23)
Concurrent counting (1992) (21)
On the complexity of designing optimal partial-match retrieval systems (1983) (20)
Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight (1990) (19)
On the length of optimal TSP circuits in sets of bounded diameter (1984) (19)
Rotating-Table Games and Derivatives of Words (1993) (19)
Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances (2007) (19)
Possibility and impossibility results in a shared memory environment (1989) (19)
A Lower Bound for Linear Interval Routing (1996) (17)
Closed schedulers: a novel technique for analyzing asynchronous protocols (1995) (16)
Impossibility Results in the Presence of Multiple Faulty Processes (1994) (16)
A lower bound on the period length of a distributed scheduler (1993) (15)
Simple and efficient network decomposition and synchronization (2000) (15)
One-page book embedding under vertex-neighborhood constraints (1990) (14)
Chapter 33 – Optimizing Result Prefetching in Web Search Engines with Segmented Indices (2002) (13)
Uniform self-stabilizing leader election (1993) (13)
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges (2012) (13)
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks (1990) (12)
Competitive caching of query results in search engines (2004) (12)
Partial convex recolorings of trees and galled networks: Tight upper and lower bounds (2011) (12)
Towards optimal distance functions for stochastic substitution models. (2009) (11)
Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems (1981) (11)
Lower bounds for linear interval routing (1999) (11)
Initial failures in distributed computations (1990) (11)
Approximation Algorithms for Survivable Optical Networks (2000) (11)
ON THE LIMITATION (1991) (10)
Space-Efficient Asynchronous Consensus Without Shared Memory Initialization (1993) (10)
A Distributed Channel-Access Protocol for Fully-Connected Networks with Mobile Nodes (1983) (10)
Exact communication costs for consensus and leader in a tree (2003) (10)
Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract) (1994) (10)
The Firing Squad Problem Revisited (2019) (9)
Rank stability and rank similarity of web link-based ranking algorithms (2001) (9)
Using Semi-definite Programming to Enhance Supertree Resolvability (2005) (9)
Public data structures: counters as a special case (1995) (9)
On the Control Power of Integer Division (1983) (8)
Exotic Behaviour of Consensus Numbers (1994) (8)
Parallel Algorithms for Maximum Bipartite Matchings and Maximum 0-1 Flows (1989) (8)
Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM's (1983) (8)
General Approximation Algorithms for some Arithmetical Combinatorial Problems (1981) (8)
Generalized Lower Bounds Derived from Hastad's Main Lemma (1987) (8)
Average and Randomized Complexity of Distributed Problems (1994) (8)
Deciding 1-sovability of distributed task is NP-hard (1990) (7)
Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version) (1989) (7)
Some Results on Relativized Deterministic and Nondeterministic Time Hierarchies (1981) (7)
MinMax algorithms for stabilizing consensus (2019) (7)
Deciding 1-solvability of distributed task is NP-hard (extended abstract) (1991) (6)
A Simple DFS-Based Algorithm for Linear Interval Routing (1997) (6)
Analysis of a Distributed Scheduler for Communication Networks (1988) (6)
Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version) (1989) (6)
Fair Deriviations in Context-Free Grammars (1982) (6)
The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors (1985) (6)
Proving Properties of Interactive Proofs by a Generalized Counting Technique (1989) (6)
Simple and optimal randomized fault-tolerant rumor spreading (2012) (6)
Extremal problems on permutations under cyclic equivalence (1987) (5)
On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract) (1991) (5)
On the Accepting Density Hierarchy in NP (1982) (5)
Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays (1988) (5)
Using approximate agreement to obtain complete disagreement: the output structure of input-free asynchronous computations (1995) (4)
Adaptive Distance Measures for Resolving K2P Quartets: Metric Separation versus Stochastic Noise (2010) (4)
Wait-Freedom vs. Bounded-Freedom in Public Data Structures (1996) (4)
Stochastic errors vs. modeling errors in distance based phylogenetic reconstructions (2012) (4)
Two-Page Book Embedding of Trees under Vertex-Neighborhood Constraints (1993) (4)
A Note on 'Is Shortest Path Problem not Harder Than Matrix Multiplication?' (1981) (3)
Some independence results in complexity theory (1985) (3)
On the totalk-diameter of connection networks (2000) (3)
Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract) (1999) (3)
Closed Schedulers: Constructions and Applications to Consensus Protocols (1992) (3)
Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary Version) (1984) (3)
On the Complexity of Simple Arithmetic Expressions (1981) (3)
Message complexity versus space complexity in fault tolerant broadcast protocols (1989) (3)
Convex Recolorings of Strings and Trees (2003) (2)
On the hardness of inferring phylogenies from triplet-dissimilarities (2007) (2)
On the total/sub k/-diameter of connection networks (1997) (2)
Introducing regulated bias into co-citation ranking schemes on the Web (2005) (2)
The Complexity of Identifying Redundant and Essential Elements (1981) (1)
Finding a minimum spanning tree can be harder than finding a spanning tree in a distributed network (1983) (1)
Uniform self-stabilizing leader election, 1: Complete graph protocols (1993) (1)
Synchronization in Dynamic Networks (2017) (1)
Distributed algorithms for constructing a minimum-weight spanning tree in a broadcast network (1987) (1)
Stochastic errors vs. modeling errors in distance based phylogenetic reconstructions (2011) (1)
A LOWER BOUND ON WAIT-FREE (1993) (1)
Advanced Topics in Algorithms (2012) (0)
Brief Announcement: Self Masking for Hardening Inversions (2022) (0)
Self Masking for Hardening Inversions (2022) (0)
Self Masking for Hardering Inversions (2022) (0)
Concurrent Counting (Extended Abstract). (1992) (0)
North-Holland 125 NOTE (2001) (0)
The Wakeup Problem * • ( DRAFT ) (2014) (0)
Estimating Metrical Change in Fully Connected Mobile Networks - A Least Upper Bound on the Worst Case (1988) (0)
Comparing evolutionary distances via adaptive distance functions. (2018) (0)
Adjustable Coins (2020) (0)
Elementary Derivations of the Real Composition Algebras (2020) (0)
Elementary Derivations of the Euclidean Hurwitz Algebras Adapted from Gadi Moran’s last paper (2021) (0)
On Ttie Cost of Reduc I Ng· Th~ (0)
The Wakeup Problem (Extended Abstract) (1990) (0)
Beating the Bronze Medalist : Limited Merging of Disjoint Rankings (2003) (0)
On Some Decision Problems for RAM Programs (1982) (0)
Inferring Phylogenies from LCA-Distances (2006) (0)
THE ROUND COMPLEXITY OF lS 0 LVABLE TASKS (2014) (0)
A correction algorithm for token-passing sequences in mobile communication networks (1989) (0)
Evaluation of scoring functions for protein multiple sequence alignment using structural alignments (2006) (0)
hh and a Hierarchy of Complexity Classes (1986) (0)
Diagonalization Games (2023) (0)
Simple and Optimal Fault-Tolerant Rumor Spreading (2012) (0)
DECIDING I·SOLVABILITY OF DISTRIBUTED TASKS IS NP.HARD (2014) (0)
Dynamic selection of a performance-effective transmission sequence for token-passing networks with mobile nodes (1983) (0)
Scaling surface soil moisture in the Walnut Gulch Experimental Watershed (2006) (0)
Adaptive methods for computing and comparing evolutionary distances (2017) (0)
TIGHT BOUNDS ON THE ROUND COMPARE OF DISTHBUTED 1-SOLVABLE TASKS∗ (2004) (0)
Simple and optimal randomized fault-tolerant rumor spreading (2014) (0)
Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity (2012) (0)

This paper list is powered by the following services:

Other Resources About Shlomo Moran

en.wikipedia.org

What Schools Are Affiliated With Shlomo Moran?

Shlomo Moran is affiliated with the following schools: