Author:
Dodis Yevgeniy,Khanna Sanjeev
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. M. Ajtai. A lower bound for finding predecessors in Yao’s cell probe model. In Combinatorica, 8:235–247, 1988.
2. A. Borodin, R. Ostrovsky, Y. Rabani. Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems. In Proc. of STOC, 1999.
3. A. Chakrabarti, B. Chazelle, B. Gum, A. Lvov. A good neighbor is hard to find. In Proc. of STOC, 1999.
4. P. Elias, R.A. Flower. The complexity of some simple retrieval problems. In J. ACM, 22:367–379, 1975.
5. A. Hajnal, W. Maass and G. Turan. On the communication complexity of graph properties. In Proc. of STOC, pp. 186–191, 1988.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献