Index Sets of Computable Structures with Decidable Theories. - Ekaterina B. Fokina (CiE, 2007)

Index sets for classes of high rank structures. - Wesley Calvert; Ekaterina B. Fokina; Sergei S. Goncharov; Julia F. Knight; Oleg V. Kudinov; Andrei S. Morozov; Vadim Puzarenko (J. Symb. Log., 2007)

Equivalence Relations on Classes of Computable Structures. - Ekaterina B. Fokina; Sy-David Friedman (CiE, 2009)

Index sets for some classes of structures. - Ekaterina B. Fokina (Ann. Pure Appl. Log., 2009)

Intrinsic bounds on complexity and definability at limit levels. - John Chisholm; Ekaterina B. Fokina; Sergei S. Goncharov; Valentina S. Harizanov; Julia F. Knight; Sara Quinn (J. Symb. Log., 2009)

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

The effective theory of Borel equivalence relations. - Ekaterina B. Fokina; Sy-David Friedman; Asger Törnquist (Ann. Pure Appl. Log., 2010)

Classes of Ulm type and coding rank-homogeneous trees in other structures. - Ekaterina B. Fokina; Julia F. Knight; Alexander G. Melnikov; Sara Quinn; C. Safranski (J. Symb. Log., 2011)

Equivalence Relations That Are Σ03 Complete for Computable Reducibility - (Extended Abstract). - Ekaterina B. Fokina; Sy-David Friedman; André Nies (WoLLIC, 2012)

Isomorphism relations on computable structures. - Ekaterina B. Fokina; Sy-David Friedman; Valentina S. Harizanov; Julia F. Knight; Charles F. D. McCoy; Antonio Montalbán (J. Symb. Log., 2012)

On Σ11 equivalence relations over the natural numbers. - Ekaterina B. Fokina; Sy-David Friedman (Math. Log. Q., 2012)

Classes of structures with universe a subset of ω1. - Ekaterina B. Fokina; Sy-David Friedman; Julia F. Knight; Russell G. Miller (J. Log. Comput., 2013)

Computable model theory. - Ekaterina B. Fokina; Valentina S. Harizanov; Alexander G. Melnikov (Turing's Legacy, 2014)

Linear Orders Realized by C.E. Equivalence Relations. - Ekaterina B. Fokina; Bakhadyr Khoussainov; Pavel Semukhin; Daniel Turetsky (J. Symb. Log., 2016)

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

Preface. - Ekaterina B. Fokina (Math. Struct. Comput. Sci., 2018)

Limit Learning Equivalence Structures. - Ekaterina B. Fokina; Timo Kötzing; Luca San Mauro (ALT, 2019)

Degrees of bi-embeddable categoricity of equivalence structures. - Nikolay Bazhenov 001; Ekaterina B. Fokina; Dino Rossegger; Luca San Mauro (Arch. Math. Log., 2019)

Computability-theoretic categoricity and Scott families. - Ekaterina B. Fokina; Valentina S. Harizanov; Daniel Turetsky (Ann. Pure Appl. Log., 2019)

Measuring the complexity of reductions between equivalence relations. - Ekaterina B. Fokina; Dino Rossegger; Luca San Mauro (Comput., 2019)

Bi-embeddability spectra and bases of spectra. - Ekaterina B. Fokina; Dino Rossegger; Luca San Mauro (Math. Log. Q., 2019)

Learning families of algebraic structures from informant. - Nikolay Bazhenov 001; Ekaterina B. Fokina; Luca San Mauro (Inf. Comput., 2020)

Degrees of bi-embeddable categoricity. - Nikolay Bazhenov 001; Ekaterina B. Fokina; Dino Rossegger; Luca San Mauro (Comput., 2021)

Learning Families of Algebraic Structures from Text. - Nikolay Bazhenov 001; Ekaterina B. Fokina; Dino Rossegger; Alexandra A. Soskova; Stefan V. Vatev (CiE, 2024)

Computable Structure Theory of Partial Combinatory Algebras. - Ekaterina B. Fokina; Sebastiaan A. Terwijn (CiE, 2024)

A Lopez-Escobar Theorem for continuous Domains. - Nikolay Bazhenov 001; Ekaterina B. Fokina; Dino Rossegger; Alexandra A. Soskova; Stefan V. Vatev (J. Symb. Log., 2025)