{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T11:57:08Z","timestamp":1697543828317},"reference-count":15,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8478,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0304-3975(90)90033-e","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"147-167","source":"Crossref","is-referenced-by-count":4,"title":["Analysis of dynamic algorithms in Knuth's model"],"prefix":"10.1016","volume":"72","author":[{"given":"J.","family":"Fran\u00e7on","sequence":"first","affiliation":[]},{"given":"B.","family":"Randrianarimanana","sequence":"additional","affiliation":[]},{"given":"R.","family":"Schott","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90033-E_BIB1","series-title":"Th\u00e8se de 3\u00e8 cycle","article-title":"Profils limites d'histoires sur les dictionnaires et les files de priorit\u00e9. Application aux files binomiales","author":"Ch\u00e9no","year":"1981"},{"key":"10.1016\/0304-3975(90)90033-E_BIB2","article-title":"Finite files, limiting profiles and variance analysis","author":"Ch\u00e9no","year":"1980","journal-title":"Proc. 18th Allerton Conf. on Com. Control and Computing"},{"key":"10.1016\/0304-3975(90)90033-E_BIB3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0196-6774(80)90020-6","article-title":"Sequence of operations analysis for dynamic data structures","volume":"1","author":"Flajolet","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(90)90033-E_BIB4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0255(86)90016-2","article-title":"The analysis of simple lists structures","volume":"38","author":"Flajolet","year":"1986","journal-title":"Inform. Sci."},{"key":"10.1016\/0304-3975(90)90033-E_BIB5","first-page":"34","article-title":"Analyse d'algorithmes de manipulation d'arbres et de fichiers","author":"Flajolet","year":"1981","journal-title":"B.U.R.O. Cahier"},{"key":"10.1016\/0304-3975(90)90033-E_BIB6","series-title":"Th\u00e8se de doc. d'Etat","article-title":"Combinatoire des structures de donn\u00e9es","author":"Fran\u00e7on","year":"1979"},{"key":"10.1016\/0304-3975(90)90033-E_BIB7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1051\/ita\/1978120100491","article-title":"Histoires de fichiers","volume":"12","author":"Fran\u00e7on","year":"1978","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(90)90033-E_BIB8","article-title":"Analysis of dynamic data structures in D.E. Knuth's model","author":"Fran\u00e7on","year":"1986","journal-title":"Rapport C.R.I.N."},{"key":"10.1016\/0304-3975(90)90033-E_BIB9","series-title":"Proc. CAAP'88","first-page":"72","article-title":"Analysis of dynamic algorithms in D.E. Knuth's model","volume":"299","author":"Fran\u00e7on","year":"1988"},{"key":"10.1016\/0304-3975(90)90033-E_BIB10","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0022-0000(78)90020-X","article-title":"A trivial algorithm whose analysis isn't","volume":"16","author":"Jonassen","year":"1978","journal-title":"J. Comput System Sci."},{"key":"10.1016\/0304-3975(90)90033-E_BIB11","first-page":"75","article-title":"Deletion in binary storage trees","author":"Knott","year":"1975","journal-title":"Report Stan-CS"},{"key":"10.1016\/0304-3975(90)90033-E_BIB12","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1109\/TSE.1977.231160","article-title":"Deletions that preserve randomness","author":"Knuth","year":"1977","journal-title":"Trans. Software Eng."},{"key":"10.1016\/0304-3975(90)90033-E_BIB13","volume":"Vol. 3","author":"Knuth","year":"1975"},{"key":"10.1016\/0304-3975(90)90033-E_BIB14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(87)90028-4","article-title":"Random walks, Gaussian processes and list structures","volume":"53","author":"Louchard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90033-E_BIB15","series-title":"Th\u00e8se de 3\u00e8me cycle","article-title":"Analyse des structures de donn\u00e9es dynamiques dans le mod\u00e8le de D.E. Knuth","author":"Randrianarimanana","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090033E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090033E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:51:27Z","timestamp":1555113087000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090033E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":15,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["030439759090033E"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90033-e","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}