{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:18:46Z","timestamp":1743139126013,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031379390"},{"type":"electronic","value":"9783031379406"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-37940-6_10","type":"book-chapter","created":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T20:23:00Z","timestamp":1690057380000},"page":"109-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Synthesis of\u00a0Elementary Cellular Automata for\u00a0Targeted Cache Applications"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9469-5696","authenticated-orcid":false,"given":"Sutapa","family":"Sarkar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4432-6307","authenticated-orcid":false,"given":"Mousumi","family":"Saha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,23]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01223745","volume":"93","author":"O Martin","year":"1984","unstructured":"Martin, O., Odlyzko, A.M., Wolfram, S.: Algebraic properties of cellular automata. Commun. Math. Phys. 93, 219\u2013258 (1984)","journal-title":"Commun. Math. Phys."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.entcs.2009.09.021","volume":"52","author":"S Das","year":"2009","unstructured":"Das, S., Mukherjee, S., Naskar, M., Sikdar, B.K.: Characterization of single cycle CA and its application in pattern classification. Electron. Notes Theor. Comput. Sci. 52, 181\u2013203 (2009)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Singh, H., Kumar, Y.: Cellular automata based model for e-healthcare data analysis. Int. J. Inf. Syst. Model. Des. 10(3), 1\u201318. https:\/\/doi.org\/10.4018\/ijismd","key":"10_CR3","DOI":"10.4018\/ijismd"},{"doi-asserted-by":"publisher","unstructured":"Borriello, E., Walker, S.I.: An information-based classification of elementary cellular automata. Complexity. https:\/\/doi.org\/10.1155\/2017\/1280351","key":"10_CR4","DOI":"10.1155\/2017\/1280351"},{"unstructured":"Choudhury, P.P., et al.: Classification of cellular automata rules based on their properties. Computer Science, Mathematics, arXiv (2009)","key":"10_CR5"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.mejo.2016.11.001","volume":"62","author":"M Dalui","year":"2017","unstructured":"Dalui, M., Sikdar, B.K.: A cellular automata based self-correcting protocol processor for scalable CMPs. Microelectron. J. 62, 108\u2013119 (2017)","journal-title":"Microelectron. J."},{"doi-asserted-by":"crossref","unstructured":"Sarkar, S., Saha, S., Sikdar, B.K.: Multi-bit fault tolerant design for resistive memories through dynamic partitioning. In: 2017 IEEE East-West Design & Test Symposium (EWDTS), Novi Sad, pp. 1\u20136 (2017)","key":"10_CR7","DOI":"10.1109\/EWDTS.2017.8110053"},{"doi-asserted-by":"publisher","unstructured":"Saha, M., Das, B., Sikdar, B.K.: Periodic boundary cellular automata based test structure for memory. In: IEEE East-West Design & Test Symposium (EWDTS), pp. 1\u20136 (2017). https:\/\/doi.org\/10.1109\/EWDTS.2017.8110050","key":"10_CR8","DOI":"10.1109\/EWDTS.2017.8110050"},{"doi-asserted-by":"crossref","unstructured":"Das, B., Dalui, M., Kamilya, S., Das, S., Sikdar, B.K.: Synthesis of Periodic Boundary CA for Efficient Data Migration in Chip-Multiprocessors. IEEE (2013)","key":"10_CR9","DOI":"10.1109\/ISED.2013.40"},{"unstructured":"Chaudhuri, P.P., Chowdhury, D., Nandi, S.R., Chatterjee, S.: Additive Cellular Automata - Theory and Applications, (1). IEEE Computer Society Press, USA (1997)","key":"10_CR10"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/11505877_5","volume-title":"Developments in Language Theory","author":"J Kari","year":"2005","unstructured":"Kari, J.: Reversible cellular automata. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 57\u201368. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11505877_5"},{"issue":"2","key":"10_CR12","first-page":"310","volume":"47","author":"S Sarkar","year":"2020","unstructured":"Sarkar, S., Ghosh, M., Sikdar, B.K., Saha, M.: Periodic boundary cellular automata based wear leveling for resistive memory. IAENG Int. J. Comput. Sci. 47(2), 310\u2013321 (2020)","journal-title":"IAENG Int. J. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Sarkar, S., Sikdar, B.K., Saha, M.: Cellular Automata-Based Multi-bit Stuck-at-Fault Diagnosis for Resistive Memory (2021). http:\/\/www.jzus.zju.edu.cn\/iparticle.php?doi=10.1631\/FITEE.2100255","key":"10_CR13","DOI":"10.1631\/FITEE.2100255"},{"doi-asserted-by":"crossref","unstructured":"Sarkar, S.: Multi-bit stuck-at fault recovery system with error correction pointer. In: Proceedings of the third International Conference on Communication and Electronics Systems. IEEE (2018)","key":"10_CR14","DOI":"10.1109\/CESYS.2018.8723890"},{"doi-asserted-by":"crossref","unstructured":"Saha, M., Sarkar, S., Sikdar, B.K.: Cellular automata based fault tolerant resistive memory design. In: ISED (2016)","key":"10_CR15","DOI":"10.1109\/ISED.2016.7977077"},{"issue":"2s","key":"10_CR16","first-page":"10144","volume":"63","author":"S Sarkar","year":"2020","unstructured":"Sarkar, S., Sikdar, B.K., Saha, M.: An efficient wear leveling for hybrid cache using periodic boundary cellular automata. Solid State Technol. 63(2s), 10144\u201310160 (2020)","journal-title":"Solid State Technol."},{"unstructured":"Sarkar, S.: Cellular automata based wear leveling in resistive memory. In: 2019 IARIA in the Proceeding of Fourteenth International Conference on Systems, Valencia, Spain (2019)","key":"10_CR17"},{"doi-asserted-by":"publisher","unstructured":"Dalui, M., Chakraborty, B., Das, N., Sikdar, B.K.: NSRT diagram for identification of SACA and TACA rules in null-boundary. https:\/\/doi.org\/10.1142\/S0129183122500711","key":"10_CR18","DOI":"10.1142\/S0129183122500711"}],"container-title":["Communications in Computer and Information Science","Advances in Computing and Data Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37940-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T20:24:07Z","timestamp":1690057447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37940-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031379390","9783031379406"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37940-6_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICACDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advances in Computing and Data Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icacds2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icacds.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair & Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"464","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}