The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Shlomo Moran: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  118. Fast and reliable reconstruction of phylogenetic trees with very short edges. [Citation Graph (, )][DBLP]


  119. Efficient Approximation of Convex Recolorings [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002