1. M. Ajtai, A non-linear time lower bound for boolean branching programs, in: Proc. of the 40th FOCS, 1999, pp. 60–70
2. Determinism versus nondeterminism for linear time RAMs with memory restrictions;Ajtai;J. Comput. System Sci.,2002
3. Z. Bar-Yossef, L. Trevisan, O. Reingold, R. Shaltiel, Streaming computation of combinatorial objects, in: Proc. of 17th CCC, 2002, pp. 165–174
4. Endcoding complexity versus minimum distance;Bazzi;IEEE Trans. Inform. Theory,2005
5. P. Beame, A general sequential time–space tradeoff for finding unique elements, in: Proc. of 21st STOC, 1989, pp. 197–203