1. Alekhnovich, M.: More on average case vs approximation complexity. In: Proc. of 44th FOCS, pp. 298–307 (2003)
2. Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography by cellular automata or how fast can complexity emerge in nature? In: ICS, pp. 1–19 (2010)
3. Applebaum, B., Moses, Y.: Locally computable UOWHF with linear shrinkage. In: Advances in Cryptology: Proc. of EUROCRYPT ’13 (2013)
4. Bennett, C., Grinstein, C.: Role of irreversibility in stabilizing complex and nonenergodic behavior in locally interacting discrete systems. Phys. Rev. Lett. 55, 657–660 (1985)
5. Berlekamp, E., Conway, J., Guy, R.: Winning Ways for Your Mathematical Plays. Academic Press, New York (1983)