1. Alwen, J., de Rezende, S.F., Nordström, J., Vinyals, M.: Cumulative space in black-white pebbling and resolution. In: Innovations in Theoretical Computer Science, ITCS 2017, Berkeley, CA, USA, pp. 9–11, January 2017
2. Alwen, J., Serbinenko, V.: High parallel complexity graphs and memory-hard functions. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14–17, pp. 595–603 (2015). http://doi.acm.org/10.1145/2746539.2746622
3. Bennett, C.H.: Time/space trade-offs for reversible computation. SIAM J. Comput. 18(4), 766–776 (1989). http://dx.doi.org/10.1137/0218053
4. Chan, S.M., Lauria, M., Nordström, J., Vinyals, M.: Hardness of approximation in PSPACE and separation results for pebble games. In IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, October 17–20, 2015, pp. 466–485 (2015). http://dx.doi.org/10.1109/FOCS.2015.36
5. Cook, S., Sethi, R.: Storage requirements for deterministic / polynomial time recognizable languages. In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, STOC 1974, pp. 33–39. ACM, New York (1974). http://doi.acm.org/10.1145/800119.803882