{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T22:26:43Z","timestamp":1747261603641},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,4,26]],"date-time":"2008-04-26T00:00:00Z","timestamp":1209168000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s00236-008-0069-0","type":"journal-article","created":{"date-parts":[[2008,4,25]],"date-time":"2008-04-25T10:44:28Z","timestamp":1209120268000},"page":"237-277","source":"Crossref","is-referenced-by-count":5,"title":["Weighted height of random trees"],"prefix":"10.1007","volume":"45","author":[{"given":"N.","family":"Broutin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Devroye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"McLeish","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,4,26]]},"reference":[{"key":"69_CR1","doi-asserted-by":"crossref","unstructured":"Archibald, M., Cl\u00e9ment, J.: Average depth in binary search tree with repeated keys. In: Fourth Colloquium on Mathematics and Computer Science, volume AG of DMTCS Proceedings, pp. 309\u2013320. Discrete Mathematics and Theoretical Computer Science (2006)","DOI":"10.46298\/dmtcs.3496"},{"key":"69_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-65371-1","volume-title":"Branching Processes","author":"K.B. Athreya","year":"1972","unstructured":"Athreya, K.B., Ney, P.E.: Branching Processes. Springer, Berlin (1972)"},{"key":"69_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random network. Science 286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"69_CR4","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18, 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"69_CR5","unstructured":"Bentley, J.L., Sedgewick, R.: Fast algorithm for sorting and searching strings. In: Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 360\u2013369. SIAM, 1997"},{"key":"69_CR6","doi-asserted-by":"crossref","unstructured":"Bergeron, F., Flajolet, P., Salvy, B.: Varieties of increasing trees. In: CAAP, volume 581 of Lecture Notes in Computer Science, pp. 24\u201348. Springer, Berlin (1992)","DOI":"10.1007\/3-540-55251-0_2"},{"key":"69_CR7","volume-title":"Recent Advances in Statistics: Papers in Honor of Herman Chernoff","author":"P.K. Bhattacharya","year":"1983","unstructured":"Bhattacharya, P.K., Gastwirth, J.L.: A nonhomogeneous markov model of a chain-letter scheme. In: Rizvi, M.H., Rustagi, J.S., Siegmund, D.(eds) Recent Advances in Statistics: Papers in Honor of Herman Chernoff, Academic Press, New York (1983)"},{"key":"69_CR8","doi-asserted-by":"crossref","first-page":"62","DOI":"10.2307\/1426719","volume":"10","author":"J.D. Biggins","year":"1978","unstructured":"Biggins, J.D.: The asymptotic shape of the branching random walk. Adv. Appl. Probab. 10, 62\u201384 (1978)","journal-title":"Adv. Appl. Probab."},{"key":"69_CR9","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1214\/aoap\/1177004604","volume":"5","author":"J.D. Biggins","year":"1995","unstructured":"Biggins, J.D.: The growth and spread of the general branching random walk. Ann. Appl. Probab. 5, 1008\u20131024 (1995)","journal-title":"Ann. Appl. Probab."},{"key":"69_CR10","volume-title":"Classical and Modern Branching Processes","author":"J.D. Biggins","year":"1996","unstructured":"Biggins, J.D.: How fast does a general branching random walk spread. In: Athreya, K.B., Jagers, P.(eds) Classical and Modern Branching Processes, Springer, New York (1996)"},{"key":"69_CR11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0167-7152(96)00092-2","volume":"32","author":"J.D. Biggins","year":"1997","unstructured":"Biggins, J.D., Grey, D.R.: A note on the growth of random trees. Statist. Probab. Lett. 32, 339\u2013342 (1997)","journal-title":"Statist. Probab. Lett."},{"key":"69_CR12","volume-title":"Probability and Measure","author":"P. Billingsley","year":"1995","unstructured":"Billingsley, P.: Probability and Measure, 3rd edn. Wiley, New York (1995)","edition":"3"},{"key":"69_CR13","volume-title":"Shedding New Light on Random Trees","author":"N. Broutin","year":"2007","unstructured":"Broutin, N.: Shedding New Light on Random Trees. Ph.D. thesis, McGill University, Montreal (2007)"},{"key":"69_CR14","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s00453-006-0112-x","volume":"46","author":"N. Broutin","year":"2006","unstructured":"Broutin, N., Devroye, L.: Large deviations for the weighted height of an extended class of trees. Algorithmica 46, 271\u2013297 (2006)","journal-title":"Algorithmica"},{"key":"69_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/S0963548307008796","volume":"17","author":"N. Broutin","year":"2008","unstructured":"Broutin, N., Devroye, L.: An analysis of the height of tries with random weights on the edges. Combinatorics, Probability and Computing 17, 161\u2013202 (2008)","journal-title":"Combinatorics, Probability and Computing"},{"key":"69_CR16","doi-asserted-by":"crossref","unstructured":"Broutin, N., Devroye, L.: The height of list tries and TST. In: International Conference on Analysis of Algorithms, DMTCS Proceedings. Discrete Mathematics and Theoretical Computer Science, vol. AH, pp. 271\u2013282 (2007)","DOI":"10.46298\/dmtcs.3536"},{"key":"69_CR17","doi-asserted-by":"crossref","unstructured":"Broutin, N., Devroye, L., McLeish, E., de la Salle, M.: The height of increasing trees. Random Structures and Algorithms (2007, in press) (25 pages)","DOI":"10.1002\/rsa.20202"},{"key":"69_CR18","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/moor.9.1.43","volume":"9","author":"G.G. Brown","year":"1984","unstructured":"Brown, G.G., Shubert, B.O.: On random binary trees. Math. Oper. Res. 9, 43\u201365 (1984)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"69_CR19","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/363958.363987","volume":"7","author":"H.A. Clampett","year":"1964","unstructured":"Clampett, H.A.: Randomized binary searching with tree structures. Commun. ACM 7(3), 163\u2013165 (1964)","journal-title":"Commun. ACM"},{"key":"69_CR20","unstructured":"Cl\u00e9ment, J., Flajolet, P., Vall\u00e9e, B.: The analysis of hybrid trie structures. In: 9th annual ACM-SIAM Symposium on Discrete Algorithms, pp. 531\u2013539. SIAM Press, Philadelphia, PA (1998)"},{"key":"69_CR21","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02679623","volume":"29","author":"J. Cl\u00e9ment","year":"2001","unstructured":"Cl\u00e9ment, J., Flajolet, P., Vall\u00e9e, B.: Dynamical source in information theory: a general analysis of trie structures. Algorithmica 29, 307\u2013369 (2001)","journal-title":"Algorithmica"},{"key":"69_CR22","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/362686.362693","volume":"13","author":"E.G. Coffman","year":"1970","unstructured":"Coffman, E.G., Eve, J.: File structures using hashing functions. Commun. ACM 13, 427\u2013436 (1970)","journal-title":"Commun. ACM"},{"key":"69_CR23","doi-asserted-by":"crossref","unstructured":"de la Briandais, R.: File searching using variable length keys. In: Proceedings of the Western Joint Computer Conference, Montvale, NJ, USA. AFIPS Press (1959)","DOI":"10.1145\/1457838.1457895"},{"key":"69_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5320-4","volume-title":"Large Deviation Techniques and Applications","author":"A. Dembo","year":"1998","unstructured":"Dembo, A., Zeitouni, O.: Large Deviation Techniques and Applications, 2nd edn. Springer, Berlin (1998)","edition":"2"},{"key":"69_CR25","volume-title":"Large Deviations","author":"F. den Hollander","year":"2000","unstructured":"den Hollander, F.: Large Deviations. American Mathematical Society, Providence, RI (2000)"},{"key":"69_CR26","volume-title":"Large Deviations","author":"J.-D. Deuschel","year":"1989","unstructured":"Deuschel, J.-D., Stroock, D.W.: Large Deviations. American Mathematical Society, Providence, RI (1989)"},{"key":"69_CR27","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1145\/5925.5930","volume":"33","author":"L. Devroye","year":"1986","unstructured":"Devroye, L.: A note on the height of binary search trees. J. ACM 33, 489\u2013498 (1986)","journal-title":"J. ACM"},{"key":"69_CR28","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF00265991","volume":"24","author":"L. Devroye","year":"1987","unstructured":"Devroye, L.: Branching processes in the analysis of the heights of trees. Acta Inform. 24, 277\u2013298 (1987)","journal-title":"Acta Inform."},{"key":"69_CR29","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF01210596","volume":"30","author":"L. Devroye","year":"1993","unstructured":"Devroye, L.: On the expected height of fringe balanced trees. Acta Inform. 30, 459\u2013466 (1993)","journal-title":"Acta Inform."},{"issue":"2","key":"69_CR30","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/S0097539795283954","volume":"28","author":"L. Devroye","year":"1998","unstructured":"Devroye, L.: Universal limit laws for depth in random trees. SIAM J. Comput. 28(2), 409\u2013432 (1998)","journal-title":"SIAM J. Comput."},{"key":"69_CR31","doi-asserted-by":"crossref","first-page":"1678","DOI":"10.1137\/S0097539799358926","volume":"30","author":"L. Devroye","year":"2001","unstructured":"Devroye, L., Jabbour, J., Zamora-Cura, C.: Squarish k-d trees. SIAM J. Comput. 30, 1678\u20131700 (2001)","journal-title":"SIAM J. Comput."},{"key":"69_CR32","volume-title":"Design and Analysis of Multidimensional Data Structures","author":"A. Duch","year":"2004","unstructured":"Duch, A.: Design and Analysis of Multidimensional Data Structures. Ph.D. thesis, UPC, Barcelona (2004)"},{"key":"69_CR33","first-page":"199","volume-title":"Proc. of the 9th International Symposium on Algorithms and Computation (ISAAC\u201998), vol. 1533 of Lecture Notes in Computer Science","author":"A. Duch","year":"1998","unstructured":"Duch, A., Estivill-Castro, V., Mart\u00ednez, C.: Randomized k-dimensional binary search trees. In: Chwa, K.-Y., Ibarra, O.H.(eds) Proc. of the 9th International Symposium on Algorithms and Computation (ISAAC\u201998), vol. 1533 of Lecture Notes in Computer Science, pp. 199\u2013208. Springer, Berlin (1998)"},{"issue":"1","key":"69_CR34","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0196-6774(02)00213-4","volume":"44","author":"A. Duch","year":"2002","unstructured":"Duch, A., Mart\u00ednez, C.: On the average performance of orthogonal range search in multidimensional data structures. J. Algorithms 44(1), 226\u2013245 (2002)","journal-title":"J. Algorithms"},{"key":"69_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aop\/1176993370","volume":"12","author":"R.S. Ellis","year":"1984","unstructured":"Ellis, R.S.: Large deviations for a general class of random vectors. Ann. Probab. 12, 1\u201312 (1984)","journal-title":"Ann. Probab."},{"key":"69_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R.A. Finkel","year":"1974","unstructured":"Finkel, R.A., Bentley, J.L.: Quad trees, a data structure for retrieval on composite keys. Acta Inform. 4, 1\u201319 (1974)","journal-title":"Acta Inform."},{"key":"69_CR37","first-page":"1","volume-title":"STACS 2006, Annual Symposium on Theoretical Aspects of Computer Science, vol 3884 of Lecture Notes in Computer Science","author":"P. Flajolet","year":"2006","unstructured":"Flajolet, P.: The ubiquitous digital tree. In: Durand, B., Thomas, W.(eds) STACS 2006, Annual Symposium on Theoretical Aspects of Computer Science, vol 3884 of Lecture Notes in Computer Science, pp. 1\u201322. Springer, Berlin (2006)"},{"issue":"2","key":"69_CR38","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/5383.5453","volume":"33","author":"P. Flajolet","year":"1986","unstructured":"Flajolet, P., Puech, C.: Partial match retrieval of multidimensional data. J. ACM 33(2), 371\u2013407 (1986)","journal-title":"J. ACM"},{"issue":"9","key":"69_CR39","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E. Fredkin","year":"1960","unstructured":"Fredkin, E.: Trie memory. Commun. ACM 3(9), 490\u2013499 (1960)","journal-title":"Commun. ACM"},{"key":"69_CR40","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1137\/1122003","volume":"22","author":"J. G\u00e4rtner","year":"1977","unstructured":"G\u00e4rtner, J.: On large deviations from the invariant measure. Theory Probabab. Appl. 22, 24\u201339 (1977)","journal-title":"Theory Probabab. Appl."},{"issue":"3","key":"69_CR41","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/opre.32.3.527","volume":"32","author":"J.L. Gastwirth","year":"1984","unstructured":"Gastwirth, J.L., Bhattacharya, P.K.: Two probability models of pyramid or chain letter schemes demonstrating that their promotional claims are unreliable. Oper. Res. 32(3), 527\u2013536 (1984)","journal-title":"Oper. Res."},{"key":"69_CR42","volume-title":"Handbook of Algorithms and Data Structures","author":"G.H. Gonnet","year":"1991","unstructured":"Gonnet, G.H., Baeza-Yates, R.: Handbook of Algorithms and Data Structures, 2nd edn. Addison-Wesley, Workingham (1991)","edition":"2"},{"key":"69_CR43","volume-title":"Concrete Mathematics","author":"R.L. Graham","year":"1994","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley, Reading, MA (1994)","edition":"2"},{"key":"69_CR44","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1214\/aop\/1176994984","volume":"7","author":"P. Groeneboom","year":"1979","unstructured":"Groeneboom, P., Oosterhoff, J., Ruymgaart, F.H.: Large deviation theorems for empirical probability measures. Ann. Probab. 7, 553\u2013586 (1979)","journal-title":"Ann. Probab."},{"key":"69_CR45","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"C.A.R. Hoare","year":"1962","unstructured":"Hoare, C.A.R.: Quicksort. Comput. J. 5, 10\u201315 (1962)","journal-title":"Comput. J."},{"key":"69_CR46","doi-asserted-by":"crossref","unstructured":"Huffman, D.A.: A method for constructing minimum redundancy codes. In: Proceedings of the Institude of Radio Engineers, pp. 1098\u20131102 (1952)","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"69_CR47","volume-title":"The Art of Computer Programming: Sorting and Searching, vol. 3","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, vol. 3. Addison-Wesley, Reading, MA (1973)"},{"key":"69_CR48","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0012-365X(73)90114-3","volume":"4","author":"A.G. Konheim","year":"1973","unstructured":"Konheim, A.G., Newman, D.J.: A note on growing binary trees. Discrete Math. 4, 57\u201363 (1973)","journal-title":"Discrete Math."},{"key":"69_CR49","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1093\/comjnl\/7.4.299","volume":"7","author":"W.C. Lynch","year":"1965","unstructured":"Lynch, W.C.: More combinatorial properties of certain trees. Comput. J. 7, 299\u2013302 (1965)","journal-title":"Comput. J."},{"key":"69_CR50","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1214\/aoap\/1177004977","volume":"4","author":"H.M. Mahmoud","year":"1994","unstructured":"Mahmoud, H.M.: A strong law for the height of random binary pyramids. Ann. Appl. Probab. 4, 923\u2013932 (1994)","journal-title":"Ann. Appl. Probab."},{"issue":"1\u20132","key":"69_CR51","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF02679618","volume":"29","author":"C. Mart\u00ednez","year":"2001","unstructured":"Mart\u00ednez, C., Panholzer, A., Prodinger, H.: Partial match in relaxed multidimensional search trees. Algorithmica 29(1\u20132), 181\u2013204 (2001)","journal-title":"Algorithmica"},{"key":"69_CR52","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1137\/S0097539700382108","volume":"31","author":"C. Mart\u00ednez","year":"2001","unstructured":"Mart\u00ednez, C., Roura, S.: Optimal sampling strategies in quicksort and quickselect. SIAM J. Comput. 31, 683\u2013705 (2001)","journal-title":"SIAM J. Comput."},{"key":"69_CR53","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D.R. Morrison","year":"1968","unstructured":"Morrison, D.R.: Patricia\u2014Practical Algorithm To Retrieve Information Coded in Alphanumeric. J. ACM 15, 514\u2013534 (1968)","journal-title":"J. ACM"},{"key":"69_CR54","doi-asserted-by":"crossref","first-page":"31","DOI":"10.46298\/dmtcs.369","volume":"8","author":"R. Neininger","year":"2006","unstructured":"Neininger, R., R\u00fcschendorf, L.: A survey of multivariate aspects of the contraction method. Discrete Math. Theor. Comput. Sci. 8, 31\u201356 (2006)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"69_CR55","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF00534830","volume":"57","author":"O. Nerman","year":"1981","unstructured":"Nerman, O.: On the convergence of a supercritical general (C-M-J) branching process. Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie verwandte Gebiete 57, 365\u2013395 (1981)","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie verwandte Gebiete"},{"key":"69_CR56","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/rsa.3240050207","volume":"5","author":"B. Pittel","year":"1994","unstructured":"Pittel, B.: Note on the height of random recursive trees and m-ary search trees. Random Struct. Algorithms 5, 337\u2013347 (1994)","journal-title":"Random Struct. Algorithms"},{"key":"69_CR57","doi-asserted-by":"crossref","first-page":"770","DOI":"10.2307\/1428133","volume":"27","author":"S.T. Rachev","year":"1995","unstructured":"Rachev, S.T., R\u00fcschendorf, L.: Probability metrics and recursive algorithms. Adv. Appl. Probab. 27, 770\u2013799 (1995)","journal-title":"Adv. Appl. Probab."},{"key":"69_CR58","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R. Rockafellar","year":"1970","unstructured":"Rockafellar, R.: Convex Analysis. Princeton University Press, Princeton, NJ (1970)"},{"key":"69_CR59","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0304-4149(92)90035-O","volume":"37","author":"U. R\u00f6sler","year":"1992","unstructured":"R\u00f6sler, U.: A fixed point theorem for distributions. Stochastic Process. Appl. 37, 195\u2013214 (1992)","journal-title":"Stochastic Process. Appl."},{"key":"69_CR60","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02679611","volume":"29","author":"U. R\u00f6sler","year":"2001","unstructured":"R\u00f6sler, U., R\u00fcschendorf, L.: The contraction method for recursive algorithms. Algorithmica 29, 3\u201333 (2001)","journal-title":"Algorithmica"},{"key":"69_CR61","volume-title":"Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS","author":"H. Samet","year":"1990","unstructured":"Samet, H.: Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA (1990)"},{"key":"69_CR62","volume-title":"The Design and Analysis of Spatial Data Structures","author":"H. Samet","year":"1990","unstructured":"Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA (1990)"},{"key":"69_CR63","volume-title":"An Introduction to the Analysis of Algorithm","author":"R. Sedgewick","year":"1996","unstructured":"Sedgewick, R., Flajolet, P.: An Introduction to the Analysis of Algorithm. Addison-Wesley, Reading, MA (1996)"},{"key":"69_CR64","first-page":"1","volume":"51","author":"R.T. Smythe","year":"1995","unstructured":"Smythe, R.T., Mahmoud, H.M.: A survey of recursive trees. Theor. Probab. Math. Statist. 51, 1\u201327 (1995)","journal-title":"Theor. Probab. Math. Statist."},{"key":"69_CR65","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032770","volume-title":"Average Case Analysis of Algorithms on Sequences","author":"W. Szpankowski","year":"2001","unstructured":"Szpankowski, W.: Average Case Analysis of Algorithms on Sequences. Wiley, New York (2001)"},{"key":"69_CR66","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/362736.362753","volume":"13","author":"M. Emden Van","year":"1970","unstructured":"Van Emden, M.: Increasing the efficiency of quicksort. Commun. ACM 13, 563\u2013567 (1970)","journal-title":"Commun. ACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-008-0069-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-008-0069-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-008-0069-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T23:05:20Z","timestamp":1684364720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-008-0069-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,26]]},"references-count":66,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["69"],"URL":"https:\/\/doi.org\/10.1007\/s00236-008-0069-0","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,26]]}}}