Author:
Chan Ho-Leung,Lam Tak-Wah,Lee Lap-Kei,Pan Jiangwei,Ting Hing-Fung,Zhang Qin
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Ablayev, F.: Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science 157(2), 139–159 (1996)
2. Ajtai, M., Jayram, T.S., Kumar, R., Sivakumar, D.: Approximate counting of inversions in a data stream. In: Proc. STOC, pp. 370–379 (2002)
3. Ben-Moshe, S., Kanza, Y., Fischer, E., Matsliah, A., Fischer, M., Staelin, C.: Detecting and exploiting near-sortedness for efficient relational query evaluation. In: Proc. ICDT, pp. 256–267 (2011)
4. Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Computer Networks 30(1-7), 107–117 (1998)
5. Chakrabarti, A.: A note on randomized streaming space bounds for the longest increasing subsequence problem. In: ECCC, p. 100 (2010)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献