Moty Ricklin

According to our database, Moty Ricklin authored at least 6 papers between 1989 and 1994.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

1994

Algorithms with partial information

Moty Ricklin

PhD thesis, 1994

Competitive Algorithms for the Weighted Server Problem.

Amos Fiat, Moty Ricklin

Theor. Comput. Sci., 1994

Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling.

Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer

Theor. Comput. Sci., 1994

1993

Sparser: A Paradigm for Running Distributed Algorithms.

Yehuda Afek, Moty Ricklin

J. Algorithms, 1993

1992

Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract)

Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1989

Upper and Lower Bounds for Routing Schemes in Dynamic Networks (Abstract)

Yehuda Afek, Eli Gafni, Moty Ricklin

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989