Amortized efficiency of list update and paging rules
Communications of the ACM
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
A polylog(n)-competitive algorithm for metrical task systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
TCP dynamic acknowledgment delay (extended abstract): theory and practice
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
New on-line algorithms for the page replication problem
Journal of Algorithms
Unfair problems and randomized algorithms for metrical task systems
Information and Computation
On randomization in on-line computation
Information and Computation
Approximation techniques for average completion time scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Better algorithms for unfair metrical task systems and applications
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Optimal On-Line Algorithms for Single-Machine Scheduling
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
On Randomization In Online Computation
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Scheduling on identical machines: How good is LPT in an on-line setting?
Operations Research Letters
Dynamic TCP acknowledgement and other stories about e/(e-1)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Two short notes on the on-line travelling salesman: handling times and lookahead
Theoretical Computer Science
Dynamic TCP acknowledgement: penalizing long delays
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
News from the Online Traveling Repairman
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
News from the online traveling repairman
Theoretical Computer Science - Mathematical foundations of computer science
Dynamic TCP acknowledgment in the LogP model
Journal of Algorithms
On the remote server problem or more about TCP acknowledgments
Theoretical Computer Science
Online scheduling with machine cost and rejection
Discrete Applied Mathematics
Dynamic TCP acknowledgment with sliding window
Theoretical Computer Science
New lower bounds for online k-server routing problems
Information Processing Letters
Online scheduling with general machine cost functions
Discrete Applied Mathematics
Semi-online algorithms for scheduling with machine cost
Journal of Computer Science and Technology
Toward Robust Revenue Management: Competitive Analysis of Online Booking
Operations Research
LP-based online scheduling: from single to parallel machines
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Efficient algorithms for average completion time scheduling
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Randomized algorithms for on-line scheduling problems: how low can't you go?
Operations Research Letters
On time lookahead algorithms for the online data acknowledgement problem
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
ACM SIGACT News
Information Sciences: an International Journal
| Hi-index | 0.00 |