{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:12Z","timestamp":1725662892019},"publisher-location":"Berlin, Heidelberg","reference-count":76,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_2","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:02:00Z","timestamp":1330192920000},"page":"23-40","source":"Crossref","is-referenced-by-count":0,"title":["The VLSI revolution in theoretical circles"],"prefix":"10.1007","author":[{"given":"Arnold L.","family":"Rosenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/TC.1982.1676109","volume":"C-31","author":"R. Aleliunas","year":"1980","unstructured":"R. Aleliunas and A.L. Rosenberg (1980): On embedding rectangular grids in square grids. IEEE Trans. Comp., C-31, 907\u2013913.","journal-title":"IEEE Trans. Comp."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1109\/PGEC.1965.264145","volume":"EC-14","author":"A. J. Atrubin","year":"1965","unstructured":"A.J. Atrubin (1965): A one-dimensional real-time iterative multiplier. IEEE Trans. Elec. Comp., EC-14, 394\u2013399.","journal-title":"IEEE Trans. Elec. Comp."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"B.S. Baker, S.N. Bhatt, F.T. Leighton (1983): An approximation algorithm for Manhattan routing. 15th ACM Symp. on Theory of Computing, 477\u2013486.","DOI":"10.1145\/800061.808779"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"B.S. Baker and R.Y. Pinter (1983): An algorithm for the optimal placement and routing of a circuit within a ring of pads. 24th IEEE Symp. on Foundations of Computer Science, 360\u2013370.","DOI":"10.1109\/SFCS.1983.6"},{"key":"2_CR5","unstructured":"Z. Barzilai, J.L. Carter, A.K. Chandra, B.K. Rosen (1983): Diagnosis based on signature testing. IBM Report RC-9682."},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TC.1983.1676202","volume":"C-32","author":"Z. Barzilai","year":"1983","unstructured":"Z. Barzilai, D. Coppersmith, A.L. Rosenberg (1983): Exhaustive bit-pattern generation, with applications to VLSI self-testing. IEEE Trans. Comp., C-32, 190\u2013194.","journal-title":"IEEE Trans. Comp."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1109\/TC.1983.1676300","volume":"C-32","author":"G. M. Baudet","year":"1983","unstructured":"G.M. Baudet, F.P. Preparata, J.E. Vuillemin (1983): Area-time optimal VLSI circuits for convolution. IEEE Trans. Comp., C-32, 684\u2013688.","journal-title":"IEEE Trans. Comp."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"R.P. Brent and H.T. Kung (1980): The chip complexity of binary arithmetic. 12th ACM Symp. on Theory of Computing, 190\u2013200.","DOI":"10.1145\/800141.804666"},{"key":"2_CR9","unstructured":"M.L. Brady and D.J. Brown (1984): Arbitrary planar routing with four layers. 1984 MIT Conf. on Advanced Research in VLSI, 194\u2013201."},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/978-3-642-68402-9_20","volume-title":"VLSI Systems and Computations","author":"D. J. Brown","year":"1981","unstructured":"D.J. Brown and R.L. Rivest (1981): New lower bounds for channel width. VLSI Systems and Computations (ed. H.T. Kung, B. Sproull, G. Steele) Computer Science Press, Rockville, MD, pp.178\u2013185."},{"key":"2_CR11","first-page":"329","volume-title":"VLSI 81: Very Large Scale Integration","author":"R. E. Bryant","year":"1981","unstructured":"R.E. Bryant (1981): A switch-level model of MOS logic circuits. VLSI 81: Very Large Scale Integration (ed. J.P. Gray) Academic Press, London, pp. 329\u2013340."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"J.L. Carter (1982): The theory of signature testing for VLSI. 14th ACM Symp. on Theory of Computing, 66\u201376.","DOI":"10.1145\/800070.802178"},{"key":"2_CR13","first-page":"143","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J.L. Carter and M.N. Wegman (1979): Universal classes of hash functions. J. CSS 18, 143\u2013154.","journal-title":"J. CSS"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"B. Chazelle and L. Monier (1981): A model of computation for VLSI with related complexity results. 13th ACM Symp. on Theory of Computing, 318\u2013325.","DOI":"10.1145\/800076.802485"},{"key":"2_CR15","unstructured":"F.R.K. Chung, F.T. Leighton, A.L. Rosenberg (1983): DIOGENES \u2014 A methodology for designing fault-tolerant processor arrays. 13th Intl. Conf. on Fault-Tolerant Computing, 26\u201332."},{"key":"2_CR16","unstructured":"F.R.K. Chung, F.T. Leighton, A.L. Rosenberg (1984): Embedding graphs in books: A layout problem with applications to VLSI design. Typescript."},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"A. Cobham (1966): The recognition problem for the set of perfect squares. Proc. 7th IEEE Symp. on Switching and Automata Theory, 78\u201387.","DOI":"10.1109\/SWAT.1966.30"},{"key":"2_CR18","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1109\/T-C.1969.222663","volume":"C-18","author":"S. N. Cole","year":"1969","unstructured":"S.N. Cole (1969): Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Trans. Comp., C-18, 349\u2013365.","journal-title":"IEEE Trans. Comp."},{"key":"2_CR19","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1090\/S0002-9947-1969-0249212-8","volume":"142","author":"S. A. Cook","year":"1969","unstructured":"S.A. Cook and S.O. Aanderaa (1969): On the minimum computation time of functions. Trans. AMS 142, 291\u2013314.","journal-title":"Trans. AMS"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"J.A. Darringer, W.H. Joyner, C.L. Berman, L. Trevillyan (1981): Logic synthesis through local transformations. IBM Report RC-8748.","DOI":"10.1147\/rd.254.0272"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"P.W. Dymond and S.A. Cook (1980): Hardware complexity and parallel computation. Proc. 21st IEEE Symp. on Foundations of Computer Science, 360\u2013372.","DOI":"10.1109\/SFCS.1980.22"},{"key":"2_CR22","first-page":"165","volume":"2","author":"E. B. Eichelberger","year":"1978","unstructured":"E.B. Eichelberger and T.W. Williams (1978): A logic design structure for LSI testability. J. Design Automation and Fault-Tolerant Comp. 2, 165\u2013178.","journal-title":"J. Design Automation and Fault-Tolerant Comp."},{"key":"2_CR23","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/B978-0-12-417750-5.50011-7","volume-title":"Theory of Machines and Computations","author":"S. Even","year":"1971","unstructured":"S. Even and A. Itai (1971): Queues, stacks, and graphs. In Theory of Machines and Computations (Z. Kohavi and A. Paz eds.) Academic Press, NY, pp. 71\u201386."},{"key":"2_CR24","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1147\/rd.192.0098","volume":"19","author":"H. Fleisher","year":"1975","unstructured":"H. Fleisher and L.I. Maissel (1975): An introduction to array logic. IBM J. Res. Dev. 19, 98\u2013109.","journal-title":"IBM J. Res. Dev."},{"key":"2_CR25","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MC.1980.1653338","volume":"13","author":"M. J. Foster","year":"1980","unstructured":"M.J. Foster and H.T. Kung (1980): The design of special-purpose VLSI chips. Computer 13, 26\u201340.","journal-title":"Computer"},{"key":"2_CR26","first-page":"75","volume-title":"VLSI 81: Very Large Scale Integration","author":"M. J. Foster","year":"1981","unstructured":"M.J. Foster and H.T. Kung (1981): Recognize regular languages with programmable building-blocks. In VLSI 81: Very Large Scale Integration (ed. J.P. Gray) Academic Press, London, pp. 75\u201384."},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"A. Frank (1982): Disjoint paths in a rectilinear grid. Combinatorica, to appear.","DOI":"10.1007\/BF02579432"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"M. Furst, J.B. Saxe, M. Sipser (1983): Parity, circuits, and the polynomial-time hierarchy. Math. Syst. Theory, to appear.","DOI":"10.1007\/BF01744431"},{"key":"2_CR29","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","volume":"8","author":"F. C. Hennie","year":"1965","unstructured":"F.C. Hennie (1965): One-tape, off-line Turing machine computations. Inform. Contr. 8, 553\u2013578.","journal-title":"Inform. Contr."},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"R.M. Karp, F.T. Leighton, R.L. Rivest, C.D. Thompson, U. Vazirani, V. Vazirani (1983): Global wire routing in two-dimensional arrays. 24th IEEE Symp. on Foundations of Computer Science, 453\u2013459.","DOI":"10.1109\/SFCS.1983.23"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"H.T. Kung (1983): Systolic algorithms and their implementation. Typescript.","DOI":"10.1016\/B978-0-12-546080-4.50009-1"},{"key":"2_CR32","unstructured":"H.T. Kung and C.E. Leiserson (1980): Systolic arrays (for VLSI). In Chapter 8 of (Mead-Conway, 1980)."},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"H.T. Kung and R.L. Picard (1984): One-dimensional systolic arrays for multi-dimensional convolution and resampling. In VLSI for Pattern Recognition and Image Processing, Springer-Verlag.","DOI":"10.1007\/978-3-642-47523-8_2"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"A.S. LaPaugh and R.J. Lipton (1983): Total stuck-at fault testing by circuit transformation. 20th ACM-IEEE Design Automation Conf.","DOI":"10.1109\/DAC.1983.1585733"},{"key":"2_CR35","unstructured":"F.T. Leighton (1984): Parallel computation using meshes of trees. 1983 Workshop on Graph-Theoretic Concepts in Computer Science, 200\u2013218."},{"key":"2_CR36","unstructured":"F.T. Leighton and A.L. Rosenberg (1983): Automatic generation of three-dimensional circuit layouts. 1983 IEEE Intl. Conf. on Computer Design, 633\u2013636."},{"key":"2_CR37","unstructured":"F.T. Leighton and A.L. Rosenberg (1984): Three-dimensional circuit layouts. Submitted for publication."},{"key":"2_CR38","unstructured":"C.E. Leiserson, F.M. Rose, J.B. Saxe (1982): Digital circuit optimization. 3rd Caltech Conf. on VLSI."},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"T. Lengauer (1982): The complexity of compacting hierarchically specified layouts of integrated circuits. 23rd IEEE Symp. on Foundations of Computer Science, 358\u2013368.","DOI":"10.1109\/SFCS.1982.92"},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"T. Lengauer (1983): On the solution of inequality systems relevant to IC-layout. J. Algorithms, to appear.","DOI":"10.1016\/0196-6774(84)90020-8"},{"key":"2_CR41","unstructured":"T. Lengauer (1984): Efficient algorithms for the constraint generation for integrated circuit layout compaction. 1983 Workshop on Graph-Theoretic Concepts in Computer Science, 219\u2013230."},{"key":"2_CR42","unstructured":"T. Lengauer and K. Mehlhorn (1984): The HILL system: a design environment for the hierarchical specification, compaction, and simulation of integrated circuit layouts. 1984 MIT Conf. on Advanced Research in VLSI, 139\u2013149."},{"key":"2_CR43","unstructured":"T. Lengauer and S. Naeher (1984): Delay-independent switch-level simulation of digital MOS circuits. Typescript."},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"R.J. Lipton and R. Sedgewick (1981): Lower bounds for VLSI. 13th ACM Symp. on Theory of Computing, 300\u2013307.","DOI":"10.1145\/800076.802482"},{"key":"2_CR45","first-page":"5","volume":"6","author":"O. B. Lupanov","year":"1961","unstructured":"O.B. Lupanov (1961): On the realization of functions of logical algebra by formulae of limited depth in the basis [AND, OR, NOT]. Probl. Kibernetiki 6, 5\u201314.","journal-title":"Probl. Kibernetiki"},{"key":"2_CR46","volume-title":"Introduction to VLSI Systems","author":"C. Mead","year":"1980","unstructured":"C. Mead and L. Conway (1980): Introduction to VLSI Systems, Addison-Wesley, Reading, MA."},{"key":"2_CR47","unstructured":"K. Mehlhorn and F.P. Preparata (1983): Routing through a rectangle. Typescript."},{"key":"2_CR48","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/TC.1982.1676104","volume":"C-31","author":"Th. Ottmann","year":"1981","unstructured":"Th. Ottmann, A.L. Rosenberg, L.J. Stockmeyer (1981): A dictionary machine (for VLSI). IEEE Trans. Comp., C-31, 892\u2013897.","journal-title":"IEEE Trans. Comp."},{"key":"2_CR49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01744565","volume":"16","author":"F. P. Preparata","year":"1981","unstructured":"F.P. Preparata (1981): Optimal three-dimensional VLSI layouts. Math. Systems Theory 16, 1\u20138.","journal-title":"Math. Systems Theory"},{"key":"2_CR50","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TC.1983.1676203","volume":"C-32","author":"F. P. Preparata","year":"1983","unstructured":"F.P. Preparata (1983): A mesh-connected area-time optimal VLSI multiplier of large integers. IEEE Trans. Comp., C-32, 194\u2013198.","journal-title":"IEEE Trans. Comp."},{"key":"2_CR51","doi-asserted-by":"crossref","unstructured":"F.P. Preparata and W. Lipski (1982): Optimal three-layer channel routing. 23rd IEEE Symp. on Foundations of Computer Science 350\u2013357.","DOI":"10.1109\/SFCS.1982.47"},{"key":"2_CR52","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(80)90006-X","volume":"11","author":"F. P. Preparata","year":"1980","unstructured":"F.P. Preparata and J.E. Vuillemin (1980): Area-time optimal VLSI networks for multiplying matrices. Inf. Proc. Let. 11, 77\u201380.","journal-title":"Inf. Proc. Let."},{"key":"2_CR53","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F. P. Preparata","year":"1981","unstructured":"F.P. Preparata and J.E. Vuillemin (1981): The cube-connected cycles: a versatile network for parallel computation. C. ACM 24, 300\u2013309.","journal-title":"C. ACM"},{"key":"2_CR54","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02759719","volume":"1","author":"M. O. Rabin","year":"1963","unstructured":"M.O. Rabin (1963): Real-time computation. Israel J. Math. 1, 203\u2013211.","journal-title":"Israel J. Math."},{"key":"2_CR55","unstructured":"S.P. Reiss and J.E. Savage (1982): SLAP \u2014 A methodology for silicon layout. IEEE Int'l. Conf. on Circuits and Computers, 281\u2013285."},{"key":"2_CR56","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-3-642-68402-9_18","volume-title":"VLSI Systems and Computations","author":"R. L. Rivest","year":"1981","unstructured":"R.L. Rivest, A.E. Baratz, G. Miller (1981): Provably good channel routing algorithms. VLSI Systems and Computations (ed. H.T. Kung, B. Sproull, G. Steele) Computer Science Press, Rockville, MD, pp. 153\u2013159."},{"key":"2_CR57","unstructured":"R.L. Rivest and C.M. Fiduccia (1982): A \"greedy\" channel router. 19th ACM-IEEE Design Automation Conf., 418\u2013424."},{"key":"2_CR58","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-642-68402-9_9","volume-title":"VLSI Systems and Computations","author":"A. L. Rosenberg","year":"1981","unstructured":"A.L. Rosenberg (1981): Three-dimensional integrated circuitry. In VLSI Systems and Computations (ed. H.T. Kung, B. Sproull, G. Steele) Computer Science Press, Rockville, MD, pp. 69\u201380."},{"key":"2_CR59","unstructured":"A.L. Rosenberg (1981): Routing with permuters: Toward reconfigurable and fault-tolerant networks. Duke Univ. Tech. Rpt. CS-1981-13."},{"key":"2_CR60","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1145\/2402.322384","volume":"30","author":"A. L. Rosenberg","year":"1983","unstructured":"A.L. Rosenberg (1983): Three-dimensional VLSI: A case study. J. ACM 30, 397\u2013416.","journal-title":"J. ACM"},{"key":"2_CR61","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1109\/TC.1983.1676134","volume":"C-32","author":"A. L. Rosenberg","year":"1983","unstructured":"A.L. Rosenberg (1983): The Diogenes approach to testable fault-tolerant arrays of processors. IEEE Trans. Comp., C-32, 902\u2013910.","journal-title":"IEEE Trans. Comp."},{"key":"2_CR62","unstructured":"A.L. Rosenberg (1984): Fault-tolerant interconnection networks: a graph-theoretic approach. 1983 Workshop on Graph-Theoretic Concepts in Computer Science, 286\u2013297."},{"key":"2_CR63","unstructured":"A.L. Rosenberg (1984): On designing fault-tolerant VSLI processor arrays. Advances in Computing Research 2, to appear."},{"key":"2_CR64","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-3-642-68402-9_14","volume-title":"VLSI Systems and Computations","author":"W. L. Ruzzo","year":"1981","unstructured":"W.L. Ruzzo and L. Snyder (1981): Minimum edge-length planar embeddings of trees. VLSI Systems and Computations (ed. H.T. Kung, B. Sproull, G. Steele) Computer Science Press, Rockville, MD, pp. 119\u2013123."},{"key":"2_CR65","unstructured":"M. Sarrafzadeh and F.P. Preparata (1983): Compact channel-routing of multiterminal nets. Typescript."},{"key":"2_CR66","doi-asserted-by":"crossref","unstructured":"J.E. Savage (1981): Area-time tradeoffs for matrix multiplication and related problems in VLSI models. J. CSS, 230\u2013242.","DOI":"10.1016\/0022-0000(81)90029-5"},{"key":"2_CR67","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-642-68402-9_8","volume-title":"VLSI Systems and Computations","author":"J. E. Savage","year":"1981","unstructured":"J.E. Savage (1981): Planar circuit complexity and the performance of VLSI algorithms. In VLSI Systems and Computations (ed. H.T. Kung, B. Sproull, G. Steele) Computer Science Press, Rockville, MD, pp. 61\u201368."},{"key":"2_CR68","unstructured":"J.E. Savage (1982): Multilective planar circuit size. 20th Allerton Conf. on Commun., Control, and Computing."},{"key":"2_CR69","volume-title":"Algorithmically-Specialized Computers","author":"J. E. Savage","year":"1983","unstructured":"J.E. Savage (1983): Three VLSI compilation techniques: PLAs, Weinberger arrays, and SLAP, a new silicon layout program. In Algorithmically-Specialized Computers (ed. L. Snyder, L.J. Siegel, H.J. Siegel, D. Gannon) Academic Press, NY."},{"key":"2_CR70","unstructured":"J.E. Savage (1983): Heuristics in the SLAP layout system. 1983 IEEE Intl Conf. On Computer Design, 637\u2013640."},{"key":"2_CR71","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1147\/rd.32.0198","volume":"3","author":"J. C. Shepherdson","year":"1959","unstructured":"J.C. Shepherdson (1959): The reduction of two-way automata to one-way automata. IBM J. Res. Dev. 3, 198\u2013200.","journal-title":"IBM J. Res. Dev."},{"key":"2_CR72","unstructured":"L. Snyder (1980): A synopsis of the Blue CHiP Project. Purdue Univ. Dept. of Computer Science Tech. Rpt."},{"key":"2_CR73","first-page":"237","volume-title":"VLSI 81: Very Large Scale Integration","author":"L. Snyder","year":"1981","unstructured":"L. Snyder (1981): Overview of the CHiP computer. In VLSI 81: Very Large Scale Integration (ed. J. P. Gray) Academic Press, London, pp. 237\u2013246."},{"key":"2_CR74","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/321694.321704","volume":"19","author":"R. E. Tarjan","year":"1972","unstructured":"R.E. Tarjan (1972): Sorting using networks of queues and stacks. J.ACM 19, 341\u2013346.","journal-title":"J.ACM"},{"key":"2_CR75","unstructured":"C.D. Thompson (1980): A complexity theory for VLSI. Ph.D. Thesis, Carnegie-Mellon University; see also Area-time complexity for VLSI. 11th ACM Symp. on Theory of Computing, 1979, 81\u201388."},{"key":"2_CR76","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1109\/TC.1983.1676221","volume":"C-32","author":"J. Vuillemin","year":"1983","unstructured":"J. Vuillemin (1983): A combinatorial limit to the computing power of VLSI circuits. IEEE Trans. Comp., C-32, 294\u2013300.","journal-title":"IEEE Trans. Comp."}],"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-13345-3_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:07:13Z","timestamp":1605643633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":76,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}