Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference44 articles.
1. D. Aharonov, A. Kitaev, N. Nisan, Quantum circuits with mixed states, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 20–30
2. A lower bound for finding predecessors in Yao's cell probe model;Ajtai;Combinatorica,1988
3. A. Andersson, Faster deterministic sorting and searching in linear space, in: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 135–141
4. Optimal bounds for the predecessor problem and related problems;Beame;J. Comput. System Sci.,2002
5. Are bitvectors optimal?;Buhrman;SIAM J. Comput.,2002
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Predecessor on the Ultra-Wide Word RAM;Algorithmica;2024-01-10
2. Optimal Approximate Distance Oracle for Planar Graphs;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
3. Predecessor Search;ACM Computing Surveys;2020-10-15
4. Pointer chasing via triangular discrimination;Combinatorics, Probability and Computing;2020-05-15
5. Combinatorial Auctions Do Need Modest Interaction;ACM Transactions on Economics and Computation;2020-04-21