next up previous
Next: Reports (not published elsewhere) Up: Publications: Previous: Submitted

Refereed Conferences

  1. A. Paz and S. Moran, NP Optimization Problems and Their Approximation, 4$^{th} $ ICALP, Turku, Finland, July 1977.
  2. O. Ibarra, B. Leininger and S. Moran, On the Complexity of Simple Arithmetic Expressions, 8$^{th} $ ICALP, Akko, Israel, July 1981.
  3. Y. I. Gold and S. Moran, Dynamic selection of performance-effective transmission sequences for token passing networks with mobile nodes, the Mediterranean Electrotechnical Conference, MELECON,83, Athens, Greece, May 1983. Also 8$^{th} $ Data Communication Symp., Oct. 1983.
  4. Y. I. Gold and S. Moran, A distributed algorithm for constructing a minimum-weight spanning tree in a fully-connected broadcast network, 4$^{th} $ Jerusalem Conf. on Information Technology, May 1984.
  5. E. Korach, S. Moran and S. Zaks, Tight Lower and Upper Bounds for Distributed Algorithms for a complete Network of Processors, 3$^{rd} $ PODC, Vancouver, Canada, August 1984.
  6. S. Moran, M. Snir and U. Manber, Applications of Ramsey Theorem to Decision Trees Complexity, 25$^{th} $ FOCS, Singer Island, Florida, October 1984.
  7. E. Korach, S. Kutten and S. Moran, A Modular Technique For the Design of Efficient Leader Finding Algorithms, 4$^{th} $ PODC, Minaki, Canada, August 1985.
  8. E. Korach, S. Moran and S. Zaks, The Optimality of Distributive Construction of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors, 4$^{th} $ PODC, Minaki, Canada, August 1985.
  9. A. Aggarwal, M. Klawe, S. Moran, P. Shor and R. Wilber, Geometric Application of a Matrix Searching Problem, 2$^{nd} $ ACM Symposium on Computational Geometry, IBM Yorktown, June 1986.
  10. S. Moran and M. Warmuth, Gap Theorems in Distributed Computing, 5$^{th} $ PODC, Calgary, Canada, August 1986.
  11. B. Schieber and S. Moran, Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings, 5$^{th} $ PODC, Calgary, Canada, August 1986.
  12. Y. Malka, S. Moran and S. Zaks Analysis of a Distributed Scheduler for Communication Networks. Aegean Workshop on Computing, Corfu, Greece, July 1988.
  13. O. Biran, S. Moran and S. Zaks, A combinatorial Characterization of the Distributed Tasks which are Solvable in the Presence of One Faulty Processor. 7$^{th} $ PODC, Toronto, Canada, August 1988.
  14. S. Moran and Y. Wolfstahl, Optimal Cover of Cacti by Vertex Disjoint paths. The French-Israeli Conference on Combinatorics and Algorithms, Jerusalem, Israel, November 1988.
  15. S. Dolev, A. Israeli and S. Moran, Self Stabilization of Dynamic Systems, 16th conference of IEEE Israel, Tel Aviv, March 1989.
  16. H. Bodlaender, S. Moran and M. Warmuth, The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. 7th International Conference on fundamentals of computation theory, Szeged, Hungary, August 1989.
  17. A. Aggarwal, S. Moran, P. W. Shor and S. Suri, Computing the Minimum Visible Vertex Distance Between Two Polygons, workshop on algorithms and data structures, Ottawa, Canada, August 1989.
  18. G. Taubenfeld and S. Moran, Possibility and Impossibility Results in a Shared Memory Environment, 3rd international workshop on distributed algorithms, Nice, France, September 1989.
  19. G. Taubenfeld, S. Katz and S. Moran, Impossibility results in the presence of multiple Faulty Processes, 9$^{th} $ conference on foundations of software technology and theoretical computer science, Bangalore, India, December 1989.
  20. M. J. Fischer, S. Moran, S. Rudich and G. Taubenfeld, The Wakeup Problem, $22^{nd} $ STOC, St. Louis, Missouri, May 1990.
  21. O. Biran, S. Moran and S. Zaks, Deciding 1-Solvability of Distributed Task is NP Hard, 16$^{th} $ International Workshop on Graph-Theoretic Concepts in Computer Science, Berlin, June 1990, pp. 206-220.
  22. S. Dolev, A. Israeli and S. Moran, Self Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity, 9$^{th} $ PODC, Quebec City, Canada, August 1990.
  23. O. Biran, S. Moran and S. Zaks, Tight Bounds on the Round Complexity of Distributed 1-solvable tasks, 4$^{th} $ International Workshop on Distributed Algorithms, Bari, Italy, September 1990.
  24. S. Dolev, A. Israeli and S. Moran Resource Bounds for Self Stabilizing Message Driven Protocols, 10$^{th} $ PODC, Montreal, Canada, August 1991.
  25. S. Dolev, A. Israeli and S. Moran Uniform Dynamic Self-Stabilizing leader Election, 5$^{th} $ International Workshop on Distributed Algorithms, Delphi, Greece, October 1991.
  26. U. Abraham , S. B. David and S. Moran On the Limitations of the Global Time Assumption in Distributed Systems, 5$^{th} $ International Workshop on Distributed Algorithms, Delphi, Greece, October 1991.
  27. S. Moran, G. Taubenfeld and I. Yadin, Concurrent Counting, 11$^{th} $ PODC, Vancouver, Canada, August 1992.
  28. R. Lubitch and S. Moran, Closed Schedulers: Construction and applications to Consensus Protocols, 6$^{th} $ International Workshop on Distributed Algorithms, Haifa, Israel, November 1992. (This is a preliminary and extended version of Journal paper 55).
  29. S. Moran and G. Taubenfeld, A Lower Bound on Wait-free Counting, 12$^{th} $ PODC, Cornell, August 1993.
  30. H. Brit and S. Moran Wait-freedom vs. Bounded Wait-freedom in Public Data Structures, 13$^{th} $ PODC, Los Angeles, August, 1994.
  31. N. Alanberg-Navony, A Itai and S. Moran, Average and Randomized Complexity of Distributed Problems, 8$^{th} $ International Workshop on Distributed Algorithms, Terschelling, the Netherlands, September - October, 1994.
  32. R. Cori and S. Moran, Exotic Behaviour of Consensus Numbers, 8$^{th} $ International Workshop on Distributed Algorithms, Terschelling, the Netherlands, September - October, 1994.
  33. H. Brit, G. Taubenfeld and S. Moran, Public Data Structures: Counters as a Special Case, 3$^{rd} $ Israel Symposium on Theory of Computing and Systems, Israel, January 1995.
  34. S. Moran, Using Approximate Agreement to Obtain Complete Disagreement: The Output Structure of Input free Asunchronous Computations, 3$^{rd} $ Israel Symposium on Theory of Computing and Systems, Israel, January 1995.
  35. S. Moran and L. Rappoport On the Robustness of $H^r_m$, 10$^{th} $ International Workshop on Distributed Algorithms, Bologna, Italy, October 1996.
  36. T. Eilam, S. Moran and S. Zaks, A Lower Bound for Linear Interval Routing, 10$^{th} $ International Workshop on Distributed Algorithms, Bologna, Italy, October 1996.
  37. Y. Dinitz, T. Eilam, S. Moran and S. Zaks, On the Total$_k$-Diameter of Connection Networks, 5$^{th} $ Israel Symposium on Theory of Computing and Systems, Israel, June 1997.
  38. T. Eilam, S. Moran and S. Zaks, The Complexity of the Characterization of Networks Supporting Shortest-Path Interval Routing, 4$^{th} $ International Colloquium on Structural Information and Communication Complexity Monte Verita', Ascona, Switzerland, July 1997.
  39. T. Eilam, S. Moran and S. Zaks, A Simple DFS-based Algorithm for Linear Interval Routing, 11$^{th} $ International Workshop on Distributed Algorithms, Saarbrücken, Germany, September 1997.
  40. M. Alekhnovich, S. Buss, S. Moran and T. Pitassi, Minimal Propositional Proof Lengths is NP-hard to Linearly Approximate, 23$^{rd} $ international symposium on Mathematical Foundations of Computer Science, Brno, Czech Republic, August 1998.
  41. H. Attiya, A. Gorbach and S. Moran, Computing in totally anonymous asynchronous shared memory systems, 12$^{th} $ international symposium on DIStributed Computing, Andros, Greece, September 1998.
  42. Y. Dinitz, S. Moran and S. Rajsbaum, Bit complexity of breaking and achieving symmetry, Thirty-First Annual ACM Symposium on Theory of Computing Atlanta, Georgia, May 1-4, 1999. (This is a preliminary version of 81).
  43. R. Lempel and S. Moran, The Stochastic Approach for Link-Structure Analysis (SALSA) and the TKC effect, 9th International World Wide Web conference, Amsterdam, Holland, May 15-19, 2000 (This is a preliminary version of Journal paper 68. It won the best presentation award of the conference). conference version, pdf file
  44. Y. Dinitz, S. Moran and S. Rajsbaum, Exact communication costs for Consensus and Leader in a tree, 7th International Colloquium on Structural Information and Communication Complexity, L'Aquila, Italy, June 20-22, 2000. conference version, postcript file zipped.
  45. T. Eilam, S. Moran and S. Zaks, Approximation Algorithms for Survivable Optical Networks, 14$^{th} $ international symposium on DIStributed Computing, Toledo, Spain, October 4-6, 2000 postscript file
  46. R. Lempel and S. Moran, Optimizing Result Prefetching in Web Search Engines with Segmented Indices, 28th International Conference on Very Large Data Bases, Hong Kong, China, August 20-23, 2002 pdf file
  47. R. Lempel and S. Moran, Introducing Regulated Bias into Co-Citation Ranking Schemes on the Web, American Society for Information Science and Technology Annual meeting, Philadelphia, PA, November 18-21 2002 postcript file
  48. R. Lempel and S. Moran, Predictive Caching and Prefetching of Query Results in Search Engines, 12th International World Wide Web conference, Budapest, Hungary, May 20-24, 2003 (The paper won the best presentation award of the conference). conference version, pdf file
  49. R. Lempel and S. Moran, Rank Stability and Rank Similarity of Link-Based Web Ranking Algorithms in Authority Connected Graphs, Second Workshop on Algorithms and Models for the Web-Graph (WAW 2003), Budapest Hungary, May 2003 (this is a preliminary version of 76).
  50. S. Moran and S. Snir, Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms, Workshop on Algorithms and Data Structures (WADS), Waterloo, Canada, August 2005 (this is a preliminary version of submitted paper 82. Invited to a special issue of selected papers from WADS 2005).
  51. S. Moran and S. Snir, Efficient Approximation of Convex Recolorings, 8th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Berkeley, California, August 2005 (this is a preliminary version of submitted paper 78).
  52. I. Gronau and S. moran, Neighbor Joining Algorithms for Inferring Phylogenies via LCA-Distances, EMBO Workshop on Current Challenges and Problems in Phylogenetics, Cambridge, England, September 2007.
  53. I. Gronau and S. moran, On the Hardness of Inferring Phylogenies from Triplet-Dissimilarities, Future Directions in Phylogenetic Methods and Models, Cambridge, England, December 2007.
  54. I. Gronau, S. Moran and S. Snir, Reconstructing Phylogenetic Trees with Very Short Edges, ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, California, January 2008. pdf file
  55. I. Gronau, S. Moran and I. Yavneh, Towards Optimal Distance Functions for Stochastic Substitution Models, The 13th Annual New Zealand Phylogenetics Conference, Kaikoura, New Zealand, February 2009.
  56. D. Doerr, I. Gronau, S. Moran and I. Yavneh, Stochastic Errors vs. Modeling Errors in Distance Based Phylogenetic Reconstruction, The 11th workshop on Algorithms in Bioinformatics (WABI11), Saarbrucken, Germany, September 2011.


next up previous
Next: Reports (not published elsewhere) Up: Publications: Previous: Submitted
Shlomo Moran 2014-06-09