Downey, Rod and Hirschfeldt, Denis R., Algorithmic randomness and complexity, Monographs in Computer Science, Springer-Verlag, to appear, preliminary version www.mcs.vuw.ac.nz/~downey.
Downey, Rod, Hirschfeldt, Denis R., Nies, André, and Terwijn, Sebastiaan A., Calibrating randomness, The Bulletin of Symbolic Logic, vol. 12 (2006), no. 3, pp. 411–491.
Greenberg, Noam and Montalbán, Antonio, Embedding and coding below a l-generic degree, Notre Dame Journal of Formal Logic, vol. 44 (2003), no. 4, pp. 200–216.
Haught, Christine Ann. The degrees below a l-generic degree < 0′, this Journal, vol. 51 (1986). no. 3. pp. 770–777.
Jockusch, Carl G. Jr., Degrees of generic sets, Recursion theory: its generalisation and applications. London Mathematical Society Lecture Note Series, vol. 45, Cambridge University Press, Cambridge, 1980, pp. 110–139.
Jockusch, Carl G. Jr. and Posner, David B., Double jumps of minimal degrees, this Journal, vol. 43 (1978). no. 4, pp. 715–724.
Kurtz, Stewart. Randomness and genericity in the degrees of unsolvability, Ph.D. thesis, University of Illinois at Urbana-Champaign, 1981.
Martin-Löf, Per, The definition of random sequences, Information and Control, vol. 9 (1966), pp. 602–619.
Miller, Joseph S. and Yu, Liang, On initial segment complexity and degrees of randomness, Transactions of the American Mathematical Society, to appear.
Nies, André, Computability and randomness, Monograph in preparation.
Lambalgen, Michiel Van, Random sequences, Ph.D. thesis, University of Amsterdam, 1987.
Yu, Liang, Lowness for genericity. Archive for Mathematical Logic, to appear.