{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:01Z","timestamp":1725663241794},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514985"},{"type":"electronic","value":"9783540481805"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51498-8_16","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:00:21Z","timestamp":1330203621000},"page":"162-174","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic data structures with finite population: A combinatorial analysis"],"prefix":"10.1007","author":[{"given":"J.","family":"Fran\u00e7on","sequence":"first","affiliation":[]},{"given":"B.","family":"Randrianarimanana","sequence":"additional","affiliation":[]},{"given":"R.","family":"Schott","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"16_CR1","unstructured":"L.Ch\u00e9no Profils limites d'histoires sur les dictionnaires et les files de priorit\u00e9.Application aux files binomiales.Th\u00e8se de 3\u00e8me cycle. Universit\u00e9 Paris Sud, 1981."},{"key":"16_CR2","unstructured":"L.Ch\u00e9no, P.Flajolet, J.Fran\u00e7on, C.Puech, J.Vuillemin Finite files, limiting profiles and variance analysis. Proceedings 18th Allerton Conf. on Com. Control and Computing (Illinois 1980)."},{"key":"16_CR3","unstructured":"P.Flajolet,J.Fran\u00e7on Structures de donn\u00e9es dynamiques en r\u00e9servoir born\u00e9.Actes des journ\u00e9es algorithmiques de Nice, Universit\u00e9 de Nice (1980)."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0196-6774(80)90020-6","volume":"1","author":"P. Flajolet","year":"1980","unstructured":"P. Flajolet, J. Fran\u00e7on, J. Vuillemin Sequence of operations analysis for dynamic data structures.J.of algorithms 1, 111\u2013141,1980.","journal-title":"J.of algorithms"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0255(86)90016-2","volume":"38","author":"P. Flajolet","year":"1986","unstructured":"P. Flajolet, C. Peuch, J. Vuillemin The analysis of simple lists structures. Inf. Sc. 38, 121\u2013146, 1986.","journal-title":"Inf. Sc."},{"key":"16_CR6","unstructured":"P.Flajolet Analyse d'algorithmes de manipulation d'arbres et de fichiers. B.U.R.O. cahier 34\u201335, 1981."},{"key":"16_CR7","unstructured":"J.Fran\u00e7on Combinatoire des structures de donn\u00e9es.Th\u00e8se de doc. d'Etat. Universit\u00e9 de Strasbourg, 1979"},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1051\/ita\/1978120100491","volume":"12","author":"J. Fran\u00e7on","year":"1978","unstructured":"J. Fran\u00e7on Histoires de fichiers. RAIRO Inf.Th. 12, 49\u201362, 1978.","journal-title":"RAIRO Inf.Th."},{"key":"16_CR9","unstructured":"J.Fran\u00e7on, B.Randrianarimanana, R.Schott Analysis of dynamic data structures in D.E.Knuth's model. Rapport C.R.I.N. 1986.(submitted)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"J.Fran\u00e7on, B.Randrianarimanana, R.Schott Analysis of dynamic algorithms in D.E.Knuth's model. Proceedings C.A.A.P.'88, L.N.C.S. 299 72\u201388.Springer Verlag.","DOI":"10.1007\/BFb0026097"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0022-0000(78)90020-X","volume":"16","author":"A. Jonassen","year":"1978","unstructured":"A. Jonassen, D.E. Knuth A trivial algorithm whose analysis isn't. J.of Comp.and System Sc.16, 301\u2013332, 1978.","journal-title":"J.of Comp.and System Sc."},{"key":"16_CR12","unstructured":"G.D.Knott Deletion in binary storage trees.Report Stan-CS, 75-491, may 1975."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"D.E.Knuth Deletions that preserve randomness. Trans.Software Eng, 351\u2013359, 1977.","DOI":"10.1109\/TSE.1977.231160"},{"key":"16_CR14","unstructured":"D.E.Knuth The art of computer programming: Sorting and Searching, vol.3, second printing, 1975."},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(87)90028-4","volume":"53","author":"G. Louchard","year":"1987","unstructured":"G. Louchard Random walks, Gaussian processes and list structures. Th. Comp. Sc. 53, 99\u2013124, 1987.","journal-title":"Th. Comp. Sc."},{"key":"16_CR16","unstructured":"B.Randrianarimanana Analyse des structures de donn\u00e9es dynamiques dans le mod\u00e8le de D.E.Knuth. Th\u00e8se de 3\u00e8me cycle, Universit\u00e9 Nancy 1, 1986."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51498-8_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:33Z","timestamp":1605648093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51498-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514985","9783540481805"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-51498-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}