{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:25:33Z","timestamp":1725470733206},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_28","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T09:20:54Z","timestamp":1157966454000},"page":"292-303","source":"Crossref","is-referenced-by-count":7,"title":["Near-Entropy Hotlink Assignments"],"prefix":"10.1007","author":[{"given":"Karim","family":"Dou\u00efeb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"28_CR1","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0214041","volume":"14","author":"S.W. Bent","year":"1985","unstructured":"Bent, S.W., Sleator, D.D., Tarjan, R.E.: Biased seach trees. SIAM J. Comput.\u00a014(3), 545\u2013568 (1985)","journal-title":"SIAM J. Comput."},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-40996-3_3","volume-title":"Algorithms and Computation","author":"P. Bose","year":"2000","unstructured":"Bose, P., Kranakis, E., Krizanc, D., Martin, M.V., Czyzowicz, J., Pelc, A., Gasieniec, L.: Strategies for hotlink assignments. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 23\u201334. Springer, Heidelberg (2000)"},{"key":"28_CR3","unstructured":"Bose, P., Krizanc, D., Langerman, S., Morin, P.: Asymmetric communication protocols via hotlink assignments. In: Proc. 9th Intl. Coll. on Structural Information and Communication Complexity (SIROCCO 2002), pp. 33\u201340 (2002)"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-36494-3_26","volume-title":"STACS 2003","author":"H. Br\u00f6nnimann","year":"2003","unstructured":"Br\u00f6nnimann, H., Cazals, F., Durand, M.: Randomized jumplists: A jump-and-walk dictionary data structure. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 283\u2013294. Springer, Heidelberg (2003)"},{"key":"28_CR5","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Pelc, A., Martin, M.: Evaluation of hotlink assignment heuristics for improving web access. In: Proc. 2nd Intl. Conf. on Internet Computing (IC 2001), pp. 793\u2013799 (2001)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/11534273_17","volume-title":"Algorithms and Data Structures","author":"K. Dou\u00efeb","year":"2005","unstructured":"Dou\u00efeb, K., Langerman, S.: Dynamic hotlinks. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 271\u2013280. Springer, Heidelberg (2005)"},{"key":"28_CR7","first-page":"27","volume":"12","author":"A. Elmasry","year":"2005","unstructured":"Elmasry, A.: Deterministic jumplists. Nordic Journal of Computing\u00a012, 27\u201339 (2005)","journal-title":"Nordic Journal of Computing"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-45477-2_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Fuhrmann","year":"2001","unstructured":"Fuhrmann, S., Krumke, S.O., Wirth, H.-C.: Multiple hotlink assignment. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 189\u2013200. Springer, Heidelberg (2001)"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-24587-2_9","volume-title":"Algorithms and Computation","author":"O. Gerstel","year":"2003","unstructured":"Gerstel, O., Kutten, S., Matichin, R., Peleg, D.: Hotlink enhancement algorithms for web directories. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 68\u201377. Springer, Heidelberg (2003)"},{"key":"28_CR10","unstructured":"Kranakis, E., Krizanc, D., Martin, M.V.: The hotlink optimizer. In: Proc. 3rd Intl. Conf. on Internet Computing (IC 2002), pp. 33\u201340 (2002)"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1007\/3-540-45678-3_64","volume-title":"Algorithms and Computation","author":"E. Kranakis","year":"2001","unstructured":"Kranakis, E., Krizanc, D., Shende, S.: Approximate hotlink assignment. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 756\u2013767. Springer, Heidelberg (2001)"},{"key":"28_CR12","volume-title":"Information theory and coding","author":"N. Abramson","year":"1963","unstructured":"Abramson, N.: Information theory and coding. McGraw Hill, New York (1963)"},{"issue":"11-16","key":"28_CR13","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S1389-1286(99)00017-1","volume":"31","author":"M. Perkowitz","year":"1999","unstructured":"Perkowitz, M., Etzioni, O.: Towards adaptive Web sites: conceptual framework and case study. Computer Networks\u00a031(11-16), 1245\u20131258 (1999)","journal-title":"Computer Networks"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1007\/978-3-540-30551-4_67","volume-title":"Algorithms and Computation","author":"A. Pessoa","year":"2004","unstructured":"Pessoa, A., Laber, E., de Souza, C.: Efficient algorithms for the hotlink assignment problem: The worst case search. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, p. 778. Springer, Heidelberg (2004)"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/3-540-51542-9_36","volume-title":"Algorithms and Data Structures","author":"W. Pugh","year":"1989","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. In: Dehne, F., Santoro, N., Sack, J.-R. (eds.) WADS 1989. LNCS, vol.\u00a0382, pp. 437\u2013449. Springer, Heidelberg (1989)"},{"issue":"3","key":"28_CR16","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci.\u00a026(3), 362\u2013381 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary trees. In: Proc. 15th Ann. ACM Symp. on Theory of Computing, pp. 235\u2013245 (1983)","DOI":"10.1145\/800061.808752"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:16:51Z","timestamp":1619493411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11841036_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}