Can We Overcome the n log n Barrier for Oblivious Sorting?
From MaRDI portal
Publication:5236337
DOI10.1137/1.9781611975482.148zbMath1432.68111OpenAlexW2949162350MaRDI QIDQ5236337
Tiancheng Xie, Wei-Kai Lin, Elaine Shi
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
Related Items (6)
A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Sorting Short Keys in Circuits of Size ${o(n \log n)}$ ⋮ A theory of composition for differential obliviousness ⋮ Klee's measure problem made oblivious ⋮ Unnamed Item ⋮ OptORAMa: optimal oblivious RAM
This page was built for publication: Can We Overcome the n log n Barrier for Oblivious Sorting?
