- [AP90] B. Awerbuch and D. Peleg. Sparse partitions. In Proc. 31st IEEE Symp. on Foundations of Computer Science, pages 514--522, 1990.
- [2] O. Biran, S. Moran, and S. Zaks. A combinatorial characterization of the distributed 1solvable tasks. Journal of Algorithm 11, pages 420--440, 1990.
- SALSA: The Stochastic Approach for LinkStructure Analysis \Lambda
- A COMBINATORIAL CHARACTERIZATION OF THE DISTRIBUTED 1-SOLVABLE TASKS 1
- Initial Failures in Distributed Computations Gadi Taubenfeld1
- Efficient Approximation of Convex Recolorings Shlomo Moran
- Approximation Algorithms for Covering a Graph by Vertex-Disjoint Paths of
- [HW90] M. Herlihy and J. Wing. Linearizability: A correctness condition for concurrent objects. ACM Trans. on Programming Languages and Systems, 12(3):463--492,
- Thus, is a run in which process p is activated infinitely often but never terminates its increment operation, a contradiction.
- Introducing Regulated Bias into CoCitation Ranking Schemes on Ronny Lempel
- CICERO/COMPNW2288 24 MARCH 2000 Computer Networks
- Minimum Propositional Proof Length is NPHard to Linearly Approximate
- [IJ90] A. Israeli and M. Jalfon, ``Token Management Schemes and Random walks Yield Self Stabilizing Mutual Exclusion'', Proc. of the Ninth Annual ACM
- A 0 (I) \Delta n fi A(I 0 ) OPT (I 0 ) + (n \Delta n fi ) ff
- [FG94] Fraigniaud, P., Gavoile, C.: Interval Routing Schemes. Research Rep. 9404, LIPSENS Lyon (1994). To appear in Algorithmica.
- Competitive Caching of Query Results in Search Engines
- Gap Theorems for Distributed Computation *
- Fast and Reliable Reconstruction of Phylogenetic Trees with Very Short Edges
- [Mic89] R. Michel. A categorical approach to distributed systems expressibility and knowledge. In Proc. 8th ACM Symp. on Principles of Distributed Computing, pages 129--143, August 1989.
- Fast and Reliable Reconstruction of Phylogenetic Trees with Indistinguishable Edges
- WaitFreedom vs. Bounded WaitFreedom in Public Data Structures
- Neighbor Joining Algorithms for Inferring Phylogenies via LCA-Distances
- 172 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 20, NO. 1, JANUARY 2002 Lightpath Arrangement in Survivable Rings to
- 424 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 8, NO. 4, APRIL 1997 Uniform Dynamic Self-Stabilizing
- Theoretical Computer Science 243 (2000) 217241 www.elsevier.com/locate/tcs
- Applications of Ramsey's Theorem to Decision Tree SHLOMO MORAN
- Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings
- The Distributed Bit Complexity of the Ring: From the Anonymous to the Nonanonymous Case
- Probabilistic Algorithmsfor Deciding Equivalence of Straight-LinePrograms
- A MODULAR TECHNIQUE FOR THE DESIGN OF EFFICIENT DISTRIBUTED LEADER FINDING ALGORITHMS1
- Possibility and Impossibility Results in a Shared Memory Environment
- RESOURCE BOUNDS FOR SELF-STABILIZING MESSAGE DRIVEN SHLOMI DOLEV, AMOS ISRAELI, AND SHLOMO MORAN
- AVERAGE AND RANDOMIZED COMPLEXITY OF DISTRIBUTED NECHAMA ALLENBERG-NAVONY, ALON ITAI , AND SHLOMO MORAN
- Optimizing Result Prefetching in Web Search Engines with Segmented Indices
- Rank-Stability and Rank-Similarity of Link-Based Web Ranking Algorithms in Authority-Connected Graphs
- Optimal Implementations of UPGMA and Other Common Clustering Algorithms
- On The Hardness of Inferring Phylogenies from Triplet-Dissimilarities
- Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms
- Adaptive Distance Measures for Resolving K2P Quartets
- On the Complexity of Designing Optimal Partial-Match Retrieval Systems
- Exact Communication Costs for Consensus and Leader in a Tree
- [10] M. P. Herlihy. Waitfree synchronization. ACM Trans. Prog. Lang. Syst., 13(1):124--149, [11] P. Jayanti and S. Toueg. Wakeup under read/write atomicity. In Proceedings of the 4th
- Towards Optimal Distance Functions for Stochastic Substitutions Models
- Public Data Structures: Counters as a Special Case \Lambda Hagit Brit y Shlomo Moran yz Gadi Taubenfeld x
- TIGHT BOUNDS ON THE ROUND COMPLEXITY OF DISTRIBUTED 1-SOLVABLE TASKS1
- SpaceEfficient Asynchronous Consensus without Shared Memory Initialization
- [FF62] Ford, L.R., Jr and Fulkerson, D.R. Flows in Networks. Princeton Univ. Press, Princeton, NJ, 1962.
- Optimizing Result Prefetching in Web Search Engines with Segmented Indices