{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:14:53Z","timestamp":1781345693564,"version":"3.54.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0166-218x(02)00457-2","type":"journal-article","created":{"date-parts":[[2003,8,12]],"date-time":"2003-08-12T15:29:34Z","timestamp":1060702174000},"page":"299-310","source":"Crossref","is-referenced-by-count":8,"title":["The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function"],"prefix":"10.1016","volume":"131","author":[{"given":"M.P","family":"Desai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sachin B","family":"Patkar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0166-218X(02)00457-2_BIB1","first-page":"258","article-title":"State assignment for low power","volume":"30","author":"Benini","year":"1995","journal-title":"em IEEE Trans. Comput. Aided Des."},{"key":"10.1016\/S0166-218X(02)00457-2_BIB2","doi-asserted-by":"crossref","unstructured":"L. Benini, G. De Michelli, F. Vermeulen, Finite state machine partitioning for low power, IEEE Symposium on Circuits and Systems, Vol. 2, 1998, pp. 5\u20138.","DOI":"10.1109\/ISCAS.1998.706780"},{"issue":"3","key":"10.1016\/S0166-218X(02)00457-2_BIB3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/234860.234862","article-title":"Low power realization of finite state machines\u2014a decomposition approach","volume":"1","author":"Chow","year":"1996","journal-title":"ACM Trans. Des. Automat. Electron. Syst."},{"key":"10.1016\/S0166-218X(02)00457-2_BIB4","doi-asserted-by":"crossref","unstructured":"J.C. Monteiro, A.L. Oliviera, Finite state machine decomposition for low power, Proceedings 35th Design Automation Conference, San Franscisco, 1998, pp. 758\u2013763.","DOI":"10.1145\/277044.277235"},{"key":"10.1016\/S0166-218X(02)00457-2_BIB5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0024-3795(91)90070-D","article-title":"The principal lattice of partitions of a submodular function","volume":"144","author":"Narayanan","year":"1991","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0166-218X(02)00457-2_BIB6","article-title":"Submodular functions and electrical networks","volume":"Vol. 54","author":"Narayanan","year":"1997"},{"key":"10.1016\/S0166-218X(02)00457-2_BIB7","doi-asserted-by":"crossref","unstructured":"H. Narayanan, B.N.V.M. Gupta, M.P. Desai, A state assignment scheme targeting performance and area, Proceedings of 12th International Conference in VLSI Design, Goa, India, January 1999, pp. 378\u2013383.","DOI":"10.1109\/ICVD.1999.745185"},{"key":"10.1016\/S0166-218X(02)00457-2_BIB8","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1006\/jagm.1996.0047","article-title":"Approximation algorithms for min-k-overlap using the PLP approach","volume":"21","author":"Narayanan","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(02)00457-2_BIB9","doi-asserted-by":"crossref","unstructured":"R. Shelar, M.P. Desai, H. Narayanan, Decomposition of finite state machines for area, delay minimization, Proceedings of the 1999 IEEE International Conference on Computer Design, Austin, TX, USA, (1999), pp. 620\u2013625.","DOI":"10.1109\/ICCD.1999.808606"},{"key":"10.1016\/S0166-218X(02)00457-2_BIB10","doi-asserted-by":"crossref","unstructured":"R. Shelar, H. Narayanan, M.P. Desai, Orthogonal partitioning and gated clock architecture for low power realization of FSMs, Proceedings of the 13th Annual IEEE International ASIC\/SOC Conference, 13\u201316 September, 2000, Washington, pp. 266\u2013270.","DOI":"10.1109\/ASIC.2000.880713"},{"issue":"25","key":"10.1016\/S0166-218X(02)00457-2_BIB11","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1049\/el:19961547","article-title":"State assignment of finite state machines for low power applications","volume":"32","author":"Wang","year":"1996","journal-title":"Electron. Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004572?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004572?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T14:07:15Z","timestamp":1734098835000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0166218X02004572"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00457-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}