1. Andrews, U., Cai, M., Diamondstone, D., Jockusch, C., Lempp, S.: Asymptotic density, computable traceability, and 1-randomness. Fundam. Math. 234, 41–53 (2016)
2. Astor, E.P., Hirschfeldt, D.R., Jockusch Jr., C.G.: Dense computability, upper cones, and minimal pairs, in preparation
3. Bienvenu, L., Greenberg, N., Kučera, A., Nies, A., Turetsky, D.: Coherent randomness tests and computing the $$K$$ -trivial sets. J. Eur. Math. Soc. 18, 773–812 (2016)
4. Bonnet, R.: Stratifications et extension des genres de chaînes dénombrables. C. R. Acad. Sci. Ser. A-B 269, A880–A882 (1969)
5. Brattka, V.: Maintainer, Bibliography on Weihrauch complexity, Computability and Complexity in Analysis Network. http://cca-net.de/publications/weibib.php