1. A generalization of resource-bounded measure, with application to the BPP vs;Harry Buhrman;EXP problem. Electron. Colloquium Comput. Complex,1998
2. Why computational complexity requires stricter martingales;John M Hitchcock;Theory Comput. Syst,2006
3. On tables of random numbers (reprinted from "sankhya: The indian journal of statistics;Andrei N Kolmogorov;Theor. Comput. Sci,1963
4. An Introduction to Kolmogorov Complexity and Its Applications, 4th Edition;Ming Li;Texts in Computer Science,2019
5. A new interpretation of the von mises' concept of random sequence;Donald Loveland;Zeitschrift fur mathematische Logik und Grundlagen der Mathematik,1966