{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:53:42Z","timestamp":1782924822014,"version":"3.54.5"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T00:00:00Z","timestamp":1779667200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T00:00:00Z","timestamp":1779667200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,25]]},"DOI":"10.1109\/ipdps65963.2026.00029","type":"proceedings-article","created":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T20:55:16Z","timestamp":1782852916000},"page":"212-222","source":"Crossref","is-referenced-by-count":0,"title":["Organic Mergesort and Finger Buffer-Tree Sort: Adaptive Sorting Algorithms with External-Memory or Parallel Implementations"],"prefix":"10.1109","author":[{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"first","affiliation":[{"name":"Aarhus Univ.,Aarhus,Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[{"name":"Univ. of Calif., Irvine,Irvine,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryuto","family":"Kitagawa","sequence":"additional","affiliation":[{"name":"Univ. of Calif., Irvine,Irvine,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nodari","family":"Sitchinava","sequence":"additional","affiliation":[{"name":"Univ. of Hawaii at Manoa,Honolulu,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"Svenning","sequence":"additional","affiliation":[{"name":"Aarhus Univ.,Aarhus,Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1021-x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57155-8_238"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/0218035"},{"key":"ref5","author":"Auger","year":"2019","journal-title":"On the worst-case complexity of timsort"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.10.019"},{"key":"ref7","first-page":"26:1","article-title":"The geometry of tree-based sorting","volume-title":"Kousha Etessami, Uriel Feige, and Gabriele Puppis","author":"Blelloch","year":"2023"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_37"},{"key":"ref9","first-page":"219","article-title":"Funnel heap - A cache oblivious priority queue","volume-title":"Int. Symp. on Algorithms and Computation (ISAAC), volume 2518 of LNCS","author":"Brodal"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780589"},{"key":"ref11","first-page":"576","article-title":"Cacheaware and cache-oblivious adaptive sorting","volume-title":"32nd Int. Colloq. Automata, Languages and Programming (ICALP), volume 3580 of LNCS","author":"Brodal"},{"key":"ref12","first-page":"25:1","article-title":"Funnelselect: Cache-oblivious multiple selection","volume-title":"European Symposium on Algorithms (ESA), LIPIcs","author":"Brodal"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.78"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90179-l"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55895-0_452"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"ref17","volume-title":"Introduction to Algorithms","author":"Cormen","year":"2022"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/146370.146381"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_29"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071383"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977561.ch16"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226670"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/bf00288968"},{"key":"ref24","volume-title":"Parallel Algorithms","author":"J\u00e1J\u00e1","year":"1992"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3664195"},{"key":"ref26","volume-title":"The Art of Computer Programming, Volume III: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/tc.1983.1676138"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/icpp.1994.137"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90139-7"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00256-1"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-13345-3_29"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69672-5"},{"key":"ref33","first-page":"63:1","article-title":"Nearly-optimal mergesorts: Fast, practical sorting methods that optimally adapt to existing runs","volume-title":"European Symposium on Algorithms (ESA), volume 112 of LIPIcs","author":"Munro"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)E0160-Z"},{"key":"ref35","first-page":"287","article-title":"PersiSort: a new perspective on adaptive sorting based on persistence","volume-title":"Canadian Conference on Computational Geometry (CCCG)","author":"Refsgaard Schou"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03816-7_59"}],"event":{"name":"2026 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","location":"New Orleans, LA, USA","start":{"date-parts":[[2026,5,25]]},"end":{"date-parts":[[2026,5,29]]}},"container-title":["2026 IEEE International Parallel and Distributed Processing Symposium (IPDPS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11575315\/11575316\/11575424.pdf?arnumber=11575424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:14:51Z","timestamp":1782922491000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11575424\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,25]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/ipdps65963.2026.00029","relation":{},"subject":[],"published":{"date-parts":[[2026,5,25]]}}}