Can we overcome the n n barrier for oblivious sorting?

DOI10.1137/1.9781611975482.148MaRDI QIDQ5236337zbMATH OpenOpenAlexFDO

Authors Wei-Kai Lin, Elaine Shi, Tiancheng Xie

Publication date 15 October 2019

Published in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975482.148

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• When can we sort in o(n n) time?
• Randomized Shellsort, a simple oblivious sorting algorithm
• Cache-oblivious and data-oblivious sorting and applications
• Zig-zag sort
• scientific article; zbMATH DE number 2119639

Cited in

(8)

• OptORAMa: optimal oblivious RAM
• A logarithmic lower bound for oblivious RAM (for all Parameters)
• A theory of composition for differential obliviousness
• Can a randomized binary search have an \(O(1)\) complexity at least in practice?
• When can we sort in o(n n) time?
• scientific article; zbMATH DE number 7650132 (Why is no real title available?)
• Klee's measure problem made oblivious
• Sorting Short Keys in Circuits of Size ${o(n \log n)}$

This page was built for publication: Can we overcome the \(n\log n\) barrier for oblivious sorting?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236337)