| 2022 | SSS | Brief Announcement: Self Masking for Hardening Inversions. | Pawel Cyprys, Shlomi Dolev, Shlomo Moran |
| 2018 | STACS | The Firing Squad Problem Revisited. | Bernadette Charron-Bost, Shlomo Moran |
| 2011 | WABI | Stochastic Errors vs. Modeling Errors in Distance Based Phylogenetic Reconstructions - (Extended Abstract). | Daniel Doerr, Ilan Gronau, Shlomo Moran, Irad Yavneh |
| 2008 | SODA | Fast and reliable reconstruction of phylogenetic trees with very short edges. | Ilan Gronau, Shlomo Moran, Sagi Snir |
| 2005 | WABI | Using Semi-definite Programming to Enhance Supertree Resolvability. | Shlomo Moran, Satish Rao, Sagi Snir |
| 2005 | WADS | Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms. | Shlomo Moran, Sagi Snir |
| 2003 | WWW | Predictive caching and prefetching of query results in search engines. | Ronny Lempel, Shlomo Moran |
| 2002 | VLDB | Optimizing Result Prefetching in Web Search Engines with Segmented Indices. | Ronny Lempel, Shlomo Moran |
| 2000 | SIROCCO | Exact communication costs for consensus and leader in a tree. | Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum |
| 1999 | STOC | Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract). | Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum |
| 1998 | MFCS | Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. | Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi |
| 1997 | SIROCCO | The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. | Tamar Eilam, Shlomo Moran, Shmuel Zaks |
| 1994 | PODC | Wait-Freedom vs. Bounded Wait-Freedom in Public Data Structures (Extended Abstract). | Hagit Brit, Shlomo Moran |
| 1993 | PODC | A Lower Bound on Wait-Free Counting. | Shlomo Moran, Gadi Taubenfeld |
| 1992 | PODC | Concurrent Counting (Extended Abstract). | Shlomo Moran, Gadi Taubenfeld, Irit Yadin |
| 1991 | PODC | Resource Bounds for Self Stabilizing Message Driven Protocols. | Shlomi Dolev, Amos Israeli, Shlomo Moran |
| 1990 | PODC | Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity. | Shlomi Dolev, Amos Israeli, Shlomo Moran |
| 1990 | STOC | The Wakeup Problem (Extended Abstract) | Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld |
| 1990 | WG | Deciding 1-sovability of distributed task is NP-hard. | Ofer Biran, Shlomo Moran, Shmuel Zaks |
| 1989 | FCT | The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. | Hans L. Bodlaender, Shlomo Moran, Manfred K. Warmuth |
| 1989 | WADS | Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version). | Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri |
| 1988 | PODC | A Combinatorial Characterization of the Distributed Tasks Which Are Solvable in the Presence of One Faulty Processor. | Ofer Biran, Shlomo Moran, Shmuel Zaks |
| 1986 | PODC | Gap Theorems for Distributed Computation. | Shlomo Moran, Manfred K. Warmuth |
| 1986 | PODC | Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings. | Baruch Schieber, Shlomo Moran |
| 1985 | PODC | A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. | Ephraim Korach, Shay Kutten, Shlomo Moran |
| 1985 | PODC | The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors. | Ephraim Korach, Shlomo Moran, Shmuel Zaks |
| 1984 | FOCS | Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary Version) | Shlomo Moran, Marc Snir, Udi Manber |
| 1984 | PODC | Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors. | Ephraim Korach, Shlomo Moran, Shmuel Zaks |
| 1983 | SIGCOMM | Dynamic selection of a performance-effective transmission sequence for token-passing networks with mobile nodes. | Yaron I. Gold, Shlomo Moran |
| 1981 | ICALP | On the Complexity of Simple Arithmetic Expressions. | Oscar H. Ibarra, Brian S. Leininger, Shlomo Moran |
| 1977 | ICALP | Non-Deterministic Polynomial Optimization Problems and Their Approximation. | Azaria Paz, Shlomo Moran |