Author:
Bose Prosenjit,Kranakis Evangelos,Morin Pat,Tang Yihui
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Alon, N., Schieber, B.: Optimal preprocessing for answering on-line product queries. Technical Report 71/87, Tel-Aviv University (1987)
2. Arasu, A., Manku, G.S.: Approximate counts and quantiles over sliding windows. In: Proceedings of the ACM Symposium on Principles of Database Systems, PODS (2004)
3. Battiato, S., Cantone, D., Catalano, D., Cincotti, G., Hofri, M.: An efficient algorithm for the approximate median selection problem. In: Proceedings of the Fourth Italian Conference (2000)
4. Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proceedings of the 15th annual ACM Symposium on the Theory of Computing, pp. 80–86 (1983)
5. Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. Journal of Computer and System Sciences 7(4), 448–461 (1973)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献