{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T04:03:20Z","timestamp":1749528200870,"version":"3.41.0"},"publisher-location":"Cham","reference-count":4,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031902024","type":"print"},{"value":"9783031902031","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-90203-1_35","type":"book-chapter","created":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T15:48:44Z","timestamp":1749484124000},"page":"316-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Efficient Maximum Searching Algorithm in\u00a0ReRAM Array"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0990-0588","authenticated-orcid":false,"given":"Wenqing","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziming","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quan","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,10]]},"reference":[{"issue":"11","key":"35_CR1","first-page":"895","volume":"61","author":"S Kvatinsky","year":"2014","unstructured":"Kvatinsky, S., et al.: Magic\u2013memristor-aided logic. IEEE Trans. Circuits Syst. II Express Briefs 61(11), 895\u2013899 (2014)","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Leitersdorf, O., Leitersdorf, D., Gal, J., Dahan, M., Ronen, R., Kvatinsky, S.: Aritpim: high-throughput in-memory arithmetic. IEEE Trans. Emerg. Topics Comput. 11 (2023)","DOI":"10.1109\/TETC.2023.3268137"},{"issue":"3","key":"35_CR3","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1109\/TCSII.2021.3118215","volume":"69","author":"O Leitersdorf","year":"2022","unstructured":"Leitersdorf, O., Ronen, R., Kvatinsky, S.: Multpim: fast stateful multiplication for processing-in-memory. IEEE Trans. Circuits Syst. II Express Briefs 69(3), 1647\u20131651 (2022). https:\/\/doi.org\/10.1109\/TCSII.2021.3118215","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Truong, M.S.Q., et al.: Racer: Bit-pipelined processing using resistive memory. In: MICRO-54: 54th Annual IEEE\/ACM International Symposium on Microarchitecture (2021). https:\/\/api.semanticscholar.org\/CorpusID:239011568","DOI":"10.1145\/3466752.3480071"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2024: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-90203-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T15:48:45Z","timestamp":1749484125000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90203-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031902024","9783031902031"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90203-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"10 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}