{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T09:17:47Z","timestamp":1768727867244,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031389054","type":"print"},{"value":"9783031389061","type":"electronic"}],"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-38906-1_19","type":"book-chapter","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:14Z","timestamp":1690473914000},"page":"275-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Classification via\u00a0Two-Way Comparisons (Extended Abstract)"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8673-2709","authenticated-orcid":false,"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8144-3345","authenticated-orcid":false,"given":"Neal E.","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0196-6774(02)00203-1","volume":"44","author":"R Anderson","year":"2002","unstructured":"Anderson, R., Kannan, S., Karloff, H., Ladner, R.E.: Thresholds and optimal binary comparison search trees. J. Algorithms 44, 338\u2013358 (2002). https:\/\/doi.org\/10.1016\/S0196-6774(02)00203-1","journal-title":"J. Algorithms"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Chambers, C., Chen, W.: Efficient multiple and predicated dispatching. In: Proceedings of the 1999 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages & Applications (OOPSLA 1999), Denver, Colorado, USA, 1\u20135 November 1999, pp. 238\u2013255 (1999)","DOI":"10.1145\/320385.320407"},{"issue":"10","key":"19_CR3","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/320385.320407","volume":"34","author":"C Chambers","year":"1999","unstructured":"Chambers, C., Chen, W.: Efficient multiple and predicated dispatching. SIGPLAN Not. 34(10), 238\u2013255 (1999). https:\/\/doi.org\/10.1145\/320385.320407","journal-title":"SIGPLAN Not."},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Chrobak, M., Golin, M., Munro, J.I., Young, N.E.: A simple algorithm for optimal search trees with two-way comparisons. ACM Trans. Algorithms 18(1), 2:1\u20132:11 (2021). https:\/\/doi.org\/10.1145\/3477910","DOI":"10.1145\/3477910"},{"issue":"6","key":"19_CR5","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s00236-021-00411-z","volume":"59","author":"M Chrobak","year":"2022","unstructured":"Chrobak, M., Golin, M., Munro, J.I., Young, N.E.: On Huang and Wong\u2019s algorithm for generalized binary split trees. Acta Informatica 59(6), 687\u2013708 (2022). https:\/\/doi.org\/10.1007\/s00236-021-00411-z","journal-title":"Acta Informatica"},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Chrobak, M., Young, N.E.: Classification via two-way comparisons (2023). https:\/\/doi.org\/10.48550\/ARXIV.2302.09692","DOI":"10.48550\/ARXIV.2302.09692"},{"key":"19_CR7","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2022","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 4th edn. The MIT Press, Cambridge (2022)","edition":"4"},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"Dagan, Y., Filmus, Y., Gabizon, A., Moran, S.: Twenty (simple) questions. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, 19\u201323 June 2017, pp. 9\u201321 (2017). https:\/\/doi.org\/10.1145\/3055399.3055422","DOI":"10.1145\/3055399.3055422"},{"issue":"4","key":"19_CR9","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","volume":"38","author":"E Gilbert","year":"1959","unstructured":"Gilbert, E., Moore, E.: Variable-length binary encodings. Bell Syst. Tech. J. 38(4), 933\u2013967 (1959). https:\/\/doi.org\/10.1002\/j.1538-7305.1959.tb01583.x","journal-title":"Bell Syst. Tech. J."},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/0196-6774(86)90031-3","volume":"7","author":"JH Hester","year":"1986","unstructured":"Hester, J.H., Hirschberg, D.S., Huang, S.H., Wong, C.K.: Faster construction of optimal binary split trees. J. Algorithms 7, 412\u2013424 (1986). https:\/\/doi.org\/10.1016\/0196-6774(86)90031-3","journal-title":"J. Algorithms"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00289143","volume":"21","author":"SHS Huang","year":"1984","unstructured":"Huang, S.H.S., Wong, C.K.: Generalized binary split trees. Acta Informatica 21(1), 113\u2013123 (1984). https:\/\/doi.org\/10.1007\/BF00289143","journal-title":"Acta Informatica"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0196-6774(84)90041-5","volume":"5","author":"SHS Huang","year":"1984","unstructured":"Huang, S.H.S., Wong, C.K.: Optimal binary split trees. J. Algorithms 5, 69\u201379 (1984). https:\/\/doi.org\/10.1016\/0196-6774(84)90041-5","journal-title":"J. Algorithms"},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"L Hyafil","year":"1976","unstructured":"Hyafil, L., Rivest, R.L.: Constructing optimal binary decision trees is NP-complete. Inf. Process. Lett. 5(1), 15\u201317 (1976). https:\/\/doi.org\/10.1016\/0020-0190(76)90095-8","journal-title":"Inf. Process. Lett."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"DE Knuth","year":"1971","unstructured":"Knuth, D.E.: Optimum binary search trees. Acta Informatica 1, 14\u201325 (1971). https:\/\/doi.org\/10.1007\/BF00264289","journal-title":"Acta Informatica"},{"key":"19_CR15","volume-title":"The Art of Computer Programming, Volume 3: Sorting and Searching","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 3: Sorting and Searching, 2nd edn. Addison-Wesley Publishing Company, Redwood (1998)","edition":"2"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0196-6774(84)90017-8","volume":"5","author":"Y Perl","year":"1984","unstructured":"Perl, Y.: Optimum split trees. J. Algorithms 5, 367\u2013374 (1984). https:\/\/doi.org\/10.1016\/0196-6774(84)90017-8","journal-title":"J. Algorithms"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1145\/359642.359653","volume":"21","author":"BA Sheil","year":"1978","unstructured":"Sheil, B.A.: Median split trees: a fast lookup technique for frequently occurring keys. Commun. ACM 21, 947\u2013958 (1978). https:\/\/doi.org\/10.1145\/359642.359653","journal-title":"Commun. ACM"},{"issue":"8","key":"19_CR18","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/BF01178732","volume":"31","author":"D Spuler","year":"1994","unstructured":"Spuler, D.: Optimal search trees using two-way key comparisons. Acta Informatica 31(8), 729\u2013740 (1994). https:\/\/doi.org\/10.1007\/BF01178732","journal-title":"Acta Informatica"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Spuler, D.A.: Optimal search trees using two-way key comparisons. Ph.D. thesis, James Cook University (1994)","DOI":"10.1007\/BF01178732"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38906-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:07:20Z","timestamp":1690474040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38906-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389054","9783031389061"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38906-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Algorithms and Data Structures Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"31 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wads.org\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","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":"51% - 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.1","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)"}}]}}