Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics
Selection; sorting; multiselection; online algorithms; deferred data structures; dynamic; external memory
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
Near-Optimal Online Multiselection In Internal And External Memory, Jonathan P. Sorenson, Jérémy Barbay, Ankur Gupta, S. Srinivasa Rao
Near-Optimal Online Multiselection In Internal And External Memory, Jonathan P. Sorenson, Jérémy Barbay, Ankur Gupta, S. Srinivasa Rao
Scholarship and Professional Work - LAS
We introduce an online version of the multiselection problem, in which q selection queries are requested on an unsorted array of n elements. We provide the first online algorithm that is 1-competitive with online algorithm proposed by Kaligosi et al.[ICALP 2005] in terms of comparison complexity. Our algorithm also supports online search queries efficiently.
We then extend our algorithm to the dynamic setting, while retaining online functionality, by supporting arbitrary insertions and deletions on the array. Assuming that the insertion of an element is immediately preceded by a search for that element, we show that our dynamic online algorithm performs …