{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T05:02:57Z","timestamp":1739854977430,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114397"},{"type":"electronic","value":"9783642114403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_16","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T16:03:36Z","timestamp":1265126616000},"page":"167-178","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Algorithms for Encoding and Decoding Blob Code"],"prefix":"10.1007","author":[{"given":"Saverio","family":"Caminiti","sequence":"first","affiliation":[]},{"given":"Rossella","family":"Petreschi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Boppana, V., Hartanto, I., Fuchs, W.K.: Full Fault Dictionary Storage Based on Labeled Tree Encoding. In: Proc. of IEEE VTS, pp. 174\u2013179 (1996)","DOI":"10.1109\/VTEST.1996.510854"},{"issue":"2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R.P. Brent","year":"1974","unstructured":"Brent, R.P.: The Parallel Evaluation of General Arithmetic Expressions. J. of ACM\u00a021(2), 201\u2013206 (1974)","journal-title":"J. of ACM"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Caminiti, S.: On Coding Labeled Trees. PhD thesis, Sapienza University of Rome (December 2007)","DOI":"10.1016\/j.tcs.2007.03.009"},{"key":"16_CR4","first-page":"65","volume":"183","author":"S. Caminiti","year":"2006","unstructured":"Caminiti, S., Deo, N., Micikevi\u010dius, P.: Linear-time Algorithms for Encoding Trees as Sequences of Node Labels. Congr. Num.\u00a0183, 65\u201375 (2006)","journal-title":"Congr. Num."},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2007.03.009","volume":"382","author":"S. Caminiti","year":"2007","unstructured":"Caminiti, S., Finocchi, I., Petreschi, R.: On Coding Labeled Trees. TCS\u00a0382(2), 97\u2013108 (2007)","journal-title":"TCS"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11533719_27","volume-title":"Computing and Combinatorics","author":"S. Caminiti","year":"2005","unstructured":"Caminiti, S., Petreschi, R.: String Coding of Trees with Locality and Heritability. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 251\u2013262. Springer, Heidelberg (2005)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-642-01970-8_60","volume-title":"ICCS 2009, Part I","author":"S. Caminiti","year":"2009","unstructured":"Caminiti, S., Petreschi, R.: Parallel Algorithms for Dandelion-Like Codes. In: Allen, G., et al. (eds.) ICCS 2009, Part I. LNCS, vol.\u00a05544, pp. 611\u2013620. Springer, Heidelberg (2009)"},{"key":"16_CR8","first-page":"376","volume":"23","author":"A. Cayley","year":"1889","unstructured":"Cayley, A.: A Theorem on Trees. Quart. J. of Math.\u00a023, 376\u2013378 (1889)","journal-title":"Quart. J. of Math."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"9635","DOI":"10.1073\/pnas.87.24.9635","volume":"87","author":"W.Y.C. Chen","year":"1990","unstructured":"Chen, W.Y.C.: A General Bijective Algorithm for Trees. Proc. of NAS\u00a087, 9635\u20139639 (1990)","journal-title":"Proc. of NAS"},{"key":"16_CR10","first-page":"7","volume":"130","author":"N. Deo","year":"1998","unstructured":"Deo, N., Kumar, N., Kumar, V.: Parallel Generation of Random Trees and Connected Graphs. Congr. Num.\u00a0130, 7\u201318 (1998)","journal-title":"Congr. Num."},{"key":"16_CR11","first-page":"77","volume":"34","author":"N. Deo","year":"2002","unstructured":"Deo, N., Micikevi\u010dius, P.: A New Encoding for Labeled Trees Employing a Stack and a Queue. Bull. of ICA\u00a034, 77\u201385 (2002)","journal-title":"Bull. of ICA"},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0097-3165(86)90004-X","volume":"42A","author":"\u00d6. E\u011fecio\u011flu","year":"1986","unstructured":"E\u011fecio\u011flu, \u00d6., Remmel, J.B.: Bijections for Cayley Trees, Spanning Trees, and Their q-Analogues. J. of Comb. Th.\u00a042A(1), 15\u201330 (1986)","journal-title":"J. of Comb. Th."},{"issue":"4","key":"16_CR13","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"M.J. Fischer","year":"1980","unstructured":"Fischer, M.J., Ladner, R.E.: Parallel Prefix Computation. J. of ACM\u00a027(4), 831\u2013838 (1980)","journal-title":"J. of ACM"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1007\/11549468_68","volume-title":"Euro-Par 2005 Parallel Processing","author":"V.K. Garg","year":"2005","unstructured":"Garg, V.K., Agarwal, A.: Distributed Maintenance of a Spanning Tree Using Labeled Tree Encoding. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol.\u00a03648, pp. 606\u2013616. Springer, Heidelberg (2005)"},{"issue":"3","key":"16_CR15","first-page":"205","volume":"102","author":"R. Greenlaw","year":"2000","unstructured":"Greenlaw, R., Petreschi, R.: Computing Pr\u00fcfer Codes Efficiently in Parallel. DAM\u00a0102(3), 205\u2013222 (2000)","journal-title":"DAM"},{"key":"16_CR16","volume-title":"An Introduction to Parallel Algorithms","author":"J. J\u00e1j\u00e1","year":"1992","unstructured":"J\u00e1j\u00e1, J.: An Introduction to Parallel Algorithms. Addison-Wesley, Reading (1992)"},{"key":"16_CR17","unstructured":"Julstrom, B.A.: The Blob Code: A Better String Coding of Spanning Trees for Evolutionary Search. In: Proc. of ROPNET, pp. 256\u2013261 (2001)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Julstrom, B.A.: The Blob Code is Competitive with Edge-Sets in Genetic Algorithms for the Minimum Routing Cost Spanning Tree Problem. In: Proc. of GECCO, pp. 585\u2013590 (2005)","DOI":"10.1145\/1068009.1068108"},{"issue":"3","key":"16_CR19","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(91)90138-R","volume":"87","author":"G. Kreweras","year":"1991","unstructured":"Kreweras, G., Moszkowski, P.: Tree Codes that Preserve Increases and Degree Sequences. J. of Disc. Math.\u00a087(3), 291\u2013296 (1991)","journal-title":"J. of Disc. Math."},{"key":"16_CR20","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An Introduction to Genetic Algorithms","author":"M. Mitchell","year":"1996","unstructured":"Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1996)"},{"key":"16_CR21","volume-title":"Counting Labeled Trees","author":"J.W. Moon","year":"1970","unstructured":"Moon, J.W.: Counting Labeled Trees. William Clowes and Sons, London (1970)"},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1017\/S030500410002853X","volume":"49","author":"E.H. Neville","year":"1953","unstructured":"Neville, E.H.: The Codifying of Tree-Structure. Proc. of Cambridge Phil. Soc.\u00a049, 381\u2013385 (1953)","journal-title":"Proc. of Cambridge Phil. Soc."},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0095-8956(78)90038-2","volume":"25","author":"J.B. Orlin","year":"1978","unstructured":"Orlin, J.B.: Line-Digraphs, Arborescences, and Theorems of Tutte and Knuth. J. of Comb. Th.\u00a025, 187\u2013198 (1978)","journal-title":"J. of Comb. Th."},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Paulden, T., Smith, D.K.: Recent Advances in the Study of the Dandelion Code, Happy Code, and Blob Code Spanning Tree Representations. In: Proc. of CEC, pp. 2111\u20132118 (2006)","DOI":"10.1109\/CEC.2006.1688567"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Paulden, T., Smith, D.K.: Some Novel Locality Results for the Blob Code Spanning Tree Representation. In: Proc. of GECCO, pp. 1320\u20131327 (2007)","DOI":"10.1145\/1276958.1277207"},{"key":"16_CR26","unstructured":"Picciotto, S.: How to Encode a Tree. PhD thesis, University of California, San Diego (1999)"},{"key":"16_CR27","first-page":"142","volume":"27","author":"H. Pr\u00fcfer","year":"1918","unstructured":"Pr\u00fcfer, H.: Neuer Beweis eines Satzes \u00fcber Permutationen. Archiv der Mathematik und Physik\u00a027, 142\u2013144 (1918)","journal-title":"Archiv der Mathematik und Physik"},{"key":"16_CR28","volume-title":"Genetic Algorithms: A Guide to GA Theory","author":"C.R. Reeves","year":"2003","unstructured":"Reeves, C.R., Rowe, J.E.: Genetic Algorithms: A Guide to GA Theory. Springer, Heidelberg (2003)"},{"key":"16_CR29","volume-title":"Synthesis of Parallel Algorithms","author":"J.H. Reif","year":"1993","unstructured":"Reif, J.H.: Synthesis of Parallel Algorithms. Morgan Kaufmann, San Francisco (1993)"},{"key":"16_CR30","volume-title":"Handbook of Parallel Computing: Models, Algorithms and Applications","author":"U. Vishkin","year":"2008","unstructured":"Vishkin, U., Caragea, G.C., Lee, B.: Models for Advancing PRAM and other Algorithms into Parallel Programs for a PRAM-On-Chip Platform. In: Handbook of Parallel Computing: Models, Algorithms and Applications, ch.\u00a05. CRC Press, Boca Raton (2008)"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Wen, X., Vishkin, U.: PRAM-on-Chip: First Commitment to Silicon. In: Proc. of SPAA, pp. 301\u2013302 (2007)","DOI":"10.1145\/1248377.1248427"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11440-3_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T07:22:25Z","timestamp":1739776945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}