1. Lecture Notes in Computer Science;W Aiello,1998
2. Ajtai, M.: A non-linear time lower bound for boolean branching programs. Theory Comput. 1(8), 149–176 (2005)
3. Alwen, J., Blocki, J., Pietrzak, K.: Depth-robust graphs and their cumulative memory complexity. In: Coron and Nielsen [18], pp. 3–32 (2017)
4. Alwen, J., Chen, B., Pietrzak, K., Reyzin, L., Tessaro, S.: Scrypt is maximally memory-hard. In: Coron and Nielsen [18], pp. 33–62 (2017)
5. Lecture Notes in Computer Science;J Alwen,2009