Search the dblp DataBase
Moty Ricklin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Yehuda Afek, Eli Gafni, Moty Ricklin
Upper and Lower Bounds for Routing Schemes in Dynamic Networks (Abstract) [Citation Graph (0, 0)][DBLP]
FOCS, 1989, pp:370-375 [Conf] - Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer
Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract) [Citation Graph (0, 0)][DBLP]
FOCS, 1992, pp:334-343 [Conf] - Amos Fiat, Moty Ricklin
Competitive Algorithms for the Weighted Server Problem. [Citation Graph (0, 0)][DBLP]
ISTCS, 1993, pp:294-303 [Conf] - Yehuda Afek, Moty Ricklin
Sparser: A Paradigm for Running Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
WDAG, 1992, pp:1-10 [Conf] - Yehuda Afek, Moty Ricklin
Sparser: A Paradigm for Running Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1993, v:14, n:2, pp:316-328 [Journal] - Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer
Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1994, v:130, n:1, pp:175-201 [Journal] - Amos Fiat, Moty Ricklin
Competitive Algorithms for the Weighted Server Problem. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1994, v:130, n:1, pp:85-99 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002