{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:33Z","timestamp":1725456033518},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019021X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0026097","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:47:21Z","timestamp":1132645641000},"page":"72-88","source":"Crossref","is-referenced-by-count":2,"title":["Analysis of dynamic algorithms in D.E.Knuth's model"],"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","reference":[{"key":"6_CR1","unstructured":"L.Cheno Profils limites d'histoires sur les dictionnaires et les files de priorit\u00e9. Application aux files binomiales. Th\u00e8se de 3\u00e8 cycle, Universit\u00e9 d'Orsay, 1981."},{"key":"6_CR2","unstructured":"L.Cheno, 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":"6_CR3","doi-asserted-by":"crossref","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":"6_CR4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0255(86)90016-2","volume":"38","author":"P. Flajolet","year":"1986","unstructured":"P. Flajolet, C. Puech, J. Vuillemin The analysis of simple lists structures. Inf. Sc. 38, 121\u2013146, 1986.","journal-title":"Inf. Sc."},{"key":"6_CR5","unstructured":"P.Flajolet Analyse d'algorithmes de manipulation d'arbres et de fichiers. B.U.R.O. cahier 34\u201335, 1981."},{"key":"6_CR6","unstructured":"J.Fran\u00e7on Combinatoire des structures de donn\u00e9es. Th\u00e8se de doc. d'Etat. Universit\u00e9 de Strasbourg, 1979"},{"key":"6_CR7","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":"6_CR8","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":"6_CR9","doi-asserted-by":"crossref","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":"6_CR10","unstructured":"G.D.Knott Deletion in binary storage trees. Report Stan-CS, 75\u2013491, may 1975."},{"key":"6_CR11","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":"6_CR12","unstructured":"D.E.Knuth The art of computer programming: Sorting and Searching, vol.3, second printing, 1975."},{"key":"6_CR13","doi-asserted-by":"crossref","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":"6_CR14","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","CAAP '88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026097.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:55:51Z","timestamp":1607550951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019021X"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0026097","relation":{},"subject":[]}}