{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:06Z","timestamp":1725663726594},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540557197"},{"type":"electronic","value":"9783540472780"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55719-9_75","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:34:22Z","timestamp":1330234462000},"page":"211-222","source":"Crossref","is-referenced-by-count":5,"title":["How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems"],"prefix":"10.1007","author":[{"given":"Peter","family":"Kirschenhofer","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Prodinger","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"17_CR1","volume-title":"Algorithmics. Theory and Practice","author":"G. Brassard","year":"1988","unstructured":"G. Brassard and P. Bratley, Algorithmics. Theory and Practice, Prentice Hall, Engle-wood Cliffs, 1988."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P. Flajolet","year":"1985","unstructured":"P. Flajolet and G.N. Martin, Probabilistic Counting Algorithms for Data Base Applications, J. Comp. Syst. Sci., 31, 182\u2013209, 1985.","journal-title":"J. Comp. Syst. Sci."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0403019","volume":"3","author":"P. Flajolet","year":"1990","unstructured":"P. Flajolet and A. Odlyzko, Singularity Analysis of Generating Functions, SIAM J. Disc. Methods, 3, 216\u2013240, 1990.","journal-title":"SIAM J. Disc. Methods"},{"issue":"3","key":"17_CR4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/rsa.3240030309","volume":"3","author":"Philippe Flajolet","year":"1992","unstructured":"P. Flajolet and B. Richmond, Generalized Digital Trees and Their Difference-Differential Equations, Random Structures and Algorithms, 3, 1992, in press.","journal-title":"Random Structures and Algorithms"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/978-3-642-82456-2_16","volume":"F12","author":"P. Flajolet","year":"1985","unstructured":"P. Flajolet, M. R\u00e9gnier and R. Sedgewick, Some Uses of the Mellin Transform Techniques in the Analysis of Algorithms, in Combinatorial Algorithms on Words, Springer NATO ASI Ser. F12, 241\u2013254, 1985.","journal-title":"Combinatorial Algorithms on Words, Springer NATO ASI Ser."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/23005.23006","volume":"34","author":"A. Greenberg","year":"1987","unstructured":"A. Greenberg, P. Flajolet and R. Ladner, Estimating the Multiplicities of Conflicts to Speed Their Resolution in Multiple Access Channels, JACM, 34, 289\u2013325, 1987.","journal-title":"JACM"},{"key":"17_CR7","unstructured":"P. Henrici, Applied and Computational Complex Analysis, vol. 2, John Wiley & Sons 1977."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1137\/0218054","volume":"18","author":"P. Jacquet","year":"1989","unstructured":"P. Jacquet and W. Szpankowski, Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equations, SIAM J. Computing, 18, 777\u2013791, 1989.","journal-title":"SIAM J. Computing"},{"key":"17_CR9","volume-title":"The Advanced Theory of Statistics","author":"M. Kendall","year":"1977","unstructured":"M. Kendall and A. Stuart, The Advanced Theory of Statistics, 4th Ed. vol. 1, Charles and Griffin and Co. Ltd., London (1977).","edition":"4th Ed."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"P. Kirschenhofer and H. Prodinger, On the Analysis of Probabilistic Counting, Lecture Notes in Mathematics, 1452 (Eds. E. Hlawka and R. Tichy), 117\u2013120, Springer Verlag 1990.","DOI":"10.1007\/BFb0096984"},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1051\/ita\/1991250100431","volume":"25","author":"P. Kirschenhofer","year":"1991","unstructured":"P. Kirschenhofer and H. Prodinger, Approximate Counting: An Alternative Approach, Informatique Th\u00e9orique et Applications\/Theoretical Informatics and Applications, 25, 43\u201348, 1991.","journal-title":"Informatique Th\u00e9orique et Applications\/Theoretical Informatics and Applications"},{"key":"17_CR12","volume-title":"The Art of Computer Programming. Sorting and Searching, vol. 3","author":"D.E. Knuth","year":"1973","unstructured":"D.E. Knuth, The Art of Computer Programming. Sorting and Searching, vol. 3., Addison-Wesley, Reading, MA 1973."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1145\/359619.359627","volume":"21","author":"R. Morris","year":"1978","unstructured":"R. Morris, Counting Large Numbers of Events in Small Registers, Comm. ACM, 21, 840\u2013842, 1978.","journal-title":"Comm. ACM"},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/0097-3165(90)90072-5","volume":"55","author":"B. Pittel","year":"1990","unstructured":"B. Pittel and H. Rubin, How Many Random Questions Are Necessary to Identify n Distinct Objects?, J. Combinatorial Theory, Ser. A, 55, 292\u2013312, 1990.","journal-title":"J. Combinatorial Theory, Ser. A"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"H. Prodinger, How to Select a Loser, Discrete Mathematics, to appear.","DOI":"10.1016\/0012-365X(93)90572-B"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"B. Rais, P. Jacquet, and W. Szpankowski, Limiting Distribution for the Depth in Patricia Tries, SIAM Journal on Discrete Mathematics, to appear.","DOI":"10.1137\/0406016"},{"key":"17_CR17","unstructured":"U. Schmid, The Average CRI-length of a Tree Collision Resolution Algorithm in Presence of Multiplicity-Dependent Capture Effects, this Volume."},{"key":"17_CR18","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1137\/0608021","volume":"8","author":"W. Szpankowski","year":"1987","unstructured":"W. Szpankowski, Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms, SIAM J. Alg. Disc. Methods, 8, 233\u2013250, 1987.","journal-title":"SIAM J. Alg. Disc. Methods"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/96559.214080","volume":"37","author":"W. Szpankowski","year":"1990","unstructured":"W. Szpankowski, Patricia Tries Again Revisited, JACM, 37, 691\u2013711, 1990.","journal-title":"JACM"},{"key":"17_CR20","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF02241658","volume":"43","author":"W. Szpankowski","year":"1990","unstructured":"W. Szpankowski and V. Rego, Yet Another Application of a Binomial Recurrence. Order Statistics, Computing, 43, 401\u2013410, 1990.","journal-title":"Computing"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55719-9_75.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:01:41Z","timestamp":1605628901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55719-9_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540557197","9783540472780"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-55719-9_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}