Shlomo Moran
Orcid: 0000000332223308Affiliations:
 Technion  Israel Institute of Technology, Haifa, Israel
According to our database^{1},
Shlomo Moran
authored at least 127 papers
between 1977 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on orcid.org

on id.loc.gov

on dl.acm.org
On csauthors.net:
Bibliography
2023
Electron. Colloquium Comput. Complex., 2023
2022
IACR Cryptol. ePrint Arch., 2022
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022
2021
Elementary Derivations of the Euclidean Hurwitz Algebras Adapted from Gadi Moran's last paper.
Am. Math. Mon., 2021
Distributed Comput., 2021
2020
CoRR, 2020
2019
Theor. Comput. Sci., 2019
2017
CoRR, 2017
2016
Distributed Comput., 2016
2012
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges.
Random Struct. Algorithms, 2012
CoRR, 2012
Stochastic errors vs. modeling errors in distance based phylogenetic reconstructions.
Algorithms Mol. Biol., 2012
2011
Partial convex recolorings of trees and galled networks: Tight upper and lower bounds.
ACM Trans. Algorithms, 2011
Stochastic Errors vs. Modeling Errors in Distance Based Phylogenetic Reconstructions  (Extended Abstract).
Proceedings of the Algorithms in Bioinformatics  11th International Workshop, 2011
2010
Adaptive Distance Measures for Resolving K2P Quartets: Metric Separation versus Stochastic Noise.
J. Comput. Biol., 2010
2008
Convex recolorings of strings and trees: Definitions, hardness results and algorithms.
J. Comput. Syst. Sci., 2008
J. ACM, 2008
Proceedings of the Nineteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2008
2007
Theor. Comput. Sci., 2007
J. Comput. Syst. Sci., 2007
J. Comput. Biol., 2007
Inf. Process. Lett., 2007
2005
RankStability and RankSimilarity of LinkBased Web Ranking Algorithms in AuthorityConnected Graphs.
Inf. Retr., 2005
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005
2004
ACM Trans. Internet Techn., 2004
Theor. Comput. Sci., 2004
2003
J. Discrete Algorithms, 2003
Proceedings of the Twelfth International World Wide Web Conference, 2003
2002
The complexity of the characterization of networks supporting shortestpath interval routing.
Theor. Comput. Sci., 2002
Theor. Comput. Sci., 2002
IEEE J. Sel. Areas Commun., 2002
Inf. Comput., 2002
Proceedings of the Information, Connetcitons and Community, 2002
2001
ACM Trans. Inf. Syst., 2001
J. Symb. Log., 2001
2000
Theor. Comput. Sci., 2000
Theor. Comput. Sci., 2000
Comput. Networks, 2000
Proceedings of the Distributed Computing, 14th International Conference, 2000
1999
Networks, 1999
Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract).
Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, 1999
1997
IEEE Trans. Parallel Distributed Syst., 1997
SIAM J. Comput., 1997
J. Algorithms, 1997
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997
Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997
1996
SIAM J. Comput., 1996
SIAM J. Comput., 1996
J. Univers. Comput. Sci., 1996
J. Comput. Syst. Sci., 1996
Acta Informatica, 1996
Proceedings of the Distributed Algorithms, 10th International Workshop, 1996
Proceedings of the Distributed Algorithms, 10th International Workshop, 1996
1995
IEEE Trans. Software Eng., 1995
Theor. Comput. Sci., 1995
Distributed Comput., 1995
Using Approximate Agreement to Obtain Complete Disagreement: The Output Structure of InputFree Asynchronous Computations.
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995
1994
Inf. Comput., September, 1994
The Distributed Bit Complexity of the Ring: From the Anonymous to the Nonanonymous Case
Inf. Comput., January, 1994
Proceedings of the Distributed Algorithms, 8th International Workshop, 1994
WaitFreedom vs. Bounded WaitFreedom in Public Data Structures (Extended Abstract).
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994
1993
Theor. Comput. Sci., 1993
SIAM J. Comput., 1993
Inf. Process. Lett., 1993
Distributed Comput., 1993
Discret. Appl. Math., 1993
Algorithmica, 1993
1992
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992
1991
Theor. Comput. Sci., 1991
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991
On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract).
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991
1990
A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms.
ACM Trans. Program. Lang. Syst., 1990
SIAM J. Discret. Math., 1990
Approximation algorithms for covering a graph by vertexdisjoint paths of maximum total weight.
Networks, 1990
J. Algorithms, 1990
Proceedings of the GraphTheoretic Concepts in Computer Science, 1990
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
1989
Inf. Comput., August, 1989
Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors.
Theor. Comput. Sci., 1989
Networks, 1989
J. Parallel Distributed Comput., 1989
Int. J. Parallel Program., 1989
A Correction Algorithm for TokenPassing Sequences in Mobile Communication Networks.
Algorithmica, 1989
Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version).
Proceedings of the Algorithms and Data Structures, 1989
Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989
1988
Estimating Metrical Change in Fully Connected Mobile Networks  A Least Upper Bound on the Worst Case.
IEEE Trans. Computers, 1988
MinimumDiameter Cyclic Arrangements in Mapping DataFlow Graphs onto VLSI Arrays.
Math. Syst. Theory, 1988
ArthurMerlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes.
J. Comput. Syst. Sci., 1988
A Combinatorial Characterization of the Distributed Tasks Which Are Solvable in the Presence of One Faulty Processor.
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
1987
The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors.
SIAM J. Comput., 1987
Inf. Process. Lett., 1987
Inf. Process. Lett., 1987
Discret. Math., 1987
Distributed Algorithms for Constructing a MinimumWeight Spaning Tree in a Broadcast Network.
Distributed Comput., 1987
Algorithmica, 1987
1986
Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings.
Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, 1986
1985
J. ACM, October, 1985
Sequential Machine Characterizations of Trellis and Cellular Automata and Applications.
SIAM J. Comput., 1985
The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors.
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985
1984
Networks, 1984
J. Comb. Theory B, 1984
On approximation problems related to the independent set and vertex cover problems.
Discret. Appl. Math., 1984
Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984
Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary Version)
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
1983
J. ACM, January, 1983
ACM Trans. Database Syst., 1983
Theor. Comput. Sci., 1983
A Distributed ChannelAccess Protocol for FullyConnected Networks with Mobile Nodes.
IEEE Trans. Computers, 1983
SIAM J. Comput., 1983
Dynamic selection of a performanceeffective transmission sequence for tokenpassing networks with mobile nodes.
Proceedings of the Eighth Symposium on Data Communications, 1983
1982
Theor. Comput. Sci., 1982
SIAM J. Comput., 1982
J. Comput. Syst. Sci., 1982
J. Algorithms, 1982
Inf. Control., 1982
1981
Theor. Comput. Sci., 1981
Theor. Comput. Sci., 1981
J. Comput. Syst. Sci., 1981
J. Algorithms, 1981
Inf. Process. Lett., 1981
Probabilistic Algorithms and StraightLine Programs for Some Rank Decision Problems.
Inf. Process. Lett., 1981
Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching Via Fast Matrix Multiplication.
Inf. Process. Lett., 1981
1980
Inf. Process. Lett., 1980
1977
Proceedings of the Automata, 1977