Simple competitive request scheduling strategies
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Online request server matching
Theoretical Computer Science
AdWords and Generalized On-line Matching
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Theoretical Computer Science
AdWords and generalized online matching
Journal of the ACM (JACM)
A randomized algorithm for the on-line weighted bipartite matching problem
Journal of Scheduling
Theoretical Computer Science
Online matching for scheduling problems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
An O(log2k)-competitive algorithm for metric bipartite matching
ESA'07 Proceedings of the 15th annual European conference on Algorithms
The online transportation problem: on the exponential boost of one extra server
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Asymptotically optimal algorithm for stochastic adwords
Proceedings of the 13th ACM Conference on Electronic Commerce
The online metric matching problem for doubling metrics
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |