On-line complexity of monotone set systems

Authors:
Haim Kaplan;Mario Szegedy
Affiliations:
AT&T Labs Research;AT&T Labs Research
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Citing 8
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Competitive algorithms for server problems

Journal of Algorithms
An optimal algorithm for on-line bipartite matching

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Competitive paging algorithms

Journal of Algorithms
An optimal on-line algorithm for metrical task system

Journal of the ACM (JACM)
On the k-server conjecture

Journal of the ACM (JACM)
Making commitments in the face of uncertainty: how to pick a winner almost every time (extended abstract)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Lower bounds for on-line graph problems with application to on-line circuit and optical routing

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract