Shlomo Moran - RankMe

152 papers A* 20A 3B 7C 3Journal 100Unranked 19

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Self-masking for hardening inversions. Theor. Comput. Sci. Pawel Cyprys, Shlomi Dolev, Shlomo Moran
2024	J	`jnl`	Diagonalization Games. Am. Math. Mon. Noga Alon, Olivier Bousquet, Kasper Green Larsen, Shay Moran, Shlomo Moran
2023	J	`jnl`	Diagonalization Games. CoRR Noga Alon, Olivier Bousquet, Kasper Green Larsen, Shay Moran, Shlomo Moran
2023	J	`jnl`	Diagonalization Games. Electron. Colloquium Comput. Complex. Noga Alon, Olivier Bousquet, Kasper Green Larsen, Shay Moran, Shlomo Moran
2022	C	`conf`	Brief Announcement: Self Masking for Hardening Inversions. SSS Pawel Cyprys, Shlomi Dolev, Shlomo Moran
2022	J	`jnl`	Self Masking for Hardering Inversions. IACR Cryptol. ePrint Arch. Pawel Cyprys, Shlomi Dolev, Shlomo Moran
2021	J	`jnl`	Elementary Derivations of the Euclidean Hurwitz Algebras Adapted from Gadi Moran's last paper. Am. Math. Mon. Tomer Moran, Shay Moran, Shlomo Moran
2021	J	`jnl`	MinMax algorithms for stabilizing consensus. Distributed Comput. Bernadette Charron-Bost, Shlomo Moran
2020	J	`jnl`	Adjustable Coins. CoRR Shlomo Moran, Irad Yavneh
2019	J	`jnl`	MinMax Algorithms for Stabilizing Consensus. CoRR Bernadette Charron-Bost, Shlomo Moran
2019	J	`jnl`	The firing squad problem revisited. Theor. Comput. Sci. Bernadette Charron-Bost, Shlomo Moran
2018	A	`conf`	The Firing Squad Problem Revisited. STACS Bernadette Charron-Bost, Shlomo Moran
2017	J	`jnl`	Synchronization in Dynamic Networks. CoRR Bernadette Charron-Bost, Shlomo Moran
2016	J	`jnl`	Simple and optimal randomized fault-tolerant rumor spreading. Distributed Comput. Benjamin Doerr, Carola Doerr, Shay Moran, Shlomo Moran
2012	J	`jnl`	Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity CoRR Benjamin Doerr, Shay Moran, Shlomo Moran, Carola Winzen
2012	J	`jnl`	Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges. Random Struct. Algorithms Ilan Gronau, Shlomo Moran, Sagi Snir
2012	J	`jnl`	Stochastic errors vs. modeling errors in distance based phylogenetic reconstructions. Algorithms Mol. Biol. Daniel Doerr, Ilan Gronau, Shlomo Moran, Irad Yavneh
2011	J	`jnl`	Partial convex recolorings of trees and galled networks: Tight upper and lower bounds. ACM Trans. Algorithms Shlomo Moran, Sagi Snir, Wing-Kin Sung
2011	C	`conf`	Stochastic Errors vs. Modeling Errors in Distance Based Phylogenetic Reconstructions - (Extended Abstract). WABI Daniel Doerr, Ilan Gronau, Shlomo Moran, Irad Yavneh
2010	J	`jnl`	Adaptive Distance Measures for Resolving K2P Quartets: Metric Separation versus Stochastic Noise. J. Comput. Biol. Ilan Gronau, Shlomo Moran, Irad Yavneh
2008	J	`jnl`	Bit complexity of breaking and achieving symmetry in chains and rings. J. ACM Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
2008	J	`jnl`	Convex recolorings of strings and trees: Definitions, hardness results and algorithms. J. Comput. Syst. Sci. Shlomo Moran, Sagi Snir
2008	A*	`conf`	Fast and reliable reconstruction of phylogenetic trees with very short edges. SODA Ilan Gronau, Shlomo Moran, Sagi Snir
2007	J	`jnl`	Efficient approximation of convex recolorings. J. Comput. Syst. Sci. Shlomo Moran, Sagi Snir
2007	J	`jnl`	Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances. J. Comput. Biol. Ilan Gronau, Shlomo Moran
2007	J	`jnl`	On the hardness of inferring phylogenies from triplet-dissimilarities. Theor. Comput. Sci. Ilan Gronau, Shlomo Moran
2007	J	`jnl`	Optimal implementations of UPGMA and other common clustering algorithms. Inf. Process. Lett. Ilan Gronau, Shlomo Moran
2005	B	`conf`	Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms. WADS Shlomo Moran, Sagi Snir
2005	J	`jnl`	Efficient Approximation of Convex Recolorings CoRR Shlomo Moran, Sagi Snir
2005	—	`conf`	Efficient Approximation of Convex Recolorings. APPROX-RANDOM Shlomo Moran, Sagi Snir
2005	J	`jnl`	Rank-Stability and Rank-Similarity of Link-Based Web Ranking Algorithms in Authority-Connected Graphs. Inf. Retr. Ronny Lempel, Shlomo Moran
2005	C	`conf`	Using Semi-definite Programming to Enhance Supertree Resolvability. WABI Shlomo Moran, Satish Rao, Sagi Snir
2004	J	`jnl`	Competitive caching of query results in search engines. Theor. Comput. Sci. Ronny Lempel, Shlomo Moran
2004	J	`jnl`	Optimizing result prefetching in web search engines with segmented indices. ACM Trans. Internet Techn. Ronny Lempel, Shlomo Moran
2003	J	`jnl`	Exact communication costs for consensus and leader in a tree. J. Discrete Algorithms Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
2003	A*	`conf`	Predictive caching and prefetching of query results in search engines. WWW Ronny Lempel, Shlomo Moran
2002	J	`jnl`	Computing in Totally Anonymous Asynchronous Shared Memory Systems. Inf. Comput. Hagit Attiya, Alla Gorbach, Shlomo Moran
2002	—	`conf`	Introducing regulated bias into co-citation ranking schemes on the Web. ASIST Ronny Lempel, Shlomo Moran
2002	J	`jnl`	Lightpath arrangement in survivable rings to minimize the switching cost. IEEE J. Sel. Areas Commun. Tamar Eilam, Shlomo Moran, Shmuel Zaks
2002	A*	`conf`	Optimizing Result Prefetching in Web Search Engines with Segmented Indices. VLDB Ronny Lempel, Shlomo Moran
2002	J	`jnl`	Public data structures: counters as a special case. Theor. Comput. Sci. Hagit Brit, Shlomo Moran, Gadi Taubenfeld
2002	J	`jnl`	The complexity of the characterization of networks supporting shortest-path interval routing. Theor. Comput. Sci. Tamar Eilam, Shlomo Moran, Shmuel Zaks
2001	J	`jnl`	Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate. J. Symb. Log. Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi
2001	J	`jnl`	SALSA: the stochastic approach for link-structure analysis. ACM Trans. Inf. Syst. Ronny Lempel, Shlomo Moran
2000	A	`conf`	Approximation Algorithms for Survivable Optical Networks. DISC Tamar Eilam, Shlomo Moran, Shmuel Zaks
2000	B	`conf`	Exact communication costs for consensus and leader in a tree. SIROCCO Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
2000	J	`jnl`	On the totalk-diameter of connection networks. Theor. Comput. Sci. Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks
2000	J	`jnl`	Simple and efficient network decomposition and synchronization. Theor. Comput. Sci. Shlomo Moran, Sagi Snir
2000	J	`jnl`	The stochastic approach for link-structure analysis (SALSA) and the TKC effect. Comput. Networks Ronny Lempel, Shlomo Moran
1999	A*	`conf`	Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract). STOC Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
1999	J	`jnl`	Lower bounds for linear interval routing. Networks Tamar Eilam, Shlomo Moran, Shmuel Zaks
1998	A	`conf`	Computing in Totally Anonymous Asynchronous Shared Memory Systems. DISC Hagit Attiya, Alla Gorbach, Shlomo Moran
1998	B	`conf`	Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. MFCS Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi
1997	J	`jnl`	A Lower Bound on Wait-Free Counting. J. Algorithms Shlomo Moran, Gadi Taubenfeld
1997	—	`conf`	A Simple DFS-Based Algorithm for Linear Interval Routing. WDAG Tamar Eilam, Shlomo Moran, Shmuel Zaks
1997	—	`conf`	On the total ISTCS Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks
1997	J	`jnl`	Resource Bounds for Self-Stabilizing Message-Driven Protocols. SIAM J. Comput. Shlomi Dolev, Amos Israeli, Shlomo Moran
1997	B	`conf`	The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. SIROCCO Tamar Eilam, Shlomo Moran, Shmuel Zaks
1997	J	`jnl`	Uniform Dynamic Self-Stabilizing Leader Election. IEEE Trans. Parallel Distributed Syst. Shlomi Dolev, Amos Israeli, Shlomo Moran
1996	—	`conf`	A Lower Bound for Linear Interval Routing. WDAG Tamar Eilam, Shlomo Moran, Shmuel Zaks
1996	J	`jnl`	Average and Randomized Complexity of Distributed Problems. SIAM J. Comput. Nechama Allenberg-Navony, Alon Itai, Shlomo Moran
1996	J	`jnl`	Concurrent Counting. J. Comput. Syst. Sci. Shlomo Moran, Gadi Taubenfeld, Irit Yadin
1996	—	`conf`	On the Robustness of h^r_m. WDAG Shlomo Moran, Lihu Rappoport
1996	J	`jnl`	Possibility and Impossibility Results in a Shared Memory Environment. Acta Informatica Gadi Taubenfeld, Shlomo Moran
1996	J	`jnl`	The Wakeup Problem. SIAM J. Comput. Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld
1996	J	`jnl`	Wait-Freedom vs. Bounded-Freedom in Public Data Structures. J. Univers. Comput. Sci. Hagit Brit, Shlomo Moran
1995	J	`jnl`	Analyzing Expected Time by Scheduler-Luck Games. IEEE Trans. Software Eng. Shlomi Dolev, Amos Israeli, Shlomo Moran
1995	J	`jnl`	Closed Schedulers: A Novel Technique for Analyzing Asynchronous Protocols. Distributed Comput. Ronit Lubitch, Shlomo Moran
1995	—	`conf`	Public Data Structures: Counters as a Special Case (Abridged Version). ISTCS Hagit Brit, Shlomo Moran, Gadi Taubenfeld
1995	J	`jnl`	Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. Theor. Comput. Sci. Ofer Biran, Shlomo Moran, Shmuel Zaks
1995	—	`conf`	Using Approximate Agreement to Obtain Complete Disagreement: The Output Structure of Input-Free Asynchronous Computations. ISTCS Shlomo Moran
1994	—	`conf`	Average and Randomized Complexity of Distributed Problems. WDAG Nechama Allenberg-Navony, Alon Itai, Shlomo Moran
1994	—	`conf`	Exotic Behaviour of Consensus Numbers. WDAG Robert Cori, Shlomo Moran
1994	J	`jnl`	Impossibility Results in the Presence of Multiple Faulty Processes Inf. Comput. Gadi Taubenfeld, Shmuel Katz, Shlomo Moran
1994	J	`jnl`	The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case Inf. Comput. Hans L. Bodlaender, Shlomo Moran, Manfred K. Warmuth
1994	A*	`conf`	Wait-Freedom vs. Bounded Wait-Freedom in Public Data Structures (Extended Abstract). PODC Hagit Brit, Shlomo Moran
1993	A*	`conf`	A Lower Bound on Wait-Free Counting. PODC Shlomo Moran, Gadi Taubenfeld
1993	J	`jnl`	A Lower Bound on the Period Length of a Distributed Scheduler. Algorithmica Yossi Malka, Shlomo Moran, Shmuel Zaks
1993	J	`jnl`	Gap Theorems for Distributed Computation. SIAM J. Comput. Shlomo Moran, Manfred K. Warmuth
1993	J	`jnl`	Rotating-Table Games and Derivatives of Words. Theor. Comput. Sci. Reuven Bar-Yehuda, Tuvi Etzion, Shlomo Moran
1993	J	`jnl`	Self-Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity. Distributed Comput. Shlomi Dolev, Amos Israeli, Shlomo Moran
1993	J	`jnl`	Space-Efficient Asynchronous Consensus Without Shared Memory Initialization. Inf. Process. Lett. Michael J. Fischer, Shlomo Moran, Gadi Taubenfeld
1993	J	`jnl`	Two-Page Book Embedding of Trees under Vertex-Neighborhood Constraints. Discret. Appl. Math. Shlomo Moran, Yaron Wolfsthal
1992	—	`conf`	Closed Schedulers: Constructions and Applications to Consensus Protocols. WDAG Ronit Lubitch, Shlomo Moran
1992	A*	`conf`	Concurrent Counting (Extended Abstract). PODC Shlomo Moran, Gadi Taubenfeld, Irit Yadin
1991	—	`conf`	On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract). WDAG Uri Abraham, Shai Ben-David, Shlomo Moran
1991	J	`jnl`	Optimal Covering of Cacti by Vertex-Disjoint Paths. Theor. Comput. Sci. Shlomo Moran, Yaron Wolfsthal
1991	A*	`conf`	Resource Bounds for Self Stabilizing Message Driven Protocols. PODC Shlomi Dolev, Amos Israeli, Shlomo Moran
1991	—	`conf`	Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact). WDAG Shlomi Dolev, Amos Israeli, Shlomo Moran
1990	J	`jnl`	A Combinatorial Characterization of the Distributed 1-Solvable Tasks. J. Algorithms Ofer Biran, Shlomo Moran, Shmuel Zaks
1990	J	`jnl`	A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. ACM Trans. Program. Lang. Syst. Ephraim Korach, Shay Kutten, Shlomo Moran
1990	J	`jnl`	Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight. Networks Shlomo Moran, Ilan Newman, Yaron Wolfstahl
1990	B	`conf`	Deciding 1-sovability of distributed task is NP-hard. WG Ofer Biran, Shlomo Moran, Shmuel Zaks
1990	J	`jnl`	One-Page Book Embedding Under Vertex-Neighborhood Constraints. SIAM J. Discret. Math. Shlomo Moran, Yaron Wolfstahl
1990	—	`conf`	One-page book embedding under vertex-neighborhood constraints. Jerusalem Conference on Information Technology Shlomo Moran, Yaron Wolfsthal
1990	A*	`conf`	Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity. PODC Shlomi Dolev, Amos Israeli, Shlomo Moran
1990	A*	`conf`	The Wakeup Problem (Extended Abstract) STOC Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld
1990	—	`conf`	Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. WDAG Ofer Biran, Shlomo Moran, Shmuel Zaks
1989	J	`jnl`	A Correction Algorithm for Token-Passing Sequences in Mobile Communication Networks. Algorithmica Yaron I. Gold, Shlomo Moran
1989	B	`conf`	Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version). WADS Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri
1989	—	`conf`	Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version). FSTTCS Gadi Taubenfeld, Shmuel Katz, Shlomo Moran
1989	J	`jnl`	Initial failures in distributed computations. Int. J. Parallel Program. Gadi Taubenfeld, Shmuel Katz, Shlomo Moran
1989	J	`jnl`	Message complexity versus space complexity in fault tolerant broadcast protocols. Networks Shlomo Moran
1989	J	`jnl`	Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors. Theor. Comput. Sci. Ephraim Korach, Shlomo Moran, Shmuel Zaks
1989	J	`jnl`	Parallel Algorithms for Maximum Bipartite Matchings and Maximum 0-1 Flows. J. Parallel Distributed Comput. Baruch Schieber, Shlomo Moran
1989	—	`conf`	Possibility and Impossibility Results in a Shared Memory Environment. WDAG Gadi Taubenfeld, Shlomo Moran
1989	J	`jnl`	Proving Properties of Interactive Proofs by a Generalized Counting Technique Inf. Comput. László Babai, Shlomo Moran
1989	B	`conf`	The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. FCT Hans L. Bodlaender, Shlomo Moran, Manfred K. Warmuth
1988	A*	`conf`	A Combinatorial Characterization of the Distributed Tasks Which Are Solvable in the Presence of One Faulty Processor. PODC Ofer Biran, Shlomo Moran, Shmuel Zaks
1988	—	`conf`	Analysis of a Distributed Scheduler for Communication Networks. AWOC Yossi Malka, Shlomo Moran, Shmuel Zaks
1988	J	`jnl`	Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes. J. Comput. Syst. Sci. László Babai, Shlomo Moran
1988	J	`jnl`	Estimating Metrical Change in Fully Connected Mobile Networks - A Least Upper Bound on the Worst Case. IEEE Trans. Computers Yaron I. Gold, Shlomo Moran
1988	J	`jnl`	Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto VLSI Arrays. Math. Syst. Theory Paul Erdös, Israel Koren, Shlomo Moran, Gabriel M. Silberman, Shmuel Zaks
1987	J	`jnl`	Distributed Algorithms for Constructing a Minimum-Weight Spaning Tree in a Broadcast Network. Distributed Comput. Yaron I. Gold, Shlomo Moran
1987	J	`jnl`	Extended Impossibility Results for Asynchronous Complete Networks. Inf. Process. Lett. Shlomo Moran, Yaron Wolfstahl
1987	J	`jnl`	Extremal problems on permutations under cyclic equivalence. Discret. Math. Paul Erdös, Nathan Linial, Shlomo Moran
1987	J	`jnl`	Generalized Lower Bounds Derived from Hastad's Main Lemma. Inf. Process. Lett. Shlomo Moran
1987	J	`jnl`	Geometric Applications of a Matrix-Searching Algorithm. Algorithmica Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber
1987	J	`jnl`	The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors. SIAM J. Comput. Ephraim Korach, Shlomo Moran, Shmuel Zaks
1986	A*	`conf`	Gap Theorems for Distributed Computation. PODC Shlomo Moran, Manfred K. Warmuth
1986	—	`conf`	Geometric Applications of a Matrix Searching Algorithm. SCG Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber
1986	A*	`conf`	Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings. PODC Baruch Schieber, Shlomo Moran
1985	A*	`conf`	A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. PODC Ephraim Korach, Shay Kutten, Shlomo Moran
1985	J	`jnl`	Applications of Ramsey's Theorem to Decision Tree Complexity J. ACM Shlomo Moran, Marc Snir, Udi Manber
1985	J	`jnl`	Sequential Machine Characterizations of Trellis and Cellular Automata and Applications. SIAM J. Comput. Oscar H. Ibarra, Sam M. Kim, Shlomo Moran
1985	A*	`conf`	The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors. PODC Ephraim Korach, Shlomo Moran, Shmuel Zaks
1984	A*	`conf`	Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary Version) FOCS Shlomo Moran, Marc Snir, Udi Manber
1984	J	`jnl`	On approximation problems related to the independent set and vertex cover problems. Discret. Appl. Math. Reuven Bar-Yehuda, Shlomo Moran
1984	J	`jnl`	On the length of optimal TSP circuits in sets of bounded diameter. J. Comb. Theory B Shlomo Moran
1984	J	`jnl`	On the np-completeness of certain network testing problems. Networks Shimon Even, Oded Goldreich, Shlomo Moran, Po Tong
1984	A*	`conf`	Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors. PODC Ephraim Korach, Shlomo Moran, Shmuel Zaks
1983	J	`jnl`	A Distributed Channel-Access Protocol for Fully-Connected Networks with Mobile Nodes. IEEE Trans. Computers Yaron I. Gold, William R. Franta, Shlomo Moran
1983	A*	`conf`	Dynamic selection of a performance-effective transmission sequence for token-passing networks with mobile nodes. SIGCOMM Yaron I. Gold, Shlomo Moran
1983	J	`jnl`	On the Complexity of Designing Optimal Partial-Match Retrieval Systems. ACM Trans. Database Syst. Shlomo Moran
1983	J	`jnl`	On the Control Power of Integer Division. Theor. Comput. Sci. Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier
1983	J	`jnl`	Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs J. ACM Oscar H. Ibarra, Shlomo Moran
1983	J	`jnl`	Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM's. SIAM J. Comput. Oscar H. Ibarra, Shlomo Moran
1982	J	`jnl`	A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications. J. Algorithms Oscar H. Ibarra, Shlomo Moran, Roger Hui
1982	J	`jnl`	Fair Deriviations in Context-Free Grammars Inf. Control. Sara Porat, Nissim Francez, Shlomo Moran, Shmuel Zaks
1982	J	`jnl`	On Some Decision Problems for RAM Programs. J. Comput. Syst. Sci. Oscar H. Ibarra, Shlomo Moran
1982	J	`jnl`	On the Accepting Density Hierarchy in NP. SIAM J. Comput. Shlomo Moran
1982	J	`jnl`	On the Complexity of Simple Arithmetic Expressions. Theor. Comput. Sci. Oscar H. Ibarra, Brian S. Leininger, Shlomo Moran
1981	J	`jnl`	A Note on 'Is Shortest Path Problem not Harder Than Matrix Multiplication?'. Inf. Process. Lett. Shlomo Moran
1981	J	`jnl`	Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching Via Fast Matrix Multiplication. Inf. Process. Lett. Oscar H. Ibarra, Shlomo Moran
1981	J	`jnl`	General Approximation Algorithms for some Arithmetical Combinatorial Problems. Theor. Comput. Sci. Shlomo Moran
1981	J	`jnl`	Non Deterministic Polynomial Optimization Problems and their Approximations. Theor. Comput. Sci. Azaria Paz, Shlomo Moran
1981	A*	`conf`	On the Complexity of Simple Arithmetic Expressions. ICALP Oscar H. Ibarra, Brian S. Leininger, Shlomo Moran
1981	J	`jnl`	Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems. Inf. Process. Lett. Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier
1981	J	`jnl`	Some Results on Relativized Deterministic and Nondeterministic Time Hierarchies. J. Comput. Syst. Sci. Shlomo Moran
1981	J	`jnl`	The Complexity of Identifying Redundant and Essential Elements. J. Algorithms Shlomo Moran, Yehoshua Perl
1980	J	`jnl`	A Note on the Parallel Complexity of Computing the Rank of Order n Matrices. Inf. Process. Lett. Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier
1977	A*	`conf`	Non-Deterministic Polynomial Optimization Problems and Their Approximation. ICALP Azaria Paz, Shlomo Moran