Shlomo Moran

ORCID

Publication Activity (10 Years)

Years Active: 1977-2023
Publications (10 Years): 12

Top Venues

CoRR

Distributed Comput.

Am. Math. Mon.

IACR Cryptol. ePrint Arch.

Publications

Noga Alon, Olivier Bousquet, Kasper Green Larsen, Shay Moran, Shlomo Moran
Diagonalization Games. Electron. Colloquium Comput. Complex. (2023)
Noga Alon, Olivier Bousquet, Kasper Green Larsen, Shay Moran, Shlomo Moran
Diagonalization Games. CoRR (2023)
Pawel Cyprys, Shlomi Dolev, Shlomo Moran
Brief Announcement: Self Masking for Hardening Inversions. SSS (2022)
Pawel Cyprys, Shlomi Dolev, Shlomo Moran
Self Masking for Hardering Inversions. IACR Cryptol. ePrint Arch. 2022 (2022)
Bernadette Charron-Bost, Shlomo Moran
MinMax algorithms for stabilizing consensus. Distributed Comput. 34 (3) (2021)
Tomer Moran, Shay Moran, Shlomo Moran
Elementary Derivations of the Euclidean Hurwitz Algebras Adapted from Gadi Moran's last paper. Am. Math. Mon. 128 (8) (2021)
Shlomo Moran, Irad Yavneh
Adjustable Coins. CoRR (2020)
Bernadette Charron-Bost, Shlomo Moran
MinMax Algorithms for Stabilizing Consensus. CoRR (2019)
Bernadette Charron-Bost, Shlomo Moran
The firing squad problem revisited. Theor. Comput. Sci. 793 (2019)
Bernadette Charron-Bost, Shlomo Moran
The Firing Squad Problem Revisited. STACS (2018)
Bernadette Charron-Bost, Shlomo Moran
Synchronization in Dynamic Networks. CoRR (2017)
Benjamin Doerr, Carola Doerr, Shay Moran, Shlomo Moran
Simple and optimal randomized fault-tolerant rumor spreading. Distributed Comput. 29 (2) (2016)
Benjamin Doerr, Shay Moran, Shlomo Moran, Carola Winzen
Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity CoRR (2012)
Daniel Doerr, Ilan Gronau, Shlomo Moran, Irad Yavneh
Stochastic errors vs. modeling errors in distance based phylogenetic reconstructions. Algorithms Mol. Biol. 7 (2012)
Ilan Gronau, Shlomo Moran, Sagi Snir
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges. Random Struct. Algorithms 40 (3) (2012)
Daniel Doerr, Ilan Gronau, Shlomo Moran, Irad Yavneh
Stochastic Errors vs. Modeling Errors in Distance Based Phylogenetic Reconstructions - (Extended Abstract). WABI (2011)
Shlomo Moran, Sagi Snir, Wing-Kin Sung
Partial convex recolorings of trees and galled networks: Tight upper and lower bounds. ACM Trans. Algorithms 7 (4) (2011)
Ilan Gronau, Shlomo Moran, Irad Yavneh
Adaptive Distance Measures for Resolving K2P Quartets: Metric Separation versus Stochastic Noise. J. Comput. Biol. 17 (11) (2010)
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
Bit complexity of breaking and achieving symmetry in chains and rings. J. ACM 55 (1) (2008)
Ilan Gronau, Shlomo Moran, Sagi Snir
Fast and reliable reconstruction of phylogenetic trees with very short edges. SODA (2008)
Shlomo Moran, Sagi Snir
Convex recolorings of strings and trees: Definitions, hardness results and algorithms. J. Comput. Syst. Sci. 74 (5) (2008)
Ilan Gronau, Shlomo Moran
Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances. J. Comput. Biol. 14 (1) (2007)
Shlomo Moran, Sagi Snir
Efficient approximation of convex recolorings. J. Comput. Syst. Sci. 73 (7) (2007)
Ilan Gronau, Shlomo Moran
On the hardness of inferring phylogenies from triplet-dissimilarities. Theor. Comput. Sci. 389 (1-2) (2007)
Ilan Gronau, Shlomo Moran
Optimal implementations of UPGMA and other common clustering algorithms. Inf. Process. Lett. 104 (6) (2007)
Shlomo Moran, Sagi Snir
Efficient Approximation of Convex Recolorings CoRR (2005)
Ronny Lempel, Shlomo Moran
Rank-Stability and Rank-Similarity of Link-Based Web Ranking Algorithms in Authority-Connected Graphs. Inf. Retr. 8 (2) (2005)
Shlomo Moran, Sagi Snir
Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms. WADS (2005)
Shlomo Moran, Sagi Snir
Efficient Approximation of Convex Recolorings. APPROX-RANDOM (2005)
Shlomo Moran, Satish Rao, Sagi Snir
Using Semi-definite Programming to Enhance Supertree Resolvability. WABI (2005)
Ronny Lempel, Shlomo Moran
Competitive caching of query results in search engines. Theor. Comput. Sci. 324 (2-3) (2004)
Ronny Lempel, Shlomo Moran
Optimizing result prefetching in web search engines with segmented indices. ACM Trans. Internet Techn. 4 (1) (2004)
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
Exact communication costs for consensus and leader in a tree. J. Discrete Algorithms 1 (2) (2003)
Ronny Lempel, Shlomo Moran
Predictive caching and prefetching of query results in search engines. WWW (2003)
Hagit Brit, Shlomo Moran, Gadi Taubenfeld
Public data structures: counters as a special case. Theor. Comput. Sci. 289 (1) (2002)
Ronny Lempel, Shlomo Moran
Optimizing Result Prefetching in Web Search Engines with Segmented Indices. VLDB (2002)
Tamar Eilam, Shlomo Moran, Shmuel Zaks
The complexity of the characterization of networks supporting shortest-path interval routing. Theor. Comput. Sci. 289 (1) (2002)
Hagit Attiya, Alla Gorbach, Shlomo Moran
Computing in Totally Anonymous Asynchronous Shared Memory Systems. Inf. Comput. 173 (2) (2002)
Tamar Eilam, Shlomo Moran, Shmuel Zaks
Lightpath arrangement in survivable rings to minimize the switching cost. IEEE J. Sel. Areas Commun. 20 (1) (2002)
Ronny Lempel, Shlomo Moran
Introducing regulated bias into co-citation ranking schemes on the Web. ASIST (2002)
Ronny Lempel, Shlomo Moran
SALSA: the stochastic approach for link-structure analysis. ACM Trans. Inf. Syst. 19 (2) (2001)
Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi
Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate. J. Symb. Log. 66 (1) (2001)
Shlomo Moran, Sagi Snir
Simple and efficient network decomposition and synchronization. Theor. Comput. Sci. 243 (1-2) (2000)
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
Exact communication costs for consensus and leader in a tree. SIROCCO (2000)
Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks
On the totalk-diameter of connection networks. Theor. Comput. Sci. 247 (1-2) (2000)
Tamar Eilam, Shlomo Moran, Shmuel Zaks
Approximation Algorithms for Survivable Optical Networks. DISC (2000)
Ronny Lempel, Shlomo Moran
The stochastic approach for link-structure analysis (SALSA) and the TKC effect. Comput. Networks 33 (1-6) (2000)
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract). STOC (1999)
Tamar Eilam, Shlomo Moran, Shmuel Zaks
Lower bounds for linear interval routing. Networks 34 (1) (1999)
Hagit Attiya, Alla Gorbach, Shlomo Moran
Computing in Totally Anonymous Asynchronous Shared Memory Systems. DISC (1998)
Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi
Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. MFCS (1998)
Shlomi Dolev, Amos Israeli, Shlomo Moran
Resource Bounds for Self-Stabilizing Message-Driven Protocols. SIAM J. Comput. 26 (1) (1997)
Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks
-diameter of connection networks. ISTCS (1997)
Tamar Eilam, Shlomo Moran, Shmuel Zaks
The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. SIROCCO (1997)
Shlomi Dolev, Amos Israeli, Shlomo Moran
Uniform Dynamic Self-Stabilizing Leader Election. IEEE Trans. Parallel Distributed Syst. 8 (4) (1997)
Shlomo Moran, Gadi Taubenfeld
A Lower Bound on Wait-Free Counting. J. Algorithms 24 (1) (1997)
Tamar Eilam, Shlomo Moran, Shmuel Zaks
A Simple DFS-Based Algorithm for Linear Interval Routing. WDAG (1997)
Shlomo Moran, Lihu Rappoport
On the Robustness of h^r_m. WDAG (1996)
Gadi Taubenfeld, Shlomo Moran
Possibility and Impossibility Results in a Shared Memory Environment. Acta Informatica 33 (1) (1996)
Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld
The Wakeup Problem. SIAM J. Comput. 25 (6) (1996)
Hagit Brit, Shlomo Moran
Wait-Freedom vs. Bounded-Freedom in Public Data Structures. J. Univers. Comput. Sci. 2 (1) (1996)
Tamar Eilam, Shlomo Moran, Shmuel Zaks
A Lower Bound for Linear Interval Routing. WDAG (1996)
Nechama Allenberg-Navony, Alon Itai, Shlomo Moran
Average and Randomized Complexity of Distributed Problems. SIAM J. Comput. 25 (6) (1996)
Shlomo Moran, Gadi Taubenfeld, Irit Yadin
Concurrent Counting. J. Comput. Syst. Sci. 53 (1) (1996)
Shlomo Moran
Using Approximate Agreement to Obtain Complete Disagreement: The Output Structure of Input-Free Asynchronous Computations. ISTCS (1995)
Shlomi Dolev, Amos Israeli, Shlomo Moran
Analyzing Expected Time by Scheduler-Luck Games. IEEE Trans. Software Eng. 21 (5) (1995)
Hagit Brit, Shlomo Moran, Gadi Taubenfeld
Public Data Structures: Counters as a Special Case (Abridged Version). ISTCS (1995)
Ronit Lubitch, Shlomo Moran
Closed Schedulers: A Novel Technique for Analyzing Asynchronous Protocols. Distributed Comput. 8 (4) (1995)
Ofer Biran, Shlomo Moran, Shmuel Zaks
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. Theor. Comput. Sci. 145 (1&2) (1995)
Nechama Allenberg-Navony, Alon Itai, Shlomo Moran
Average and Randomized Complexity of Distributed Problems. WDAG (1994)
Hagit Brit, Shlomo Moran
Wait-Freedom vs. Bounded Wait-Freedom in Public Data Structures (Extended Abstract). PODC (1994)
Hans L. Bodlaender, Shlomo Moran, Manfred K. Warmuth
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case Inf. Comput. 108 (1) (1994)
Robert Cori, Shlomo Moran
Exotic Behaviour of Consensus Numbers. WDAG (1994)
Gadi Taubenfeld, Shmuel Katz, Shlomo Moran
Impossibility Results in the Presence of Multiple Faulty Processes Inf. Comput. 113 (2) (1994)
Reuven Bar-Yehuda, Tuvi Etzion, Shlomo Moran
Rotating-Table Games and Derivatives of Words. Theor. Comput. Sci. 108 (2) (1993)
Shlomi Dolev, Amos Israeli, Shlomo Moran
Self-Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity. Distributed Comput. 7 (1) (1993)
Yossi Malka, Shlomo Moran, Shmuel Zaks
A Lower Bound on the Period Length of a Distributed Scheduler. Algorithmica 10 (5) (1993)
Shlomo Moran, Yaron Wolfsthal
Two-Page Book Embedding of Trees under Vertex-Neighborhood Constraints. Discret. Appl. Math. 43 (3) (1993)
Shlomo Moran, Gadi Taubenfeld
A Lower Bound on Wait-Free Counting. PODC (1993)
Michael J. Fischer, Shlomo Moran, Gadi Taubenfeld
Space-Efficient Asynchronous Consensus Without Shared Memory Initialization. Inf. Process. Lett. 45 (2) (1993)
Shlomo Moran, Manfred K. Warmuth
Gap Theorems for Distributed Computation. SIAM J. Comput. 22 (2) (1993)
Ronit Lubitch, Shlomo Moran
Closed Schedulers: Constructions and Applications to Consensus Protocols. WDAG (1992)
Shlomo Moran, Gadi Taubenfeld, Irit Yadin
Concurrent Counting (Extended Abstract). PODC (1992)
Uri Abraham, Shai Ben-David, Shlomo Moran
On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract). WDAG (1991)
Shlomo Moran, Yaron Wolfsthal
Optimal Covering of Cacti by Vertex-Disjoint Paths. Theor. Comput. Sci. 84 (2) (1991)
Shlomi Dolev, Amos Israeli, Shlomo Moran
Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact). WDAG (1991)
Shlomi Dolev, Amos Israeli, Shlomo Moran
Resource Bounds for Self Stabilizing Message Driven Protocols. PODC (1991)
Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld
The Wakeup Problem (Extended Abstract) STOC (1990)
Shlomo Moran, Yaron Wolfstahl
One-Page Book Embedding Under Vertex-Neighborhood Constraints. SIAM J. Discret. Math. 3 (3) (1990)
Ofer Biran, Shlomo Moran, Shmuel Zaks
A Combinatorial Characterization of the Distributed 1-Solvable Tasks. J. Algorithms 11 (3) (1990)
Shlomo Moran, Yaron Wolfsthal
One-page book embedding under vertex-neighborhood constraints. Jerusalem Conference on Information Technology (1990)
Ofer Biran, Shlomo Moran, Shmuel Zaks
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. WDAG (1990)
Ofer Biran, Shlomo Moran, Shmuel Zaks
Deciding 1-sovability of distributed task is NP-hard. WG (1990)
Ephraim Korach, Shay Kutten, Shlomo Moran
A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. ACM Trans. Program. Lang. Syst. 12 (1) (1990)
Shlomi Dolev, Amos Israeli, Shlomo Moran
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity. PODC (1990)
Shlomo Moran, Ilan Newman, Yaron Wolfstahl
Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight. Networks 20 (1) (1990)
Ephraim Korach, Shlomo Moran, Shmuel Zaks
Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors. Theor. Comput. Sci. 64 (1) (1989)
Baruch Schieber, Shlomo Moran
Parallel Algorithms for Maximum Bipartite Matchings and Maximum 0-1 Flows. J. Parallel Distributed Comput. 6 (1) (1989)
Gadi Taubenfeld, Shlomo Moran
Possibility and Impossibility Results in a Shared Memory Environment. WDAG (1989)
Shlomo Moran
Message complexity versus space complexity in fault tolerant broadcast protocols. Networks 19 (5) (1989)

Shlomo Moran.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Shlomo Moran