Paper 2018/227
Can We Overcome the Barrier for Oblivious Sorting?
Wei-Kai Lin, Elaine Shi, and Tiancheng Xie
Abstract
It is well-known that non-comparison-based techniques
can allow us to sort
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Minor revision. SODA 2019
- Keywords
- complexity theoryfoundationsoblivious algorithms
- Contact author(s)
-
wklin @ cs cornell edu
elaine @ cs cornell edu
niconiconi @ sjtu edu cn - History
- 2018-10-29: last of 5 revisions
- 2018-03-01: received
- See all versions
- Short URL
- https://ia.cr/2018/227
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/227, author = {Wei-Kai Lin and Elaine Shi and Tiancheng Xie}, title = {Can We Overcome the $n \log n$ Barrier for Oblivious Sorting?}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/227}, year = {2018}, url = {https://eprint.iacr.org/2018/227} }