| |
 |      |
                                         |
Note: Links lead to the DBLP on the Web. Shlomo Moran 103 Ronny Lempel , Shlomo Moran: Predictive caching and prefetching of query results in search engines. WWW 2003 : 19-28 102 Ronny Lempel , Shlomo Moran: Optimizing Result Prefetching in Web Search Engines with Segmented Indices. VLDB 2002 : 370-381 101 Hagit Attiya , Alla Gorbach , Shlomo Moran: Computing in Totally Anonymous Asynchronous Shared Memory Systems. Information and Computation 173 (2): 162-183 (2002) 100 Hagit Brit , Shlomo Moran, Gadi Taubenfeld : Public data structures: counters as a special case. TCS 289 (1): 401-423 (2002) 99 Tamar Eilam , Shlomo Moran, Shmuel Zaks : The complexity of the characterization of networks supporting shortest-path interval routing. TCS 289 (1): 85-104 (2002) 98 Ronny Lempel , Shlomo Moran: SALSA: the stochastic approach for link-structure analysis. TOIS 19 (2): 131-160 (2001) 97 Tamar Eilam , Shlomo Moran, Shmuel Zaks : Approximation Algorithms for Survivable Optical Networks. DISC 2000 : 104-118 96 Shlomo Moran, Sagi Snir : Simple and efficient network decomposition and synchronization. TCS 243 (1-2): 217-241 (2000) 95 Yefim Dinitz , Tamar Eilam , Shlomo Moran, Shmuel Zaks : On the totalk-diameter of connection networks. TCS 247 (1-2): 213-228 (2000) 94 Ronny Lempel , Shlomo Moran: The stochastic approach for link-structure analysis (SALSA) and the TKC effect. WWW9 / Computer Networks 33 (1-6): 387-401 (2000) 93 Yefim Dinitz , Shlomo Moran, Sergio Rajsbaum : Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract). STOC 1999 : 265-274 92 Tamar Eilam , Shlomo Moran, Shmuel Zaks : Lower bounds for linear interval routing. Networks 34 (1): 37-46 (1999) 91 Hagit Attiya , Alla Gorbach , Shlomo Moran: Computing in Totally Anonymous Asynchronous Shared Memory Systems. DISC 1998 : 49-61 90 Michael Alekhnovich , Samuel R. Buss , Shlomo Moran, Toniann Pitassi : Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. MFCS 1998 : 176-184 89 Yefim Dinitz , Tamar Eilam , Shlomo Moran, Shmuel Zaks : On the total k -diameter of connection networks. ISTCS 1997 : 96-106 88 Tamar Eilam , Shlomo Moran, Shmuel Zaks : A Simple DFS-Based Algorithm for Linear Interval Routing. WDAG 1997 : 37-51 87 Shlomi Dolev , Amos Israeli , Shlomo Moran: Uniform Dynamic Self-Stabilizing Leader Election. IEEE Transactions on Parallel and Distributed Systems 8 (4): 424-440 (1997) 86 Shlomo Moran, Gadi Taubenfeld : A Lower Bound on Wait-Free Counting. J. Algorithms 24 (1): 1-19 (1997) 85 Shlomi Dolev , Amos Israeli , Shlomo Moran: Resource Bounds for Self-Stabilizing Message-Driven Protocols. SIAM J. Comput. 26 (1): 273-290 (1997) 84 Tamar Eilam , Shlomo Moran, Shmuel Zaks : A Lower Bound for Linear Interval Routing. WDAG 1996 : 191-205 83 Shlomo Moran, Lihu Rappoport : On the Robustness of h^r_m. WDAG 1996 : 344-361 82 Gadi Taubenfeld , Shlomo Moran: Possibility and Impossibility Results in a Shared Memory Environment. Acta Informatica 33 (1): 1-20 (1996) 81 Shlomo Moran, Gadi Taubenfeld , Irit Yadin : Concurrent Counting. JCSS 53 (1): 61-78 (1996) 80 Ilagit Brit , Shlomo Moran: Wait-Freedom vs. Bounded-Freedom in Public Data Structures. Journal of Universal Computer Science 2 (1): 2-19 (1996) 79 Nechama Allenberg-Navony , Alon Itai , Shlomo Moran: Average and Randomized Complexity of Distributed Problems. SIAM J. Comput. 25 (6): 1254-1267 (1996) 78 Michael J. Fischer , Shlomo Moran, Steven Rudich , Gadi Taubenfeld : The Wakeup Problem. SIAM J. Comput. 25 (6): 1331-1332 (1996) 77 Shlomo Moran: Using Approximate Agreement to Obtain Complete Disagreement: The Output Structure of Input-Free Asynchronous Computations. ISTCS 1995 : 251-257 76 Hagit Brit , Shlomo Moran, Gadi Taubenfeld : Public Data Structures: Counters as a Special Case (Abridged Version). ISTCS 1995 : 98-110 75 Ronit Lubitch , Shlomo Moran: Closed Schedulers: A Novel Technique for Analyzing Asynchronous Protocols. Distributed Computing 8 (4): 203-210 (1995) 74 Ofer Biran , Shlomo Moran, Shmuel Zaks : Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. TCS 145 (1&2): 271-290 (1995) 73 Shlomi Dolev , Amos Israeli , Shlomo Moran: Analyzing Expected Time by Scheduler-Luck Games. TSE 21 (5): 429-439 (1995) 72 Hagit Brit , Shlomo Moran: Wait-Freedom vs. Bounded Wait-Freedom in Public Data Structures (Extended Abstract). PODC 1994 : 52-60 71 Robert Cori , Shlomo Moran: Exotic Behaviour of Consensus Numbers. WDAG 1994 : 101-115 70 Nechama Allenberg-Navony , Alon Itai , Shlomo Moran: Average and Randomized Complexity of Distributed Problems. WDAG 1994 : 311-325 69 Hans L. Bodlaender , Shlomo Moran, Manfred K. Warmuth : The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. Information and Computation 108 (1): 34-50 (1994) 68 Gadi Taubenfeld , Shmuel Katz , Shlomo Moran: Impossibility Results in the Presence of Multiple Faulty Processes. Information and Computation 113 (2): 173-198 (1994) 67 Shlomo Moran, Gadi Taubenfeld : A Lower Bound on Wait-Free Counting. PODC 1993 : 251-259 66 Yossi Malka , Shlomo Moran, Shmuel Zaks : A Lower Bound on the Period Length of a Distributed Scheduler. Algorithmica 10 (5): 383-398 (1993) 65 Shlomo Moran, Yaron Wolfsthal : Two-Page Book Embedding of Trees under Vertex-Neighborhood Constraints. Discrete Applied Mathematics 43 (3): 233-241 (1993) 64 Shlomi Dolev , Amos Israeli , Shlomo Moran: Self-Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity. Distributed Computing 7 (1): 3-16 (1993) 63 Michael J. Fischer , Shlomo Moran, Gadi Taubenfeld : Space-Efficient Asynchronous Consensus Without Shared Memory Initialization. Information Processing Letters 45 (2): 101-105 (1993) 62 Shlomo Moran, Manfred K. Warmuth : Gap Theorems for Distributed Computation. SIAM J. Comput. 22 (2): 379-394 (1993) 61 Reuven Bar-Yehuda , Tuvi Etzion , Shlomo Moran: Rotating-Table Games and Derivatives of Words. TCS 108 (2): 311-329 (1993) 60 Shlomo Moran, Gadi Taubenfeld , Irit Yadin : Concurrent Counting (Extended Abstract). PODC 1992 : 59-70 59 Ronit Lubitch , Shlomo Moran: Closed Schedulers: Constructions and Applications to Consensus Protocols. WDAG 1992 : 11-34 58 Shlomi Dolev , Amos Israeli , Shlomo Moran: Resource Bounds for Self Stabilizing Message Driven Protocols. PODC 1991 : 281-293 57 Uri Abraham , Shai Ben-David , Shlomo Moran: On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract). WDAG 1991 : 1-8 56 Shlomi Dolev , Amos Israeli , Shlomo Moran: Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact). WDAG 1991 : 167-180 55 Shlomo Moran, Yaron Wolfsthal : Optimal Covering of Cacti by Vertex-Disjoint Paths. TCS 84 (2): 179-197 (1991) 54 Shlomi Dolev , Amos Israeli , Shlomo Moran: Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity. PODC 1990 : 103-117 53 Michael J. Fischer , Shlomo Moran, Steven Rudich , Gadi Taubenfeld : The Wakeup Problem (Extended Abstract). STOC 1990 : 106-116 52 Ofer Biran , Shlomo Moran, Shmuel Zaks : Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. WDAG 1990 : 373-389 51 Ofer Biran , Shlomo Moran, Shmuel Zaks : Deciding 1-sovability of distributed task is NP-hard. WG 1990 : 206-220 50 Ofer Biran , Shlomo Moran, Shmuel Zaks : A Combinatorial Characterization of the Distributed 1-Solvable Tasks. J. Algorithms 11 (3): 420-440 (1990) 49 Shlomo Moran, Yaron Wolfstahl : One-Page Book Embedding Under Vertex-Neighborhood Constraints. SIAM Journal on Discrete Mathematics 3 (3): 376-390 (1990) 48 Ephraim Korach , Shay Kutten , Shlomo Moran: A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. TOPLAS 12 (1): 84-101 (1990) 47 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 46 Gadi Taubenfeld , Shmuel Katz , Shlomo Moran: Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version). FSTTCS 1989 : 109-120 45 Alok Aggarwal , Shlomo Moran, Peter W. Shor , Subhash Suri : Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version). WADS 1989 : 115-134 44 Gadi Taubenfeld , Shlomo Moran: Possibility and Impossibility Results in a Shared Memory Environment. WDAG 1989 : 254-267 43 Yaron I. Gold , Shlomo Moran: A Correction Algorithm for Token-Passing Sequences in Mobile Communication Networks. Algorithmica 4 (3): 329-341 (1989) 42 László Babai , Shlomo Moran: Proving Properties of Interactive Proofs by a Generalized Counting Technique. Information and Computation 82 (2): 185-197 (1989) 41 Baruch Schieber , Shlomo Moran: Parallel Algorithms for Maximum Bipartite Matchings and Maximum 0-1 Flows. Journal of Parallel and Distributed Computing 6 (1): 20-38 (1989) 40 Ephraim Korach , Shlomo Moran, Shmuel Zaks : Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors. TCS 64 (1): 125-132 (1989) 39 Yossi Malka , Shlomo Moran, Shmuel Zaks : Analysis of a Distributed Scheduler for Communication Networks. AWOC 1988 : 351-360 38 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 37 Yaron I. Gold , Shlomo Moran: Estimating Metrical Change in Fully Connected Mobile Networks - A Least Upper Bound on the Worst Case. IEEE Transactions on Computers 37 (9): 1156-1162 (1988) 36 László Babai , Shlomo Moran: Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes. JCSS 36 (2): 254-276 (1988) 35 Paul Erdös , Israel Koren , Shlomo Moran, Gabriel M. Silberman , Shmuel Zaks : Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto VLSI Arrays. Mathematical Systems Theory 21 (2): 85-98 (1988) 34 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) 33 Yaron I. Gold , Shlomo Moran: Distributed Algorithms for Constructing a Minimum-Weight Spaning Tree in a Broadcast Network. Distributed Computing 2 (3): 139-148 (1987) 32 Shlomo Moran: Generalized Lower Bounds Derived from Hastad's Main Lemma. Information Processing Letters 25 (6): 383-388 (1987) 31 Shlomo Moran, Yaron Wolfstahl : Extended Impossibility Results for Asynchronous Complete Networks. Information Processing Letters 26 (3): 145-151 (1987) 30 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) 29 Shlomo Moran, Manfred K. Warmuth : Gap Theorems for Distributed Computation. PODC 1986 : 131-140 28 Baruch Schieber , Shlomo Moran: Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings. PODC 1986 : 282-292 27 Alok Aggarwal , Maria M. Klawe , Shlomo Moran, Peter W. Shor , Robert E. Wilber : Geometric Applications of a Matrix Searching Algorithm. Symposium on Computational Geometry 1986 : 285-292 26 Ephraim Korach , Shay Kutten , Shlomo Moran: A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. PODC 1985 : 163-174 25 Ephraim Korach , Shlomo Moran, Shmuel Zaks : The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors. PODC 1985 : 277-286 24 Shlomo Moran, Marc Snir , Udi Manber : Applications of Ramsey's Theorem to Decision Tree Complexity. JACM 32 (4): 938-949 (1985) 23 Oscar H. Ibarra , Sam M. Kim , Shlomo Moran: Sequential Machine Characterizations of Trellis and Cellular Automata and Applications. SIAM J. Comput. 14 (2): 426-447 (1985) 22 Shlomo Moran, Marc Snir , Udi Manber : Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary Version). FOCS 1984 : 332-337 21 Ephraim Korach , Shlomo Moran, Shmuel Zaks : Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors. PODC 1984 : 199-207 20 Yaron I. Gold , William R. Franta , Shlomo Moran: A Distributed Channel-Access Protocol for Fully-Connected Networks with Mobile Nodes. IEEE Transactions on Computers 32 (2): 133-147 (1983) 19 Oscar H. Ibarra , Shlomo Moran: Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs. JACM 30 (1): 217-228 (1983) 18 Oscar H. Ibarra , Shlomo Moran: Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM's. SIAM J. Comput. 12 (2): 388-394 (1983) 17 Oscar H. Ibarra , Shlomo Moran, Louis E. Rosier : On the Control Power of Integer Division. TCS 24 : 35-52 (1983) 16 Shlomo Moran: On the Complexity of Designing Optimal Partial-Match Retrieval Systems. TODS 8 (4): 543-551 (1983) 15 Sara Porat , Nissim Francez , Shlomo Moran, Shmuel Zaks : Fair Deriviations in Context-Free Grammars. Information and Control 55 (1-3): 108-116 (1982) 14 Oscar H. Ibarra , Shlomo Moran, Roger Hui : A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications. J. Algorithms 3 (1): 45-56 (1982) 13 Oscar H. Ibarra , Shlomo Moran: On Some Decision Problems for RAM Programs. JCSS 24 (1): 69-81 (1982) 12 Shlomo Moran: On the Accepting Density Hierarchy in NP. SIAM J. Comput. 11 (2): 344-349 (1982) 11 Oscar H. Ibarra , Brian S. Leininger , Shlomo Moran: On the Complexity of Simple Arithmetic Expressions. TCS 19 : 17-28 (1982) 10 Oscar H. Ibarra , Brian S. Leininger , Shlomo Moran: On the Complexity of Simple Arithmetic Expressions. ICALP 1981 : 294-304 9 Oscar H. Ibarra , Shlomo Moran, Louis E. Rosier : Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems. Information Processing Letters 12 (5): 227-232 (1981) 8 Oscar H. Ibarra , Shlomo Moran: Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching Via Fast Matrix Multiplication. Information Processing Letters 13 (1): 12-15 (1981) 7 Shlomo Moran: A Note on `Is Shortest Path Problem not Harder Than Matrix Multiplication?'. Information Processing Letters 13 (2): 85-86 (1981) 6 Shlomo Moran, Yehoshua Perl : The Complexity of Identifying Redundant and Essential Elements. J. Algorithms 2 (1): 22-30 (1981) 5 Shlomo Moran: Some Results on Relativized Deterministic and Nondeterministic Time Hierarchies. JCSS 22 (1): 1-8 (1981) 4 Shlomo Moran: General Approximation Algorithms for some Arithmetical Combinatorial Problems. TCS 14 : 289-303 (1981) 3 Azaria Paz , Shlomo Moran: Non Deterministic Polynomial Optimization Problems and their Approximations. TCS 15 : 251-277 (1981) 2 Oscar H. Ibarra , Shlomo Moran, Louis E. Rosier : A Note on the Parallel Complexity of Computing the Rank of Order n Matrices. Information Processing Letters 11 (4/5): 162 (1980) 1 Azaria Paz , Shlomo Moran: Non-Deterministic Polynomial Optimization Problems and Their Approximation. ICALP 1977 : 370-379  DiSC'03 © 2003 Association for Computing Machinery |
