{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T16:33:13Z","timestamp":1720197193585},"reference-count":5,"publisher":"Elsevier BV","issue":"1-5","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Microprocessing and Microprogramming"],"published-print":{"date-parts":[[1988,3]]},"DOI":"10.1016\/0165-6074(88)90331-6","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:14:48Z","timestamp":1062609288000},"page":"33-36","source":"Crossref","is-referenced-by-count":4,"title":["Processor control part synthesis using effective partitioning algorithms"],"prefix":"10.1016","volume":"23","author":[{"given":"H","family":"Mahler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H","family":"Lieb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.G","family":"Baitinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0165-6074(88)90331-6_BIB1","unstructured":"L. Loeffler, R. Schmid, U. G. Baitinger: \u201cProcessor Control Part Synthesis Tool Yields Short Turnaround Times By High Level Description\u201d, ICCAD 1985, Santa Clara, California, USA."},{"key":"10.1016\/0165-6074(88)90331-6_BIB2","doi-asserted-by":"crossref","DOI":"10.1016\/0165-6074(82)90096-5","article-title":"Efficiency and Performance of Different Design Methodologies for Control Part of Microprocessors","volume":"10","author":"Obrebska","year":"1982","journal-title":"Microprocessing and Microprogramming"},{"key":"10.1016\/0165-6074(88)90331-6_BIB3","series-title":"International Workshop on Logic Synthesis","article-title":"New State Assignment Algorithms For Finite State Machines Using Counters and Multiple PLA\/ROM Structures","author":"Amann","year":"1987"},{"key":"10.1016\/0165-6074(88)90331-6_BIB4","doi-asserted-by":"crossref","DOI":"10.1109\/TCAD.1985.1270123","article-title":"Optimal State Assignment for Finite State Machines","author":"De Micheli","year":"1985","journal-title":"IEEE Transactions on CAD for Integrated Circuits and Systems"},{"key":"10.1016\/0165-6074(88)90331-6_BIB5","series-title":"to be published at 3rd E.I.S.-Workshop of GMD","article-title":"FIPS - Ein 8-bit RISC-Entwurf f\u00fcr die Lehre","author":"Amann","year":"1987"}],"container-title":["Microprocessing and Microprogramming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165607488903316?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165607488903316?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:53:04Z","timestamp":1551088384000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0165607488903316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":5,"journal-issue":{"issue":"1-5","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["0165607488903316"],"URL":"https:\/\/doi.org\/10.1016\/0165-6074(88)90331-6","relation":{},"ISSN":["0165-6074"],"issn-type":[{"value":"0165-6074","type":"print"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}