{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T19:50:40Z","timestamp":1682365840028},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-6","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf01759063","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T10:43:56Z","timestamp":1118918636000},"page":"597-619","source":"Crossref","is-referenced-by-count":3,"title":["Maximum queue size and hashing with lazy deletion"],"prefix":"10.1007","volume":"6","author":[{"given":"Claire M.","family":"Kenyon","sequence":"first","affiliation":[]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"BF01759063_CR1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"R. Fagin, J. Nievergelt, N. Pippenger, and H. R. Strong. Extendible Hashing\u2014A Fast Access Method for Dynamic Files,ACM Transactions on Database Systems,4(3) (September 1979), 315\u2013344.","journal-title":"ACM Transactions on Database Systems"},{"key":"BF01759063_CR2","first-page":"1","volume":"34\u201335","author":"P. Flajolet","year":"1981","unstructured":"P. Flajolet. Analyse d'algorithmes de manipulation d'arbres et de fichiers,Cahiers du Bureau Universitaire de Recherche Operationnelle,34\u201335 (1981), 1\u2013209.","journal-title":"Cahiers du Bureau Universitaire de Recherche Operationnelle"},{"issue":"2","key":"BF01759063_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, and J. Vuillemin. Sequence of Operations Analysis for Dynamic Data Structures,Journal of Algorithms,1(2) (June 1980), 111\u2013141.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"BF01759063_CR4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/322248.322254","volume":"28","author":"G. H. Gonnet","year":"1981","unstructured":"G. H. Gonnet. Expected Length of the Longest Probe Sequence in Hash Code Searching,Journal of the ACM,28(2) (April 1981), 289\u2013304.","journal-title":"Journal of the ACM"},{"key":"BF01759063_CR5","doi-asserted-by":"crossref","unstructured":"S. Karlin and J. M. McGregor. Linear Growth Birth and Death Processes,Journal of Mathematics and Mechanics, 7(4) (1958).","DOI":"10.1512\/iumj.1958.7.57037"},{"key":"BF01759063_CR6","volume-title":"Series in Probability and Mathematical Statistics","author":"F. P. Kelly","year":"1979","unstructured":"F. P. Kelly.Reversibility and Stochastic Networks, Series in Probability and Mathematical Statistics, Wiley, Chichester (1979)."},{"key":"BF01759063_CR7","doi-asserted-by":"crossref","unstructured":"C. M. Kenyon and J. S. Vitter. General Methods for the Analysis of the Maximum Size of Dynamic Data Structures,SIAM Journal on Computing,20(3) (June 1991).","DOI":"10.1137\/0220050"},{"key":"BF01759063_CR8","volume-title":"Queueing Systems","author":"L. Kleinrock","year":"1975","unstructured":"L. Kleinrock,Queueing Systems, Vol. I, Wiley, New York (1975)."},{"key":"BF01759063_CR9","volume-title":"Random Allocations","author":"V. F. Kolchin","year":"1978","unstructured":"V. F. Kolchin, B. A. Sevast'yanov, and V. P. Chistyakov.Random Allocations, Winston, Washington (1978)."},{"issue":"6","key":"BF01759063_CR10","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1137\/0216073","volume":"16","author":"J. Morrison","year":"1987","unstructured":"J. Morrison, L. A. Shepp, and C. J.Van Wyk. A Queueing Analysis of Hashing with Lazy Deletion,SIAM Journal on Computing,16(6) (December 1987), 1155\u20131164.","journal-title":"SIAM Journal on Computing"},{"key":"BF01759063_CR11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0734-189X(86)90046-0","volume":"34","author":"T. Ottmann","year":"1986","unstructured":"T. Ottmann and D. Wood. Space-Economical Plane-Sweep Algorithms,Computer Vision, Graphics, and Image Processing,34 (1986), 35\u201351.","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"BF01759063_CR12","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/023","volume-title":"Orthogonal Polynomials","author":"G. Szeg\u00f6","year":"1939","unstructured":"G. Szeg\u00f6.Orthogonal Polynomials, American Mathematical Society Colloquium Publication, Providence, RI (1939)."},{"key":"BF01759063_CR13","doi-asserted-by":"crossref","unstructured":"T. G. Szymanski and C. J. Van Wyk. Space-Efficient Algorithms for VLSI Artwork Analysis,Proceedings of the 20th IEEE Design Automation Conference (June 1983), pp. 743\u2013749.","DOI":"10.1109\/DAC.1983.1585739"},{"issue":"1","key":"BF01759063_CR14","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01840434","volume":"1","author":"C. J. Wyk Van","year":"1986","unstructured":"C. J. Van Wyk and J. S. Vitter. The Complexity of Hashing with Lazy Deletion,Algorithmica,1(1) (March 1986), 17\u201329.","journal-title":"Algorithmica"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759063.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01759063\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759063","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T19:27:03Z","timestamp":1586287623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01759063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":14,"journal-issue":{"issue":"1-6","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01759063"],"URL":"https:\/\/doi.org\/10.1007\/bf01759063","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}