Lower bounds on the competitive ration for mobile user tracking and distributed job scheduling

Authors:
Noga Alon;Gil Kalai;Moty Ricklin;Larry Stockmeyer
Affiliations:
-;-;-;-
Venue:
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Year:
1994

Citing 0
Cited 8

An adversarial model for distributed dynamic load balancing

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Competitive on-line paging strategies for mobile users under delay constraints

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Compositional competitiveness for distributed algorithms

Journal of Algorithms
Improved scheduling in rings

Journal of Parallel and Distributed Computing
Fourier analysis and large independent sets in powers of complete graphs

Journal of Combinatorial Theory Series B
Compositional competitiveness for distributed algorithms

Journal of Algorithms
Survey: Randomly colouring graphs (a combinatorial view)

Computer Science Review
Towards load balanced distributed transactional memory

Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract