Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShlomo Moran
Person information
- affiliation: Technion - Israel Institute of Technology, Haifa, Israel
- award (1993): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[i8]Noga Alon, Olivier Bousquet, Kasper Green Larsen, Shay Moran, Shlomo Moran:
Diagonalization Games. CoRR abs/2301.01924 (2023)- [i7]Noga Alon, Olivier Bousquet, Kasper Green Larsen, Shay Moran, Shlomo Moran:
Diagonalization Games. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c52]Pawel Cyprys, Shlomi Dolev, Shlomo Moran:
Brief Announcement: Self Masking for Hardening Inversions. SSS 2022: 331-334 - [i6]Pawel Cyprys, Shlomi Dolev, Shlomo Moran:
Self Masking for Hardering Inversions. IACR Cryptol. ePrint Arch. 2022: 1274 (2022) - 2021
- [j90]Bernadette Charron-Bost, Shlomo Moran
:
MinMax algorithms for stabilizing consensus. Distributed Comput. 34(3): 195-206 (2021) - [j89]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): 726-736 (2021) - 2020
- [i5]Shlomo Moran, Irad Yavneh:
Adjustable Coins. CoRR abs/2008.03676 (2020)
2010 – 2019
- 2019
- [j88]Bernadette Charron-Bost, Shlomo Moran:
The firing squad problem revisited. Theor. Comput. Sci. 793: 100-112 (2019) - [i4]Bernadette Charron-Bost, Shlomo Moran:
MinMax Algorithms for Stabilizing Consensus. CoRR abs/1906.09073 (2019) - 2018
- [c51]Bernadette Charron-Bost, Shlomo Moran:
The Firing Squad Problem Revisited. STACS 2018: 20:1-20:14 - 2017
- [i3]Bernadette Charron-Bost, Shlomo Moran:
Synchronization in Dynamic Networks. CoRR abs/1706.07831 (2017) - 2016
- [j87]Benjamin Doerr, Carola Doerr, Shay Moran, Shlomo Moran:
Simple and optimal randomized fault-tolerant rumor spreading. Distributed Comput. 29(2): 89-104 (2016) - 2012
- [j86]Daniel Doerr, Ilan Gronau, Shlomo Moran, Irad Yavneh:
Stochastic errors vs. modeling errors in distance based phylogenetic reconstructions. Algorithms Mol. Biol. 7: 22 (2012) - [j85]Ilan Gronau, Shlomo Moran, Sagi Snir:
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges. Random Struct. Algorithms 40(3): 350-384 (2012) - [i2]Benjamin Doerr, Shay Moran, Shlomo Moran, Carola Winzen:
Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity. CoRR abs/1209.6158 (2012) - 2011
- [j84]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): 42:1-42:20 (2011) - [c50]Daniel Doerr, Ilan Gronau, Shlomo Moran, Irad Yavneh:
Stochastic Errors vs. Modeling Errors in Distance Based Phylogenetic Reconstructions - (Extended Abstract). WABI 2011: 49-60 - 2010
- [j83]Ilan Gronau, Shlomo Moran, Irad Yavneh:
Adaptive Distance Measures for Resolving K2P Quartets: Metric Separation versus Stochastic Noise. J. Comput. Biol. 17(11): 1509-1518 (2010)
2000 – 2009
- 2008
- [j82]Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum:
Bit complexity of breaking and achieving symmetry in chains and rings. J. ACM 55(1): 3:1-3:28 (2008) - [j81]Shlomo Moran, Sagi Snir:
Convex recolorings of strings and trees: Definitions, hardness results and algorithms. J. Comput. Syst. Sci. 74(5): 850-869 (2008) - [c49]Ilan Gronau, Shlomo Moran, Sagi Snir:
Fast and reliable reconstruction of phylogenetic trees with very short edges. SODA 2008: 379-388 - 2007
- [j80]Ilan Gronau, Shlomo Moran:
Optimal implementations of UPGMA and other common clustering algorithms. Inf. Process. Lett. 104(6): 205-210 (2007) - [j79]Ilan Gronau, Shlomo Moran:
Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances. J. Comput. Biol. 14(1): 1-15 (2007) - [j78]Shlomo Moran, Sagi Snir:
Efficient approximation of convex recolorings. J. Comput. Syst. Sci. 73(7): 1078-1089 (2007) - [j77]Ilan Gronau, Shlomo Moran:
On the hardness of inferring phylogenies from triplet-dissimilarities. Theor. Comput. Sci. 389(1-2): 44-55 (2007) - 2005
- [j76]Ronny Lempel, Shlomo Moran:
Rank-Stability and Rank-Similarity of Link-Based Web Ranking Algorithms in Authority-Connected Graphs. Inf. Retr. 8(2): 245-264 (2005) - [c48]Shlomo Moran, Sagi Snir:
Efficient Approximation of Convex Recolorings. APPROX-RANDOM 2005: 192-208 - [c47]Shlomo Moran, Satish Rao, Sagi Snir:
Using Semi-definite Programming to Enhance Supertree Resolvability. WABI 2005: 89-103 - [c46]Shlomo Moran, Sagi Snir:
Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms. WADS 2005: 218-232 - [i1]Shlomo Moran, Sagi Snir:
Efficient Approximation of Convex Recolorings. CoRR abs/cs/0505077 (2005) - 2004
- [j75]Ronny Lempel, Shlomo Moran:
Competitive caching of query results in search engines. Theor. Comput. Sci. 324(2-3): 253-271 (2004) - [j74]Ronny Lempel, Shlomo Moran:
Optimizing result prefetching in web search engines with segmented indices. ACM Trans. Internet Techn. 4(1): 31-59 (2004) - 2003
- [j73]Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum:
Exact communication costs for consensus and leader in a tree. J. Discrete Algorithms 1(2): 167-183 (2003) - [c45]Ronny Lempel, Shlomo Moran:
Predictive caching and prefetching of query results in search engines. WWW 2003: 19-28 - 2002
- [j72]Hagit Attiya, Alla Gorbach, Shlomo Moran:
Computing in Totally Anonymous Asynchronous Shared Memory Systems. Inf. Comput. 173(2): 162-183 (2002) - [j71]Tamar Eilam, Shlomo Moran, Shmuel Zaks:
Lightpath arrangement in survivable rings to minimize the switching cost. IEEE J. Sel. Areas Commun. 20(1): 172-182 (2002) - [j70]Tamar Eilam, Shlomo Moran, Shmuel Zaks:
The complexity of the characterization of networks supporting shortest-path interval routing. Theor. Comput. Sci. 289(1): 85-104 (2002) - [j69]Hagit Brit, Shlomo Moran, Gadi Taubenfeld:
Public data structures: counters as a special case. Theor. Comput. Sci. 289(1): 401-423 (2002) - [c44]Ronny Lempel, Shlomo Moran:
Introducing regulated bias into co-citation ranking schemes on the Web. ASIST 2002: 425-435 - [c43]Ronny Lempel, Shlomo Moran:
Optimizing Result Prefetching in Web Search Engines with Segmented Indices. VLDB 2002: 370-381 - 2001
- [j68]Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi:
Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate. J. Symb. Log. 66(1): 171-191 (2001) - [j67]Ronny Lempel, Shlomo Moran:
SALSA: the stochastic approach for link-structure analysis. ACM Trans. Inf. Syst. 19(2): 131-160 (2001) - 2000
- [j66]Ronny Lempel, Shlomo Moran:
The stochastic approach for link-structure analysis (SALSA) and the TKC effect. Comput. Networks 33(1-6): 387-401 (2000) - [j65]Shlomo Moran, Sagi Snir:
Simple and efficient network decomposition and synchronization. Theor. Comput. Sci. 243(1-2): 217-241 (2000) - [j64]Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks:
On the totalk-diameter of connection networks. Theor. Comput. Sci. 247(1-2): 213-228 (2000) - [c42]Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum:
Exact communication costs for consensus and leader in a tree. SIROCCO 2000: 63-77 - [c41]Tamar Eilam, Shlomo Moran, Shmuel Zaks:
Approximation Algorithms for Survivable Optical Networks. DISC 2000: 104-118
1990 – 1999
- 1999
- [j63]Tamar Eilam, Shlomo Moran, Shmuel Zaks:
Lower bounds for linear interval routing. Networks 34(1): 37-46 (1999) - [c40]Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum:
Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract). STOC 1999: 265-274 - 1998
- [c39]Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi:
Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. MFCS 1998: 176-184 - [c38]Hagit Attiya, Alla Gorbach, Shlomo Moran:
Computing in Totally Anonymous Asynchronous Shared Memory Systems. DISC 1998: 49-61 - 1997
- [j62]Shlomo Moran, Gadi Taubenfeld:
A Lower Bound on Wait-Free Counting. J. Algorithms 24(1): 1-19 (1997) - [j61]Shlomi Dolev, Amos Israeli, Shlomo Moran:
Resource Bounds for Self-Stabilizing Message-Driven Protocols. SIAM J. Comput. 26(1): 273-290 (1997) - [j60]Shlomi Dolev, Amos Israeli, Shlomo Moran:
Uniform Dynamic Self-Stabilizing Leader Election. IEEE Trans. Parallel Distributed Syst. 8(4): 424-440 (1997) - [c37]Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks:
On the totalk-diameter of connection networks. ISTCS 1997: 96-106 - [c36]Tamar Eilam, Shlomo Moran, Shmuel Zaks:
The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. SIROCCO 1997: 99-111 - [c35]Tamar Eilam, Shlomo Moran, Shmuel Zaks:
A Simple DFS-Based Algorithm for Linear Interval Routing. WDAG 1997: 37-51 - 1996
- [j59]Gadi Taubenfeld, Shlomo Moran:
Possibility and Impossibility Results in a Shared Memory Environment. Acta Informatica 33(1): 1-20 (1996) - [j58]Shlomo Moran, Gadi Taubenfeld, Irit Yadin:
Concurrent Counting. J. Comput. Syst. Sci. 53(1): 61-78 (1996) - [j57]Hagit Brit, Shlomo Moran:
Wait-Freedom vs. Bounded-Freedom in Public Data Structures. J. Univers. Comput. Sci. 2(1): 2-19 (1996) - [j56]Nechama Allenberg-Navony, Alon Itai, Shlomo Moran:
Average and Randomized Complexity of Distributed Problems. SIAM J. Comput. 25(6): 1254-1267 (1996) - [j55]Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld:
The Wakeup Problem. SIAM J. Comput. 25(6): 1331-1332 (1996) - [c34]Tamar Eilam, Shlomo Moran, Shmuel Zaks:
A Lower Bound for Linear Interval Routing. WDAG 1996: 191-205 - [c33]Shlomo Moran, Lihu Rappoport:
On the Robustness of h^r_m. WDAG 1996: 344-361 - 1995
- [j54]Ronit Lubitch, Shlomo Moran:
Closed Schedulers: A Novel Technique for Analyzing Asynchronous Protocols. Distributed Comput. 8(4): 203-210 (1995) - [j53]Ofer Biran, Shlomo Moran, Shmuel Zaks:
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. Theor. Comput. Sci. 145(1&2): 271-290 (1995) - [j52]Shlomi Dolev, Amos Israeli, Shlomo Moran:
Analyzing Expected Time by Scheduler-Luck Games. IEEE Trans. Software Eng. 21(5): 429-439 (1995) - [c32]Hagit Brit, Shlomo Moran, Gadi Taubenfeld:
Public Data Structures: Counters as a Special Case (Abridged Version). ISTCS 1995: 98-110 - [c31]Shlomo Moran:
Using Approximate Agreement to Obtain Complete Disagreement: The Output Structure of Input-Free Asynchronous Computations. ISTCS 1995: 251-257 - 1994
- [j51]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): 34-50 (1994) - [j50]Gadi Taubenfeld, Shmuel Katz, Shlomo Moran:
Impossibility Results in the Presence of Multiple Faulty Processes. Inf. Comput. 113(2): 173-198 (1994) - [c30]Hagit Brit, Shlomo Moran:
Wait-Freedom vs. Bounded Wait-Freedom in Public Data Structures (Extended Abstract). PODC 1994: 52-60 - [c29]Robert Cori, Shlomo Moran:
Exotic Behaviour of Consensus Numbers. WDAG 1994: 101-115 - [c28]Nechama Allenberg-Navony, Alon Itai, Shlomo Moran:
Average and Randomized Complexity of Distributed Problems. WDAG 1994: 311-325 - 1993
- [j49]Yossi Malka, Shlomo Moran, Shmuel Zaks:
A Lower Bound on the Period Length of a Distributed Scheduler. Algorithmica 10(5): 383-398 (1993) - [j48]Shlomo Moran, Yaron Wolfsthal:
Two-Page Book Embedding of Trees under Vertex-Neighborhood Constraints. Discret. Appl. Math. 43(3): 233-241 (1993) - [j47]Shlomi Dolev, Amos Israeli, Shlomo Moran:
Self-Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity. Distributed Comput. 7(1): 3-16 (1993) - [j46]Michael J. Fischer, Shlomo Moran, Gadi Taubenfeld:
Space-Efficient Asynchronous Consensus Without Shared Memory Initialization. Inf. Process. Lett. 45(2): 101-105 (1993) - [j45]Shlomo Moran, Manfred K. Warmuth:
Gap Theorems for Distributed Computation. SIAM J. Comput. 22(2): 379-394 (1993) - [j44]Reuven Bar-Yehuda, Tuvi Etzion, Shlomo Moran:
Rotating-Table Games and Derivatives of Words. Theor. Comput. Sci. 108(2): 311-329 (1993) - [c27]Shlomo Moran, Gadi Taubenfeld:
A Lower Bound on Wait-Free Counting. PODC 1993: 251-259 - 1992
- [c26]Shlomo Moran, Gadi Taubenfeld, Irit Yadin:
Concurrent Counting (Extended Abstract). PODC 1992: 59-70 - [c25]Ronit Lubitch, Shlomo Moran:
Closed Schedulers: Constructions and Applications to Consensus Protocols. WDAG 1992: 11-34 - 1991
- [j43]Shlomo Moran, Yaron Wolfsthal:
Optimal Covering of Cacti by Vertex-Disjoint Paths. Theor. Comput. Sci. 84(2): 179-197 (1991) - [c24]Shlomi Dolev, Amos Israeli, Shlomo Moran:
Resource Bounds for Self Stabilizing Message Driven Protocols. PODC 1991: 281-293 - [c23]Uri Abraham, Shai Ben-David, Shlomo Moran:
On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract). WDAG 1991: 1-8 - [c22]Shlomi Dolev, Amos Israeli, Shlomo Moran:
Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact). WDAG 1991: 167-180 - 1990
- [j42]Ofer Biran, Shlomo Moran, Shmuel Zaks:
A Combinatorial Characterization of the Distributed 1-Solvable Tasks. J. Algorithms 11(3): 420-440 (1990) - [j41]Shlomo Moran, Ilan Newman, Yaron Wolfstahl:
Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight. Networks 20(1): 55-64 (1990) - [j40]Shlomo Moran, Yaron Wolfstahl:
One-Page Book Embedding Under Vertex-Neighborhood Constraints. SIAM J. Discret. Math. 3(3): 376-390 (1990) - [j39]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): 84-101 (1990) - [c21]Shlomo Moran, Yaron Wolfsthal:
One-page book embedding under vertex-neighborhood constraints. Jerusalem Conference on Information Technology 1990: 436-446 - [c20]Shlomi Dolev, Amos Israeli, Shlomo Moran:
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity. PODC 1990: 103-117 - [c19]Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld:
The Wakeup Problem (Extended Abstract). STOC 1990: 106-116 - [c18]Ofer Biran, Shlomo Moran, Shmuel Zaks:
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. WDAG 1990: 373-389 - [c17]Ofer Biran, Shlomo Moran, Shmuel Zaks:
Deciding 1-sovability of distributed task is NP-hard. WG 1990: 206-220
1980 – 1989
- 1989
- [j38]Yaron I. Gold, Shlomo Moran:
A Correction Algorithm for Token-Passing Sequences in Mobile Communication Networks. Algorithmica 4(3): 329-341 (1989) - [j37]László Babai, Shlomo Moran:
Proving Properties of Interactive Proofs by a Generalized Counting Technique. Inf. Comput. 82(2): 185-197 (1989) - [j36]Gadi Taubenfeld, Shmuel Katz, Shlomo Moran:
Initial failures in distributed computations. Int. J. Parallel Program. 18(4): 255-276 (1989) - [j35]Baruch Schieber, Shlomo Moran:
Parallel Algorithms for Maximum Bipartite Matchings and Maximum 0-1 Flows. J. Parallel Distributed Comput. 6(1): 20-38 (1989) - [j34]Shlomo Moran:
Message complexity versus space complexity in fault tolerant broadcast protocols. Networks 19(5): 505-519 (1989) - [j33]Ephraim Korach, Shlomo Moran, Shmuel Zaks:
Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors. Theor. Comput. Sci. 64(1): 125-132 (1989) - [c16]Hans L. Bodlaender, Shlomo Moran, Manfred K. Warmuth:
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. FCT 1989: 58-67 - [c15]Gadi Taubenfeld, Shmuel Katz, Shlomo Moran:
Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version). FSTTCS 1989: 109-120 - [c14]Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri:
Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version). WADS 1989: 115-134 - [c13]Gadi Taubenfeld, Shlomo Moran:
Possibility and Impossibility Results in a Shared Memory Environment. WDAG 1989: 254-267 - 1988
- [j32]László Babai, Shlomo Moran:
Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes. J. Comput. Syst. Sci. 36(2): 254-276 (1988) - [j31]Paul Erdös, Israel Koren, Shlomo Moran, Gabriel M. Silberman, Shmuel Zaks:
Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto VLSI Arrays. Math. Syst. Theory 21(2): 85-98 (1988) - [j30]Yaron I. Gold, Shlomo Moran:
Estimating Metrical Change in Fully Connected Mobile Networks - A Least Upper Bound on the Worst Case. IEEE Trans. Computers 37(9): 1156-1162 (1988) - [c12]Yossi Malka, Shlomo Moran, Shmuel Zaks:
Analysis of a Distributed Scheduler for Communication Networks. AWOC 1988: 351-360 - [c11]Ofer Biran, Shlomo Moran, Shmuel Zaks:
A Combinatorial Characterization of the Distributed Tasks Which Are Solvable in the Presence of One Faulty Processor. PODC 1988: 263-275 - 1987
- [j29]Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber:
Geometric Applications of a Matrix-Searching Algorithm. Algorithmica 2: 195-208 (1987) - [j28]Yaron I. Gold, Shlomo Moran:
Distributed Algorithms for Constructing a Minimum-Weight Spaning Tree in a Broadcast Network. Distributed Comput. 2(3): 139-148 (1987) - [j27]Paul Erdös, Nathan Linial, Shlomo Moran:
Extremal problems on permutations under cyclic equivalence. Discret. Math. 64(1): 1-11 (1987) - [j26]Shlomo Moran:
Generalized Lower Bounds Derived from Hastad's Main Lemma. Inf. Process. Lett. 25(6): 383-388 (1987) - [j25]Shlomo Moran, Yaron Wolfstahl:
Extended Impossibility Results for Asynchronous Complete Networks. Inf. Process. Lett. 26(3): 145-151 (1987) - [j24]Ephraim Korach, Shlomo Moran, Shmuel Zaks:
The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors. SIAM J. Comput. 16(2): 231-236 (1987) - 1986
- [c10]Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber:
Geometric Applications of a Matrix Searching Algorithm. SCG 1986: 285-292 - [c9]Shlomo Moran, Manfred K. Warmuth:
Gap Theorems for Distributed Computation. PODC 1986: 131-140 - [c8]Baruch Schieber, Shlomo Moran:
Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings. PODC 1986: 282-292 - 1985
- [j23]