Ski rental problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Ski rental problem" in English language version.

refsWebsite

Global rank English rank

2,481^st place

1,558^th place

741^st place

577^th place

1,185^th place

840^th place

415^th place

327^th place

2^nd place

acm.org

Steven S. Seiden. A guessing game and randomized online algorithms. Annual ACM Symposium on Theory of Computing, 2000. http://portal.acm.org/citation.cfm?id=335385

Claire Mathieu. Brown University. Lecture note: http://www.cs.brown.edu/~claire/Talks/skirental.pdf
Anna R. Karlin and Claire Kenyon and Dana Randall. Dynamic TCP acknowledgement and other stories about e/(e-1). Thirty-Third Annual ACM Symposium on Theory of Computing (STOC), 2001. Algorithmica. http://www.cs.brown.edu/people/claire/Publis/ACKpaper.ps

Dooly, Daniel R.; Goldman, Sally A.; Scott, Stephen D. (1998). "TCP Dynamic Acknowledgment Delay: Theory and Practice (Extended Abstract)". In Vitter, Jeffrey Scott (ed.). Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998. {ACM}. pp. 389–398. doi:10.1145/276698.276792.

A. R. Karlin, M. S. Manasse, L. A. McGeoch, and S. Owicki. Competitive randomized algorithms for non-uniform problems. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 22–24 January 1990, pp. 301-309. Also in Algorithmica, 11(6): 542-571, 1994. http://courses.csail.mit.edu/6.895/fall03/handouts/papers/karlin.pdf

Blum, Avrim. "cos 521: Advanced Algorithm Design Lecture 24: Online Algorithms" (PDF). Computer Science Princeton University. Princeton University. Retrieved 2022-07-16.