{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:06:55Z","timestamp":1725466015783},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637462"},{"type":"electronic","value":"9783540696407"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0052102","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:02:10Z","timestamp":1149656530000},"page":"337-350","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the arrangement complexity of uniform trees"],"prefix":"10.1007","author":[{"given":"G\u00fcnter","family":"Hotz","sequence":"first","affiliation":[]},{"given":"Hongzhong","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,16]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"B. Becker, and J. Hartmann. Optimal-Time Multipliers and C-Testability. Proceedings of the 2nd Annual Symposium on Parallel Algorithms and Architectures, pp.146\u2013154, 1990.","DOI":"10.1145\/97444.97680"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"B. Becker, and U. Sparmann. Computations over Finite Monoids and their Test Complexity. Theoretical Computer Science, pp.225\u2013250, 1991.","DOI":"10.1016\/0304-3975(91)90161-T"},{"key":"31_CR3","unstructured":"R. Fritzemeier, J. Soden, R. K. Treece, and C. Hawkins. Increased CMOS IC stuck-at fault coverage with reduced IDDQ test sets. International Test Conference, pp.427\u2013435, 1990"},{"issue":"12","key":"31_CR4","doi-asserted-by":"crossref","first-page":"1506","DOI":"10.1109\/T-C.1971.223163","volume":"C-20","author":"J. P. Hayes","year":"1971","unstructured":"J. P. Hayes. On Realizations of Boolean Functions Requiring a Minimal or Near-Minimal Number of Tests. IEEE Trans. on Computers Vol. C-20, No. 12, pp.1506\u20131513, 1971.","journal-title":"IEEE Trans. on Computers"},{"key":"31_CR5","first-page":"185","volume":"1","author":"G. Hotz","year":"1965","unstructured":"G. Hotz. Eine Algebraisierung des Syntheseproblems von Schaltkreisen. EIK 1, 185\u2013205, 209\u2013231, 1965.","journal-title":"EIK"},{"key":"31_CR6","doi-asserted-by":"crossref","DOI":"10.1515\/9783111343716","volume-title":"Schaltkreistheorie","author":"G. Hotz","year":"1974","unstructured":"G. Hotz. Schaltkreistheorie. Walter de Gruyter \u00b7 Berlin \u00b7 New York 1974."},{"key":"31_CR7","unstructured":"G. Hotz, H. Wu. \u201cOn the Arrangement Complexity of Uniform Trees\u201d, Technical Report, SFB 124-B1, 05\/1995, FB-14, Informatik, Universit\u00e4t des Saarlandes, Germany."},{"issue":"1","key":"31_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TC.1977.5009270","volume":"C-26","author":"S. C. Seth","year":"1977","unstructured":"S. C. Seth, and K.L. Kodandapani. Diagnosis of Faults in Linear Tree Networks. IEEE Trans. on Computers, C-26(1), pp.29\u201333, 1977.","journal-title":"IEEE Trans. on Computers"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"H. Wu. On Tests of Uniform Tree Circuits. Proceeding of CONPAR VAPP V, pp.527\u2013538, 1992.","DOI":"10.1007\/3-540-55895-0_451"},{"key":"31_CR10","unstructured":"H. Wu, U. Sparmann. On the Assignments Complexity of Tree VLSI Systems. Proceeding of 7th International Symposium on Computer and Information Sciences, pp.97\u2013103, 1992."},{"key":"31_CR11","unstructured":"H. Wu. On the Assignments Complexity of Uniform Trees. Proceeding of International Symposium on Symbolic and Algebraic Computation, ISSAC' 93, pp.95\u2013104."},{"key":"31_CR12","unstructured":"H. Wu. On the Test Complexity of VLSI Systems, Dissertation, University of Saarland, 1994"}],"container-title":["Lecture Notes in Computer Science","Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T20:38:03Z","timestamp":1674851883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0052102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637462","9783540696407"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0052102","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"16 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}