Classes with Pairwise Equivalent Enumerations. - Sergei S. Goncharov; Serikzhan A. Badaev (LFCS, 1994)

Computable Numberings. - Serikzhan A. Badaev (LPAR, 2003)

A note on partial numberings. - Serikzhan A. Badaev; Dieter Spreen (Math. Log. Q., 2005)

On Rogers Semilattices. - Serikzhan A. Badaev (TAMC, 2006)

On a Question of Frank Stephan. - Klaus Ambos-Spies; Serikzhan A. Badaev; Sergey Goncharov 002 (TAMC, 2008)

A decomposition of the Rogers semilattice of a family of d.c.e. sets. - Serikzhan A. Badaev; Steffen Lempp (J. Symb. Log., 2009)

Inductive inference and computable numberings. - Klaus Ambos-Spies; Serikzhan A. Badaev; Sergey S. Goncharov (Theor. Comput. Sci., 2011)

Rogers semilattices of families of two embedded sets in the Ershov hierarchy. - Serikzhan A. Badaev; Manat Mustafa; Andrea Sorbi (Math. Log. Q., 2012)

Friedberg numberings in the Ershov hierarchy. - Serikzhan A. Badaev; Manat Mustafa; Andrea Sorbi (Arch. Math. Log., 2015)

Weakly precomplete computably enumerable equivalence relations. - Serikzhan A. Badaev; Andrea Sorbi (Math. Log. Q., 2016)

A Survey on Universal Computably Enumerable Equivalence Relations. - Uri Andrews; Serikzhan A. Badaev; Andrea Sorbi (Computability and Complexity, 2017)

On Isomorphism Classes of computably Enumerable Equivalence Relations. - Uri Andrews; Serikzhan A. Badaev (J. Symb. Log., 2020)

On diagonal functions for equivalence relations. - Serikzhan A. Badaev; Nikolay A. Bazhenov; Birzhan S. Kalmurzayev; Manat Mustafa (Arch. Math. Log., 2024)

A non-computable c.e. closed subset of [0,1]. - Serikzhan A. Badaev; Nikolay Bazhenov 001; Sergey Goncharov 002; Birzhan S. Kalmurzayev; Alexander G. Melnikov (J. Log. Comput., 2025)