{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:09Z","timestamp":1725701649173},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_28","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"313-324","source":"Crossref","is-referenced-by-count":0,"title":["Data Structures on Event Graphs"],"prefix":"10.1007","author":[{"given":"Bernard","family":"Chazelle","sequence":"first","affiliation":[]},{"given":"Wolfgang","family":"Mulzer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"28_CR1","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1214\/aoap\/1177005280","volume":"3","author":"P. Chassaing","year":"1993","unstructured":"Chassaing, P.: Optimality of move-to-front for self-organizing data structures with locality of references. Ann. Appl. Probab.\u00a03(4), 1219\u20131240 (1993)","journal-title":"Ann. Appl. Probab."},{"key":"28_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511626371","volume-title":"The discrepancy method: randomness and complexity","author":"B. Chazelle","year":"2000","unstructured":"Chazelle, B.: The discrepancy method: randomness and complexity. Cambridge University Press, New York (2000)"},{"issue":"3","key":"28_CR3","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s00454-009-9170-6","volume":"42","author":"B. Chazelle","year":"2009","unstructured":"Chazelle, B., Mulzer, W.: Markov incremental constructions. Discrete Comput. Geom.\u00a042(3), 399\u2013420 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"28_CR4","unstructured":"Crochemore, M., Iliopoulos, C.S., Kubica, M., Rahman, M.S., Walen, T.: Improved algorithms for the range next value problem and applications. In: Proc. 25th Sympos. Theoret. Aspects Comput. Sci (STACS), pp. 205\u2013216 (2008)"},{"issue":"3","key":"28_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Inform. Process. Lett.\u00a06(3), 80\u201382 (1977)","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P. Emde Boas van","year":"1976","unstructured":"van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Math. Systems Theory\u00a010(2), 99\u2013127 (1976)","journal-title":"Math. Systems Theory"},{"issue":"5","key":"28_CR7","first-page":"283","volume":"29","author":"G. Hotz","year":"1993","unstructured":"Hotz, G.: Search trees and search graphs for Markov sources. Elektronische Informationsverarbeitung und Kybernetik\u00a029(5), 283\u2013292 (1993)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"issue":"2","key":"28_CR8","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/BF01759046","volume":"6","author":"S. Kapoor","year":"1991","unstructured":"Kapoor, S., Reingold, E.M.: Stochastic rearrangement rules for self-organizing data structures. Algorithmica\u00a06(2), 278\u2013291 (1991)","journal-title":"Algorithmica"},{"issue":"3","key":"28_CR9","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1137\/S0097539794268042","volume":"30","author":"A.R. Karlin","year":"2000","unstructured":"Karlin, A.R., Phillips, S.J., Raghavan, P.: Markov paging. SIAM J. Comput.\u00a030(3), 906\u2013922 (2000)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"28_CR10","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0020-0190(81)90016-8","volume":"12","author":"L.K. Konneker","year":"1981","unstructured":"Konneker, L.K., Varol, Y.L.: A note on heuristics for dynamic organization of data structures. Inform. Process. Lett.\u00a012(5), 213\u2013216 (1981)","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"28_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.2307\/3213645","volume":"21","author":"K. Lam","year":"1984","unstructured":"Lam, K., Leung, M.Y., Siu, M.K.: Self-organizing files with dependent accesses. J. Appl. Probab.\u00a021(2), 343\u2013359 (1984)","journal-title":"J. Appl. Probab."},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov chains and mixing times. American Mathematical Society. Providence, RI (2009)","DOI":"10.1090\/mbk\/058"},{"key":"28_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"13","key":"28_CR14","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1016\/j.ipl.2009.03.003","volume":"109","author":"W. Mulzer","year":"2009","unstructured":"Mulzer, W.: A note on predecessor searching in the pointer machine model. Inform. Process. Lett.\u00a0109(13), 726\u2013729 (2009)","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"28_CR15","doi-asserted-by":"publisher","first-page":"790","DOI":"10.2307\/3215104","volume":"34","author":"R.M. Phatarfod","year":"1997","unstructured":"Phatarfod, R.M., Pryde, A.J., Dyte, D.: On the move-to-front scheme with Markov dependent requests. J. Appl. Probab.\u00a034(3), 790\u2013794 (1997)","journal-title":"J. Appl. Probab."},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/3-540-61440-0_156","volume-title":"Automata, Languages and Programming","author":"F. Schulz","year":"1996","unstructured":"Schulz, F., Sch\u00f6mer, E.: Self-organizing Data Structures with Dependent Accesses. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 526\u2013537. Springer, Heidelberg (1996)"},{"issue":"3","key":"28_CR17","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1137\/0201016","volume":"1","author":"G.S. Shedler","year":"1972","unstructured":"Shedler, G.S., Tung, C.: Locality in page reference strings. SIAM J. Comput.\u00a01(3), 218\u2013241 (1972)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"28_CR18","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1145\/234752.234753","volume":"43","author":"J.S. Vitter","year":"1996","unstructured":"Vitter, J.S., Krishnan, P.: Optimal prefetching via data compression. J. ACM\u00a043(5), 771\u2013793 (1996)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:54:51Z","timestamp":1620129291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}