The following pages link to Shlomo Moran (Q287984):
Displaying 9 items.
- Simple and optimal randomized fault-tolerant rumor spreading (Q287985) (← links)
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727) (← links)
- Geometric applications of a matrix-searching algorithm (Q1101223) (← links)
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes (Q1106840) (← links)
- The distributed bit complexity of the ring: From the anonymous to the non-anonymous case (Q1314268) (← links)
- Impossibility results in the presence of multiple faulty processes (Q1333256) (← links)
- Towards optimal distance functions for stochastic substitution models (Q1625881) (← links)
- Comparing evolutionary distances via adaptive distance functions (Q1648942) (← links)
- Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays (Q3809272) (← links)
