Author:
Boyar Joan,Dósa György,Epstein Leah
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. S. Angelopoulos, R. Dorrigiv, A. López-Ortiz, On the separation and equivalence of paging strategies, in: Proceedings of the Twentieth Annual ACM–SIAM Symposium on Discrete Algorithms, SODA’07, 2007, pp. 229–237.
2. S. Angelopoulos, P. Schweitzer, Paging and list update under bijective analysis, in: Proceedings of the Twentieth Annual ACM–SIAM Symposium on Discrete Algorithms, SODA’09, 2009, pp. 1136–1145.
3. Tight results for Next Fit and Worst Fit with resource augmentation;Boyar;Theoretical Computer Science,2010
4. The relative worst order ratio for on-line algorithms;Boyar;ACM Transactions on Algorithms,2007
5. J. Boyar, S. Irani, K.S. Larsen, A comparison of performance measures for online algorithms, in: Proceedings of the 11th International Symposium on Algorithms and Data Structures, WADS’09, 2009, pp. 119–130.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献