Anna R. Karlin, Claire Kenyon, Dana Randall  Home/Search
Context Related
| lix.polytechnique.fr/~k...ACKjournal.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lix.polytechnique.fr/~kenyon/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present the rst optimal randomized online algorithms for the TCP acknowledgment problem [5] and the Bahncard problem [8]. These problems are well-known to be generalizations of the classical online ski rental problem, however, they appeared to be harder. In this paper, we demonstrate that a number of online algorithms which have optimal competitive ratios of e=(e 1), including these, are fundamentally no more complex than ski rental. Our results also suggest a clear paradigm for... (Update)
Cited by: More
Dynamic TCP Acknowledgment in the LogP Model - Frederiksen, Larsen, Noga.. (Correct)
Dynamic TCP Acknowledgement: Penalizing Long Delays - Albers, Bals (Correct)
Similar documents (at the sentence level):
38.0%: Dynamic TCP Acknowledgement and Other Stories about e/(e-1) - Karlin, Kenyon, Randall (2001) (Correct)
Active bibliography (related documents): More All
0.2: A Guessing Game and Randomized Online Algorithms - Seiden (2000) (Correct)
0.2: TCP is Competitive against a Limited Adversary - Edmonds, Datta, Dymond (2003) (Correct)
0.1: On-Line Scheduling - A Survey - Sgall (1997) (Correct)
Similar documents based on text: More All
0.2: Matchings in Lattice Graphs - Kenyon, Randall, Sinclair (1993) (Correct)
0.2: Approximating the Number of Monomer-Dimer Coverings of a.. - Kenyon, Randall, Sinclair (1996) (Correct)
0.1: d-Dimensional Range Search on Multicomputers - Ferreira, Kenyon, Rau-Chaplin, .. (1996) (Correct)
Related documents from co-citation: More All
2: Amortized Eciency of List Update and Paging Rules (context) - Sleator, Tarjan - 1985
2: A guessing game and randomized online algorithms - Seiden - 2000
2: Online Computation and Competitive Analysis (context) - Borodin, El-Yaniv - 1996
BibTeX entry: (Update)
A.R. Karlin, C. Kenyon and D. Randall. Dynamic TCP acknowledgement and other stories about e=(e 1). Proc. 31st ACM Symposium on Theory of Computing , 502-509, 2001. http://citeseer.ist.psu.edu/article/karlin01dynamic.html More
@inproceedings{ karlin01dynamic,
author = "Anna R. Karlin and Claire Kenyon and Dana Randall",
title = "Dynamic {TCP} acknowledgement and other stories about e/(e-1)",
booktitle = "{ACM} Symposium on Theory of Computing",
pages = "502-509",
year = "2001",
url = "citeseer.ist.psu.edu/article/karlin01dynamic.html" }
Citations (may not include all citations):280 Online Computation and Competitive Analysis (context) - Borodin, Yaniv - 1998
83 Bounds for certain multiprocessor anomalies (context) - Graham - 1966
75 Competitive Randomized Algorithms for Non-Uniform Problems (context) - Karlin, Manasse et al. - 1990
70 A better algorithm for an ancient scheduling problem - Karger, Phillips et al. - 1996
54 Better bounds for online scheduling - Albers - 1997
54 Approximation Techniques for Average Completion Time Schedul.. - Chekuri, Motwani et al. - 1997
32 Private Communication (context) - Noga - 2000
32 Private Communication (context) - Noga, Seiden - 2000
25 A lower bound for randomized on-line multiprocessor scheduli.. - Sgall - 1997
20 A lower bound for randomized on-line scheduling algorithms (context) - Chen, van Vliet et al. - 1994
9 A Guessing Game and Randomized Online Algorithms - Seiden - 2000
5 TCP Dynamic Acknowledgement Delay: Theory and Practice (context) - Dooly, Goldman et al. - 1998
4 The Bahncard Problem - Fleischer - 1998
2 line analysis of the TCP acknowledgment delay problem (context) - Dooly, Goldman et al. - 2001
1 Special Issue on Parallel and Distributed Computing (context) - Karlin, Manasse et al. - 1988
Documents on the same site (http://www.lix.polytechnique.fr/~kenyon/): More
Sensitivity, Block Sensitivity, and l-Block Sensitivity of.. - Kenyon, Kutin (Correct)
Best-Fit Bin-Packing with Random Order - Kenyon (1997) (Correct)
Approximation Schemes for Metric Minimum Bisection and.. - Vega, Karpinski, Kenyon (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC