Can We Overcome the n log n Barrier for Oblivious Sorting?

Wei-Kai Lin, Elaine Shi, Tiancheng Xie. Can We Overcome the n log n Barrier for Oblivious Sorting?. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. pages 2419-2438, SIAM, 2019. [doi]

Abstract

Abstract is missing.