Density results in the Delta20 e-degrees. - Marat M. Arslanov; Iskander Sh. Kalimullin; Andrea Sorbi (Arch. Math. Log., 2001)

Splitting Properties of n-C.E. Enumeration Degrees. - Iskander Sh. Kalimullin (J. Symb. Log., 2002)

Definability of the jump operator in the Enumeration Degrees. - Iskander Sh. Kalimullin (J. Math. Log., 2003)

On the Problems of Definability in the Enumeration Degrees. - Iskander Sh. Kalimullin (CiE, 2005)

Some Notes on Degree Spectra of the Structures. - Iskander Sh. Kalimullin (CiE, 2007)

Elementary differences between the (2p)-c. e. and the (2p+1)-c. e. enumeration degrees. - Iskander Sh. Kalimullin (J. Symb. Log., 2007)

Total Degrees and Nonsplitting Properties of Enumeration Degrees. - Marat M. Arslanov; S. Barry Cooper; Iskander Sh. Kalimullin; Mariya Ivanova Soskova (TAMC, 2008)

Spectra of Algebraic Fields and Subfields. - Andrey N. Frolov; Iskander Sh. Kalimullin; Russell G. Miller (CiE, 2009)

Enumeration Degrees and Enumerability of Familes. - Iskander Sh. Kalimullin (J. Log. Comput., 2009)

Degrees of categoricity of computable structures. - Ekaterina B. Fokina; Iskander Sh. Kalimullin; Russell G. Miller (Arch. Math. Log., 2010)

On Downey's conjecture. - Marat M. Arslanov; Iskander Sh. Kalimullin; Steffen Lempp (J. Symb. Log., 2010)

Degree spectra and immunity properties. - Barbara F. Csima; Iskander Sh. Kalimullin (Math. Log. Q., 2010)

Splitting and nonsplitting in the Σ20 enumeration degrees. - Marat M. Arslanov; S. Barry Cooper; Iskander Sh. Kalimullin; Mariya Ivanova Soskova (Theor. Comput. Sci., 2011)

Turing and enumeration jumps in the Ershov hierarchy. - Marat Kh. Faizrahmanov; Iskander Sh. Kalimullin (J. Log. Comput., 2012)

Spectra of highn and non-lown degrees. - Andrey N. Frolov; Iskander Sh. Kalimullin; Valentina S. Harizanov; Oleg V. Kudinov; Russell G. Miller (J. Log. Comput., 2012)

Algorithmic reducibilities of algebraic structures. - Iskander Sh. Kalimullin (J. Log. Comput., 2012)

Limitwise monotonic sets of reals. - Marat Kh. Faizrahmanov; Iskander Sh. Kalimullin (Math. Log. Q., 2015)

The complements of Lower cones of Degrees and the degree spectra of Structures. - Uri Andrews; Mingzhong Cai; Iskander Sh. Kalimullin; Steffen Lempp; Joseph S. Miller; Antonio Montalbán (J. Symb. Log., 2016)

The Enumeration Spectrum Hierarchy of α-families and Lowα Degrees. - Marat Kh. Faizrahmanov; Iskander Sh. Kalimullin (J. Univers. Comput. Sci., 2016)

The enumeration spectrum hierarchy of n-families. - Marat Kh. Faizrahmanov; Iskander Sh. Kalimullin (Math. Log. Q., 2016)

Categoricity Spectra for Rigid Structures. - Ekaterina B. Fokina; Andrey N. Frolov; Iskander Sh. Kalimullin (Notre Dame J. Formal Log., 2016)

A Survey of Results on the d-c.e. and n-c.e. Degrees. - Marat M. Arslanov; Iskander Sh. Kalimullin (Computability and Complexity, 2017)

The Least ∑-jump Inversion Theorem for n-families. - Marat Kh. Faizrahmanov; Iskander Sh. Kalimullin; Antonio Montalbán; Vadim Puzarenko (J. Univers. Comput. Sci., 2017)

Algebraic structures computable without delay. - Iskander Sh. Kalimullin; Alexander G. Melnikov; Keng Meng Ng (Theor. Comput. Sci., 2017)

Degrees of Categoricity and spectral Dimension. - Nikolay Bazhenov 001; Iskander Sh. Kalimullin; Mars M. Yamaleev (J. Symb. Log., 2018)

Degree Spectra for Transcendence in Fields. - Iskander Sh. Kalimullin; Russell G. Miller; Hans Schoutens (CiE, 2019)

Foundations of Online Structure Theory. - Nikolay Bazhenov 001; Rod Downey; Iskander Sh. Kalimullin; Alexander G. Melnikov (Bull. Symb. Log., 2019)

Automatic and Polynomial-Time Algebraic Structures. - Nikolay Bazhenov 001; Matthew Harrison-Trainor; Iskander Sh. Kalimullin; Alexander G. Melnikov; Keng Meng Ng (J. Symb. Log., 2019)

Jump inversions of algebraic structures and Σ-definability. - Marat Kh. Faizrahmanov; Asher M. Kach; Iskander Sh. Kalimullin; Antonio Montalbán; Vadim Puzarenko (Math. Log. Q., 2019)

Graphs are not universal for online computability. - Rodney G. Downey; Matthew Harrison-Trainor; Iskander Sh. Kalimullin; Alexander G. Melnikov; Daniel Turetsky (J. Comput. Syst. Sci., 2020)

Online presentations of finitely generated structures. - Nikolay Bazhenov 001; Iskander Sh. Kalimullin; Alexander G. Melnikov; Keng Meng Ng (Theor. Comput. Sci., 2020)

Punctual definability on structures. - Iskander Sh. Kalimullin; Alexander G. Melnikov; Antonio Montalbán (Ann. Pure Appl. Log., 2021)

Preface of the Special Issue for the Oberwolfach Workshop on Computability Theory 2021. - Vasco Brattka; Noam Greenberg; Iskander Sh. Kalimullin; Mariya Ivanova Soskova (Comput., 2022)

A Structural Dichotomy in the Enumeration Degrees. - Hristo Aleksndrov Ganchev; Iskander Sh. Kalimullin; Joseph S. Miller; Mariya Ivanova Soskova (J. Symb. Log., 2022)

Pa Relative to an Enumeration Oracle. - Jun Le Goh; Iskander Sh. Kalimullin; Joseph S. Miller; Mariya Ivanova Soskova (J. Symb. Log., 2023)

On cupping and Ahmad Pairs. - Iskander Sh. Kalimullin; Steffen Lempp; Keng Meng Ng; Mars M. Yamaleev (J. Symb. Log., 2024)