-
Tyll Krüger, Serge Troubetzkoy, “Complexity, randomness, discretization: Some remarks on a program of J. Ford”, Physica D: Nonlinear Phenomena, 105:1-3 (1997), 97
-
Ming Li, Paul Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, 1997, 189
-
Yongge Wang, Lecture Notes in Computer Science, 1269, Randomization and Approximation Techniques in Computer Science, 1997, 213
-
Ming Li, Paul Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, 1997, 93
-
Jack H. Lutz, Complexity Theory Retrospective II, 1997, 225
-
V. A. Uspensky, A. Shen, “Relations between varieties of kolmogorov complexities”, Math Systems Theory, 29:3 (1996), 271
-
Klaus Ambos-Spies, Elvira Mayordomo, Yongge Wang, Xizhong Zheng, Lecture Notes in Computer Science, 1046, STACS 96, 1996, 61
-
Yongge Wang, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory), 1996, 180
-
Jack H. Lutz, Elvira Mayordomo, “Measure, Stochasticity, and the Density of Hard Languages”, SIAM J Comput, 23:4 (1994), 762
-
S.M. Kautz, P.B. Miltersen, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory, 1994, 162
-
Homer S. White, “Algorithmic complexity of points in dynamical systems”, Ergod Th Dynam Sys, 13:4 (1993)
-
Jack H. Lutz, Elvira Mayordomo, Lecture Notes in Computer Science, 665, STACS 93, 1993, 38
-
J.H. Lutz, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993, 158
-
Jack H. Lutz, “Almost everywhere high nonuniform complexity”, Journal of Computer and System Sciences, 44:2 (1992), 220