Cited By
View all- Goswami MJacob RPagh RSuciu DTao YWei Z(2020)On the I/O Complexity of the k-Nearest Neighbors ProblemProceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3375395.3387649(205-212)Online publication date: 14-Jun-2020
- Lin WShi EXie TChan T(2019)Can we overcome the n log n barrier for oblivious sorting?Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310583(2419-2438)Online publication date: 6-Jan-2019
- Chan TGuo YLin WShi ECzumaj A(2018)Cache-oblivious and data-oblivious sorting and applicationsProceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3174304.3175448(2201-2220)Online publication date: 7-Jan-2018
- Show More Cited By