{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T01:34:19Z","timestamp":1726191259925},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031270505"},{"type":"electronic","value":"9783031270512"}],"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-27051-2_16","type":"book-chapter","created":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:03:35Z","timestamp":1678665815000},"page":"179-190","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Energy Efficient Sorting, Selection and\u00a0Searching"],"prefix":"10.1007","author":[{"given":"Varunkumar","family":"Jayapaul","sequence":"first","affiliation":[]},{"given":"Seungbum","family":"Jo","sequence":"additional","affiliation":[]},{"given":"Krishna","family":"Palem","sequence":"additional","affiliation":[]},{"given":"Srinivasa Rao","family":"Satti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,13]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Feldman, V., Hassidim, A., Nelson, J.: Sorting and selection with imprecise comparisons. ACM Trans. Algorithms 12(2), 19:1\u201319:19 (2016)","DOI":"10.1145\/2701427"},{"issue":"4\u20135","key":"16_CR2","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1017\/S0963548304006297","volume":"13","author":"L Alonso","year":"2004","unstructured":"Alonso, L., Chassaing, P., Gillet, F., Janson, S., Reingold, E.M., Schott, R.: Quicksort with unreliable comparisons: a probabilistic analysis. Comb. Probab. Comput. 13(4\u20135), 419\u2013449 (2004). https:\/\/doi.org\/10.1017\/S0963548304006297","journal-title":"Comb. Probab. Comput."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Arumugam, G.P., et al.: Novel inexact memory aware algorithm co-design for energy efficient computation: algorithmic principles. In: Proceedings of the 2015 Design, Automation & Test in Europe Conference & Exhibition, DATE 2015, pp. 752\u2013757. ACM (2015)","DOI":"10.7873\/DATE.2015.1114"},{"issue":"4","key":"16_CR4","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"CH Bennett","year":"1989","unstructured":"Bennett, C.H.: Time\/space trade-offs for reversible computation. SIAM J. Comput. 18(4), 766\u2013776 (1989)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.3390\/a14020055","volume":"14","author":"E Bianchi","year":"2021","unstructured":"Bianchi, E., Penna, P.: Optimal clustering in stable instances using combinations of exact and noisy ordinal queries. Algorithms 14(2), 55 (2021)","journal-title":"Algorithms"},{"key":"16_CR6","unstructured":"David, H.A.: The Method of Paired Comparisons, 2nd edition, vol. 12. London (1988)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Lynch, J., Mirano, G.J., Tyagi, N.: Energy-efficient algorithms. In: Sudan, M. (ed.) Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, Cambridge, MA, USA, 14\u201316 January 2016, pp. 321\u2013332. ACM (2016)","DOI":"10.1145\/2840728.2840756"},{"issue":"5","key":"16_CR8","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1137\/S0097539791195877","volume":"23","author":"U Feige","year":"1994","unstructured":"Feige, U., Raghavan, P., Peleg, D., Upfal, E.: Computing with noisy information. SIAM J. Comput. 23(5), 1001\u20131018 (1994)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s00453-007-9088-4","volume":"52","author":"I Finocchi","year":"2008","unstructured":"Finocchi, I., Italiano, G.F.: Sorting and searching in faulty memories. Algorithmica 52(3), 309\u2013332 (2008)","journal-title":"Algorithmica"},{"issue":"3","key":"16_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.comgeo.2004.12.007","volume":"31","author":"S Funke","year":"2005","unstructured":"Funke, S., Mehlhorn, K., N\u00e4her, S.: Structural filtering: a paradigm for efficient and exact geometric programs. Comput. Geom. 31(3), 179\u2013194 (2005)","journal-title":"Comput. Geom."},{"key":"16_CR11","unstructured":"Geissmann, B., Leucci, S., Liu, C., Penna, P.: Optimal sorting with persistent comparison errors. In: 27th Annual European Symposium on Algorithms, ESA 2019. LIPIcs, vol. 144, pp. 49:1\u201349:14 (2018)"},{"key":"16_CR12","unstructured":"Geissmann, B., Leucci, S., Liu, C.H., Penna, P., Proietti, G.: Dual-mode greedy algorithms can save energy. In: 30th International Symposium on Algorithms and Computation (ISAAC 2019), vol. 149, pp. 64\u20131. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-319-73117-9_36","volume-title":"SOFSEM 2018: Theory and Practice of Computer Science","author":"B Geissmann","year":"2018","unstructured":"Geissmann, B., Penna, P.: Inversions from sorting with distance-based errors. In: Tjoa, A.M., Bellatreche, L., Biffl, S., van Leeuwen, J., Wiedermann, J. (eds.) SOFSEM 2018. LNCS, vol. 10706, pp. 508\u2013522. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73117-9_36"},{"issue":"5","key":"16_CR14","doi-asserted-by":"publisher","first-page":"052108","DOI":"10.1103\/PhysRevE.97.052108","volume":"97","author":"B Geissmann","year":"2018","unstructured":"Geissmann, B., Penna, P.: Sorting processes with energy-constrained comparisons. Phys. Rev. E 97(5), 052108 (2018)","journal-title":"Phys. Rev. E"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Huang, Z., Kannan, S., Khanna, S.: Algorithms for the generalized sorting problem. In: Ostrovsky, R. (ed.) IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, pp. 738\u2013747. IEEE Computer Society (2011)","DOI":"10.1109\/FOCS.2011.54"},{"issue":"8","key":"16_CR16","doi-asserted-by":"publisher","first-page":"2249","DOI":"10.1109\/TCSI.2008.920139","volume":"55","author":"P Korkmaz","year":"2008","unstructured":"Korkmaz, P., Akgul, B.E.S., Palem, K.V.: Energy, performance, and probability tradeoffs for energy-efficient probabilistic CMOS circuits. IEEE Trans. Circuits Syst. I Regul. Pap. 55(8), 2249\u20132262 (2008)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"issue":"3","key":"16_CR17","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R Landauer","year":"1961","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5(3), 183\u2013191 (1961). https:\/\/doi.org\/10.1147\/rd.53.0183","journal-title":"IBM J. Res. Dev."},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/s00453-021-00880-1","volume":"84","author":"S Leucci","year":"2022","unstructured":"Leucci, S., Liu, C.H.: Approximate minimum selection with unreliable comparisons. Algorithmica 84(1), 60\u201384 (2022)","journal-title":"Algorithmica"},{"key":"16_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69672-5","volume-title":"Data Structures and Algorithms 1: Sorting and Searching, EATCS Monographs on Theoretical Computer Science","author":"K Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching, EATCS Monographs on Theoretical Computer Science, vol. 1. Springer, Cham (1984). https:\/\/doi.org\/10.1007\/978-3-642-69672-5"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Palem, K.V., Avinash, L.: Ten years of building broken chips: the physics and engineering of inexact computing. ACM Trans. Embed. Comput. Syst. 12(2s), 87:1\u201387:23 (2013)","DOI":"10.1145\/2465787.2465789"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1038\/341119a0","volume":"341","author":"WH Zurek","year":"1989","unstructured":"Zurek, W.H.: Thermodynamic cost of computation, algorithmic complexity and the information metric. Nature 341, 119\u2013124 (1989)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27051-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:05:16Z","timestamp":1678665916000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27051-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031270505","9783031270512"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27051-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hsinchu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"22 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.walcom2023.conf.nycu.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"30","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":"40% - 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":"10","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)"}},{"value":"This proceeding includes 2 invited papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}