Author:
Beame Paul,Liew Vincent,Pǎtraşcu Mihai
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Ajtai, M.: A non-linear time lower bound for boolean branching programs. In: Proceedings 40th IEEE FOCS Conference, pp. 60–70. New York, NY (1999)
2. Ajtai, M.: Determinism versus non-determinism for linear time RAMs with memory restrictions. Journal of Computer and System Sciences 65(1), 2–37 (2002)
3. Alon, N., Maass, W.: Meanders and their applications in lower bounds arguments. Journal of Computer and System Sciences 37, 118–129 (1988)
4. Beame, P.: A general sequential time-space tradeoff for finding unique elements. SIAM Journal on Computing 20(2), 270–277 (1991)
5. Beame, P., Clifford, R., Machmouchi, W.: Element distinctness, frequency moments, and sliding windows. In: Proceedings 54th IEEE FOCS Conference, pp. 290–299. Berkeley, CA (2013)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献