{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:08:24Z","timestamp":1725548904123},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241294"},{"type":"electronic","value":"9783540304746"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30474-6_34","type":"book-chapter","created":{"date-parts":[[2010,2,28]],"date-time":"2010-02-28T19:40:22Z","timestamp":1267386022000},"page":"297-308","source":"Crossref","is-referenced-by-count":4,"title":["A Parallel State Assignment Algorithm for Finite State Machines"],"prefix":"10.1007","author":[{"given":"David A.","family":"Bader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamesh","family":"Madduri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-44688-5_11","volume-title":"Algorithm Engineering","author":"D. Bader","year":"2001","unstructured":"Bader, D., Illendula, A., Moret, B.M., Weisse-Bernstein, N.: Using PRAM algorithms on a uniform-memory-access shared-memory architecture. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol.\u00a02141, pp. 129\u2013144. Springer, Heidelberg (2001)"},{"key":"34_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-36265-7_7","volume-title":"High Performance Computing - HiPC 2002","author":"D. Bader","year":"2002","unstructured":"Bader, D., Sreshta, S., Weisse-Bernstein, N.: Evaluating arithmetic expressions using tree contraction: A fast and scalable parallel implementation for symmetric multiprocessors (SMPs). In: Sahni, S.K., Prasanna, V.K., Shukla, U. (eds.) HiPC 2002. LNCS, vol.\u00a02552, pp. 63\u201375. Springer, Heidelberg (2002)"},{"key":"34_CR3","unstructured":"Bader, D.A., Cong, G.: A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). In: Proc. Int\u2019l. Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM (2004)"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Cong, G.: Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. In: Proc. Int\u2019l. Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM (2004)","DOI":"10.1109\/IPDPS.2004.1302953"},{"key":"34_CR5","unstructured":"Lin, B., Newton, A.: Synthesis of multiple level logic from symbolic high-level description language. In: Proc. of the IFIP TC 10\/WG 10.5 Int\u2019l. Conf. on Very Large Scale Integration, Germany, pp. 414\u2013417 (1989)"},{"key":"34_CR6","unstructured":"Sentovich, E., Singh, K., Lavagno, L., Moon, C., Murgai, R., Saldanha, A., Savoj, H., Stephan, P., Brayton, R., Sangiovanni-Vincentelli, A.: SIS: A system for sequential circuit synthesis. Electronics Research Laboratory, University of California, Berkeley. Ucb\/erl m92\/41 edn. (1992)"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/43.259940","volume":"13","author":"J.K. Rho","year":"1994","unstructured":"Rho, J.K., Hachtel, G., Somenzi, F., Jacoby, R.: Exact and heuristic algorithms for the minimization of incompletely specified state machines. IEEE Trans. Computer-Aided Design\u00a013, 167\u2013177 (1994)","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1109\/43.59068","volume":"9","author":"T. Villa","year":"1990","unstructured":"Villa, T., Sangiovanni-Vincentelli, A.: NOVA: State assignment of finite state machines for optimal two-level logic implementation. IEEE Trans. Computer-Aided Design\u00a09, 905\u2013924 (1990)","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Theobald, M., Nowick, S., Wu, T.: Espresso\u2013HF: A heuristic hazard-free minimizer for two-level logic. In: Proc. 33rd ACM Design Automation Conf., Las Vegas, NV, pp. 71\u201376 (1996)","DOI":"10.1145\/240518.240533"},{"key":"34_CR10","unstructured":"Brayton, R., McMullen, C.: Synthesis and optimization of multistage logic. In: Proc. IEEE Int\u2019l. Conf. Computer Design (ICCD), Portchester, NY, pp. 23\u201330 (1984)"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1049\/ip-cdt:19951885","volume":"142","author":"A. Almaini","year":"1995","unstructured":"Almaini, A., Miller, J., Thomson, P., Billina, S.: State assignment of finite state machines using a genetic algorithm. IEEE Proc. Computers and Digital Techniques\u00a0142, 279\u2013286 (1995)","journal-title":"IEEE Proc. Computers and Digital Techniques"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Ashar, P., Devadas, S., Newton, A.: A unified approach to the decomposition and re-decomposition of sequential machines. In: Proc. 27th ACM\/IEEE Design Automation Conf., Orlando, FL, pp. 601\u2013606 (1990)","DOI":"10.1145\/123186.123414"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"1290","DOI":"10.1109\/43.16807","volume":"7","author":"S. Devadas","year":"1988","unstructured":"Devadas, S., Ma, H.K., Newton, A., Sangiovanni-Vincentelli, A.: MUSTANG: State assignment of finite state machines for optimal multi-level logic implementations. IEEE Trans. Computer-Aided Design\u00a07, 1290\u20131300 (1988)","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1109\/43.293940","volume":"13","author":"B. Ramkumar","year":"1994","unstructured":"Ramkumar, B., Banerjee, P.: ProperCAD: A portable object-oriented parallel environment for VLSI CAD. IEEE Trans. Computer-Aided Design\u00a013, 829\u2013842 (1994)","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/12.663772","volume":"47","author":"G. Hasteer","year":"1998","unstructured":"Hasteer, G., Banerjee, P.: A parallel algorithm for state assignment in finite state machines. IEEE Transactions on Computers\u00a047, 242\u2013246 (1998)","journal-title":"IEEE Transactions on Computers"},{"key":"34_CR16","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1006\/jpdc.1999.1541","volume":"58","author":"D.A. Bader","year":"1999","unstructured":"Bader, D.A., J\u00e1J\u00e1, J.: SIMPLE: A methodology for programming high performance algorithms on clusters of symmetric multiprocessors (SMPs). Journal of Parallel and Distributed Computing\u00a058, 92\u2013108 (1999)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Kim, S., Chandy, J., Parkes, S., Ramkumar, B., Banerjee, P.: ProperPLACE: A portable parallel algorithm for standard cell placement. In: Proc. 8th Int\u2019l. Parallel Processing Symp. (IPPS 1994), Canc\u00fan, Mexico, pp. 932\u2013941 (1994)","DOI":"10.1109\/IPPS.1994.288194"},{"key":"34_CR18","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1109\/TCAD.1987.1270301","volume":"6","author":"S. Kravitz","year":"1987","unstructured":"Kravitz, S., Rutenbar, R.: Placement by simulated annealing on a multiprocessor. IEEE Trans. Computer-Aided Design\u00a06, 534\u2013549 (1987)","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"34_CR19","unstructured":"Gao, M., Jiang, J.H., Jiang, Y., Li, Y., Sinha, S., Brayton, R.: MVSIS. In: Proc. Int\u2019l. Workshop on Logic Synthesis, Tahoe City, CA, pp. 138\u2013144 (2001)"},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Madduri, K.: A parallel state assignment algorithm for finite state machines. Technical report, Electrical and Computer Engineering Department, The University of New Mexico, Albuquerque, NM (2003)","DOI":"10.1007\/978-3-540-30474-6_34"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing - HiPC 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30474-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T09:23:40Z","timestamp":1558862620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30474-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241294","9783540304746"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30474-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}