{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:14:44Z","timestamp":1725531284925},"publisher-location":"Dordrecht","reference-count":24,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9781402096877"},{"type":"electronic","value":"9781402096884"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-1-4020-9688-4_8","type":"book-chapter","created":{"date-parts":[[2009,4,20]],"date-time":"2009-04-20T10:15:15Z","timestamp":1240222515000},"page":"209-240","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of\u00a0Processing Hierarchical Specifications"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Rosenkrantz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"III","given":"Harry B.","family":"Hunt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.\u00a0V. Aho","year":"1974","unstructured":"A.\u00a0V. Aho, J.\u00a0E. Hopcroft, and J.\u00a0D. Ullman. The Design and Analysis of Computer Algorithms. Addison\u2013Wesley, Reading, 1974."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1109\/TCAD.1987.1270345","volume":"CAD-6","author":"J. Benkoski","year":"1987","unstructured":"J. Benkoski and A.\u00a0J. Strojwas. A new approach to hierarchical and statistical timing simulations. IEEE Trans. Computer-Aided Design, CAD-6:1039\u20131052, 1987.","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Proc. Mathematical Foundations of Computer Science","author":"J.\u00a0L. Bentley","year":"1981","unstructured":"J.\u00a0L. Bentley and T. Ottman. The complexity of manipulating hierarchically defined sets of rectangles. In J. Gruska and M. Chytil, editors, Proc. Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, volume\u00a0118, pages 1\u201315. Springer, Berlin, 1981."},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1145\/1634.1639","volume":"31","author":"P.\u00a0A. Bloniarz","year":"1984","unstructured":"P.\u00a0A. Bloniarz, H.\u00a0B. Hunt\u00a0III, and D.\u00a0J. Rosenkrantz. Algebraic structures with hard equivalence and minimization problems. J. Assoc. Comput. Mach., 31:879\u2013904, 1984.","journal-title":"J. Assoc. Comput. Mach."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1109\/MDT.1985.294686","volume":"2","author":"J.\u00a0D. Crawford","year":"1985","unstructured":"J.\u00a0D. Crawford. EDIF: A mechanism for the exchange of design information. IEEE Design and Test, 2:63\u201369, 1985.","journal-title":"IEEE Design and Test"},{"key":"8_CR6","volume-title":"Computers and Intractability","author":"M.\u00a0R. Garey","year":"1979","unstructured":"M.\u00a0R. Garey and D.\u00a0S. Johnson. Computers and Intractability. Freeman, San Francisco, 1979."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1109\/TCAD.1986.1270196","volume":"CAD-5","author":"J.\u00a0P. Hayes","year":"1986","unstructured":"J.\u00a0P. Hayes. Digital simulation with multiple logic values. IEEE Trans. Computer-Aided Design, CAD-5:274\u2013283, 1986.","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF01178584","volume":"28","author":"R. Kolla","year":"1991","unstructured":"R. Kolla and B. Serf. The virtual feedback problem in hierarchical representations of combinatorial circuits. Acta Informatica, 28:463\u2013476, 1991.","journal-title":"Acta Informatica"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-16766-8_16","volume-title":"Proc. Aegean Workshop on Computing","author":"T. Lengauer","year":"1986","unstructured":"T. Lengauer. Exploiting hierarchy in VLSI design. In F. Makedon , editor, Proc. Aegean Workshop on Computing. Lecture Notes in Computer Science, volume\u00a0227, pages 180\u2013193. Springer, Berlin, 1986."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/3-540-16761-7_71","volume-title":"Proc. 13th International Colloquium on Automata, Languages and Programming","author":"T. Lengauer","year":"1986","unstructured":"T. Lengauer. Hierarchical planarity testing algorithms. In L. Kott, editor, Proc. 13th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, volume\u00a0226, pages 215\u2013225. Springer, Berlin, 1986."},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/0196-6774(87)90042-3","volume":"8","author":"T. Lengauer","year":"1987","unstructured":"T. Lengauer. Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs. J. Algorithms, 8:260\u2013284, 1987.","journal-title":"J. Algorithms"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/BFb0039598","volume-title":"Proc. 4th Annual Symposium on Theoretical Aspects of Computer Science","author":"T. Lengauer","year":"1987","unstructured":"T. Lengauer and K.\u00a0W. Wagner. The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems. In E.\u00a0J. Brandenburg , editors, Proc. 4th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, volume\u00a0247, pages 100\u2013113. Springer, Berlin, 1987."},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1137\/0217068","volume":"17","author":"T. Lengauer","year":"1988","unstructured":"T. Lengauer and E. Wanke. Efficient solution of connectivity problems in hierarchically defined graphs. SIAM J. Comput., 17:1063\u20131089, 1988.","journal-title":"SIAM J. Comput."},{"key":"8_CR14","first-page":"184","volume-title":"Fault-Tolerant Computing: Theory and Techniques","author":"Y. Levendel","year":"1986","unstructured":"Y. Levendel and P.\u00a0R. Menon. Fault simulation. In D.\u00a0K. Pradhan, editor, Fault-Tolerant Computing: Theory and Techniques, volume\u00a01, pages 184\u2013264. Prentice Hall, Englewood Cliffs, 1986."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MDT.1986.294900","volume":"3","author":"R. Lipsett","year":"1986","unstructured":"R. Lipsett, E. Marschner, and M. Shahdad. VHDL\u2013the language. IEEE Design and Test, 3:28\u201341, 1986.","journal-title":"IEEE Design and Test"},{"key":"8_CR16","volume-title":"Algebra","author":"S. Maclane","year":"1967","unstructured":"S. Maclane and G. Birkhoff. Algebra. MacMillan, New York, 1967."},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1109\/32.24720","volume":"15","author":"J. Magee","year":"1989","unstructured":"J. Magee, J. Kramer, and M. Sloman. Constructing distributed systems in conic. IEEE Trans. Software Engrg., 15:663\u2013675, 1989.","journal-title":"IEEE Trans. Software Engrg."},{"key":"8_CR18","volume-title":"Introduction to VLSI Systems","author":"C. Mead","year":"1980","unstructured":"C. Mead and L. Conway. Introduction to VLSI Systems. Addison\u2013Wesley, Reading, 1980."},{"key":"8_CR19","first-page":"65","volume":"41","author":"C. Niessen","year":"1983","unstructured":"C. Niessen. Hierarchical design methodologies and tools for VLSI chips. Proc. IEEE, 41:65\u201375, 1983.","journal-title":"Proc. IEEE"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/MDT.1985.294681","volume":"2","author":"J.\u00a0K. Ousterhout","year":"1985","unstructured":"J.\u00a0K. Ousterhout, G.\u00a0T. Hamachi, R.\u00a0N. Mayo, W.\u00a0S. Scott, and G.\u00a0S. Taylor. The magic VLSI layout system. IEEE Design and Test, 2:19\u201330, 1985.","journal-title":"IEEE Design and Test"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"L.\u00a0K. Scheffer and R. Soetarman. Hierarchical analysis of IC artwork with user defined abstraction rules. In Proc. ACM\/IEEE 22nd Design Automation Conference, pages 293\u2013298, 1985.","DOI":"10.1109\/DAC.1985.1585955"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"L.\u00a0J. Stockmeyer and A.\u00a0R. Meyer. Word problems requiring exponential time. In Proc. 5th Annual ACM Symposium on Theory of Computing, pages 1\u20139, 1973.","DOI":"10.1145\/800125.804029"},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/MDT.1985.294682","volume":"2","author":"T.\u00a0J. Wagner","year":"1985","unstructured":"T.\u00a0J. Wagner. Hierarchical layout verification. IEEE Design and Test, 2:31\u201337, 1985.","journal-title":"IEEE Design and Test"},{"key":"8_CR24","volume-title":"Linear and Combinatorial Optimization in Ordered Algebraic Structures","author":"U. Zimmerman","year":"1981","unstructured":"U. Zimmerman. Linear and Combinatorial Optimization in Ordered Algebraic Structures. North-Holland, Amsterdam, 1981."}],"container-title":["Fundamental Problems in Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4020-9688-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T19:05:41Z","timestamp":1580324741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4020-9688-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9781402096877","9781402096884"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-1-4020-9688-4_8","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}