Author:
Ergun Funda,Cenk Şahinalp S.,Sharp Jonathan,Sinha Rakesh K.
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web caching and zipf-like distributions: Evidence and implications. In Proc. IEEE Infocom, 1999.
2. S. Bent, D. Sleator, and R. Tarjan. Biased search trees. SIAM Journal of Computing, 14, 1985.
3. J. L. Bentley, D. S. Sleator, R. E. Tarjan, and V.K. Wei. A locally adaptive data compression scheme. Communication of the ACM, 29:320–330, 1986.
4. M. Burrows and D. Wheeler. A block-sorting lossless data compression algorithm. DEC SRC Research Report, 124, 1994.
5. K.C. Claffy, H.W. Braun, and G.C. Polyzos. A parameterizable methodology for internet traffic flow profiling. In IEEE Journal on Selected Areas in Communications, 1995.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A performance study of optane persistent memory: from storage data structures' perspective;CCF Transactions on High Performance Computing;2022-09-24
2. Skiplist Timing Attack Vulnerability;Lecture Notes in Computer Science;2019
3. Simplified Self-Adapting Skip Lists;Intelligent Data Engineering and Automated Learning – IDEAL 2010;2010
4. Biased Skip Lists;Algorithms and Computation;2002