{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T08:36:57Z","timestamp":1787560617031,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425601","type":"print"},{"value":"9783540448082","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44808-x_18","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T20:32:08Z","timestamp":1178224328000},"page":"216-229","source":"Crossref","is-referenced-by-count":6,"title":["Biased Skip Lists for Highly Skewed Access Patterns"],"prefix":"10.1007","author":[{"given":"Funda","family":"Ergun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Cenk \u015eahinalp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan","family":"Sharp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rakesh K.","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,9,11]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"S. Bent, D. Sleator, and R. Tarjan. Biased search trees. SIAM Journal of Computing, 14, 1985.","DOI":"10.1137\/0214041"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1145\/5684.5688","volume":"29","author":"J. L. Bentley","year":"1986","unstructured":"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\u2013330, 1986.","journal-title":"Communication of the ACM"},{"key":"18_CR4","unstructured":"M. Burrows and D. Wheeler. A block-sorting lossless data compression algorithm. DEC SRC Research Report, 124, 1994."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/49.464717"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"G. Cheung and S. McCanne. Optimal routing table design for IP address lookups under memory constraints. In IEEE INFOCOM, 1999.","DOI":"10.1109\/INFCOM.1999.752164"},{"key":"18_CR7","unstructured":"LBL-TCP-3 Trace Data. \n                    http:\/\/ita.ee.lbl.gov\/html\/contrib\/lbl-tcp-3.html"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"A. Dan and D. Towsley. An approximate analysis of the LRU and FIFO buffer replacement schemes. In Proc. ACM SIGMETRICS, 1990.","DOI":"10.1145\/98457.98525"},{"key":"18_CR9","unstructured":"Jon Sharp Funda Ergun, Cenk Sahinalp and Rakesh Sinha. Rapid fire and hire at top ranks: Move to front with faster updates. Technical report, Case Western Reserve University, 2000."},{"key":"18_CR10","unstructured":"D. E. Knuth. The Art of Computer Programming, volume 3-2nd ed. Addison-Wesley, 1997."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"S. Lin and N. McKeown. A simulation study of IP switching. In Proc. ACM SIGCOMM, 1997.","DOI":"10.1145\/263105.263135"},{"key":"18_CR12","unstructured":"Suvo Mittra and Anindya Basu. Packet classification: An argument for a working set model. Technical report, Bell Laboratories, 1999."},{"key":"18_CR13","unstructured":"C. Martinez and S. Roura. Optimal and nearly optimal static weighted skip lists. Technical report, Universitat Politecnica de Catalunya, 1995."},{"key":"18_CR14","unstructured":"E. O\u2019Neil, P. O\u2019Neil, and G. Weikum. The LRU-K page replacement algorithm for database disk buffering. In Proc. 1993 ACM-SIGMOD Conference on Management of Data, 1993."},{"key":"18_CR15","unstructured":"G. Manzini P. Ferragina. Opportunistic data structures with applications. In Proc. IEEE Symposium on Foundations of Computer Science, 2000."},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"W. Pugh. Skip lists: A probabilistic alternative to balanced trees. In Communications of the ACM, 1990.","DOI":"10.1145\/78973.78977"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"W. Pugh. Compressing java class files. In Proc. ACM Sigplan Conference on Programming Language Design and Implementation, 1999.","DOI":"10.1145\/301618.301676"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"R. Seidel and C. Aragon. Randomized search trees. Algorithmica, 16, 1996.","DOI":"10.1007\/BF01940876"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"D. Sleator and R. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32, 1985.","DOI":"10.1145\/3828.3835"},{"key":"18_CR20","unstructured":"Andrew Tanenbaum. Operating Systems: Design and Implementation, 2\n                           \n                    nd\n                  \n                           edition. Prentice-Hall, 1997."},{"key":"18_CR21","unstructured":"C. Leiserson T. Cormen, R. Rivest. Introduction to Algorithms. McGraw Hill, 1990."}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering and Experimentation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44808-X_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T00:46:07Z","timestamp":1547858767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44808-X_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425601","9783540448082"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44808-x_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}