{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T07:55:38Z","timestamp":1772438138651,"version":"3.50.1"},"reference-count":35,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1980,6,1]],"date-time":"1980-06-01T00:00:00Z","timestamp":328665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1980,6]]},"DOI":"10.1016\/0196-6774(80)90020-6","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"111-141","source":"Crossref","is-referenced-by-count":51,"title":["Sequence of operations analysis for dynamic data structures"],"prefix":"10.1016","volume":"1","author":[{"given":"P","family":"Flajolet","sequence":"first","affiliation":[]},{"given":"J","family":"Fran\u00e7on","sequence":"additional","affiliation":[]},{"given":"J","family":"Vuillemin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(80)90020-6_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"issue":"No. 3","key":"10.1016\/0196-6774(80)90020-6_BIB2","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0207026","article-title":"Implementation and analysis of binomial queue algorithms","volume":"7","author":"Brown","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(80)90020-6_BIB3","series-title":"Proceedings, Tenth Annual ACM Symposium on the Theory of Computing","first-page":"19","article-title":"A representation for linear lists with movable fingers","author":"Brown","year":"1978"},{"key":"10.1016\/0196-6774(80)90020-6_BIB4","series-title":"M\u00e9moire de DEA","article-title":"Formes asymptotiques des co\u00fbts de files de priorit\u00e9","author":"Ch\u00e9no","year":"1979"},{"key":"10.1016\/0196-6774(80)90020-6_BIB5","series-title":"An Introduction to Orthogonal Polynomials","author":"Chihara","year":"1978"},{"key":"10.1016\/0196-6774(80)90020-6_BIB6","first-page":"146","article-title":"Linear expected time of a simple union-find algorithm","volume":"5","author":"Doyle","year":"1976"},{"key":"10.1016\/0196-6774(80)90020-6_BIB7","article-title":"Analyse d'algorithmes de manipulation de fichiers","author":"Flajolet","year":"1978","journal-title":"Iria-Laboria Report No. 321"},{"key":"10.1016\/0196-6774(80)90020-6_BIB8","article-title":"Analyse d'algorithmes de manipulation d'arbres et de fichiers","author":"Flajolet","year":"1979"},{"key":"10.1016\/0196-6774(80)90020-6_BIB9","unstructured":"P. Flajolet and J. Fran\u00e7on, Sequence of operations analysis of data structures under restricted sets of keys, in preparation."},{"key":"10.1016\/0196-6774(80)90020-6_BIB10","unstructured":"P. Flajolet, J. Fran\u00e7on, G. Viennot, and J. Vuillemin, Algorithmique et combinatoire des arbres et des permutations, to appear."},{"key":"10.1016\/0196-6774(80)90020-6_BIB11","series-title":"Proceedings, 11th ACM Symposium of Theory of Computing","article-title":"Computing the integrated cost of dictionaries","author":"Flajolet","year":"1979"},{"key":"10.1016\/0196-6774(80)90020-6_BIB12","first-page":"35","article-title":"Arbres binaires de recherche, propri\u00e9t\u00e9s combinatoires et applications","volume":"10","author":"Fran\u00e7on","year":"1976","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/0196-6774(80)90020-6_BIB13","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. Theor."},{"key":"10.1016\/0196-6774(80)90020-6_BIB14","article-title":"Combinatoire des structures de donn\u00e9es","author":"Fran\u00e7on","year":"1979"},{"key":"10.1016\/0196-6774(80)90020-6_BIB15","unstructured":"J. Fran\u00e7on and G. Viennot, Permutations selon les pics, creux, doubles, mont\u00e9es, doubles descentes, nombre d'Euler et nombres de Genocchi, Discrete Math., in press."},{"key":"10.1016\/0196-6774(80)90020-6_BIB16","unstructured":"J. Fran\u00e7on, G. Viennot, and J. Vuillemin, \u201cDescription et analyse d'une repr\u00e9sentation performante des files de priorit\u00e9,\u201d Rapport No. 12 du Laboratoire d'Informatique, 91405 Orsay; Acta Inform., in press."},{"key":"10.1016\/0196-6774(80)90020-6_BIB17","series-title":"Proceedings, 9th Annual ACM Symposium on the Theory of Computing","first-page":"49","article-title":"A new representation for linear lists","author":"Guibas","year":"1977"},{"key":"10.1016\/0196-6774(80)90020-6_BIB18","series-title":"Proceedings, 19th annual IEE Symp. on the Foundations of Computer Science","first-page":"8","article-title":"A dichromatic framework for balanced trees","author":"Guibas","year":"1978"},{"key":"10.1016\/0196-6774(80)90020-6_BIB19","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/321105.321108","article-title":"Some combinatorial properties of certain trees with applications to searching and sorting","volume":"9","author":"Hibbard","year":"1962","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(80)90020-6_BIB20","series-title":"Analysis of an Algorithm for Priority Queue Administration","author":"Jonassen","year":"1975"},{"key":"10.1016\/0196-6774(80)90020-6_BIB21","article-title":"A Trivial Algorithm Whose Analysis Isn't","author":"Jonassen","year":"1977","journal-title":"Stanford University, Report STAN-CS-77-598"},{"key":"10.1016\/0196-6774(80)90020-6_BIB22","article-title":"Deletion in Binary Storage Trees","author":"Knott","year":"1975"},{"key":"10.1016\/0196-6774(80)90020-6_BIB23","author":"Knuth","year":"1968"},{"key":"10.1016\/0196-6774(80)90020-6_BIB24","author":"Knuth","year":"1973"},{"key":"10.1016\/0196-6774(80)90020-6_BIB25","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":"IEEE Trans. Software Engrg"},{"key":"10.1016\/0196-6774(80)90020-6_BIB26","article-title":"The Expected Linearity of a Simple Equivalence Algorithm","author":"Knuth","year":"1977","journal-title":"Stanford University, Report STAN-CS-77-599"},{"key":"10.1016\/0196-6774(80)90020-6_BIB27","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1112\/jlms\/s1-9.1.6","article-title":"Orthogonale Polynomsysteme mit einem besonderen Gestalt der erzeugenden Funktion","volume":"9","author":"Meixner","year":"1934","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0196-6774(80)90020-6_BIB28","series-title":"Die Lehre von den Kettenbr\u00fcchen","author":"Perron","year":"1954"},{"key":"10.1016\/0196-6774(80)90020-6_BIB29","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithm","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 4","key":"10.1016\/0196-6774(80)90020-6_BIB30","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/359460.359478","article-title":"A data structure for manipulating priority queues","volume":"21","author":"Vuillemin","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(80)90020-6_BIB31","series-title":"Proceedings, ISCAJ Symposium","article-title":"A representation for linear lists with good average time performance","author":"Vuillemin","year":"1979"},{"key":"10.1016\/0196-6774(80)90020-6_BIB32","series-title":"Analytic Theory of Continued Fractions","author":"Wall","year":"1967"},{"key":"10.1016\/0196-6774(80)90020-6_BIB33","first-page":"192","article-title":"On the average behavior of set merging algorithms (extended abstract)","volume":"8","author":"Yao","year":"1976"},{"key":"10.1016\/0196-6774(80)90020-6_BIB34","article-title":"Linear Lists and Priority Queues as Balanced Binary Trees","author":"Crane","year":"1972"},{"key":"10.1016\/0196-6774(80)90020-6_BIB35","first-page":"142","article-title":"On uniquely represented data structures","volume":"18","author":"Snyder","year":"1977"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677480900206?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677480900206?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:55:13Z","timestamp":1548744913000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677480900206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,6]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1980,6]]}},"alternative-id":["0196677480900206"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(80)90020-6","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1980,6]]}}}