How does algebra help to solve problems from the theory of algorithms (an example). - Yuri Leonidovich Ershov (Algorithms in Modern Mathematics and Computer Science, 1979)

Semantic Programming. - Sergei S. Goncharov; Yuri Leonidovich Ershov; Dmitri Ivanovich Sviridenko (IFIP Congress, 1986)

Semantic Foundations of Programming. - Yuri Leonidovich Ershov; Sergei S. Goncharov; Dmitri Ivanovich Sviridenko (FCT, 1987)

RRC-Fields with Small Absolute Galois Groups. - Yuri Leonidovich Ershov (Ann. Pure Appl. Log., 1989)

Theory of Domains and Nearby (Invited Paper). - Yuri Leonidovich Ershov (Formal Methods in Programming and Their Applications, 1993)

The Bounded-Complete Hull of an Alpha-Space. - Yuri Leonidovich Ershov (Theor. Comput. Sci., 1997)

Sigma predicates of finite types. - Yuri Leonidovich Ershov (Workshop on Domains, 1998)

Theory of Numberings. - Yuri Leonidovich Ershov (Handbook of Computability Theory, 1999)

On d-Spaces. - Yuri Leonidovich Ershov (Theor. Comput. Sci., 1999)

Mathtree - Tree Catalog of Mathematical Resources in the Internet. - Yuri Leonidovich Ershov; V. Filippov; O. Klimenko; O. Trofimov (Automation, Control, and Information Technology, 2005)

On the classification of (effective) φ-spaces. - Yuri Leonidovich Ershov (Ann. Pure Appl. Log., 2009)

Preface. - Yuri Leonidovich Ershov; Klaus Keimel; Ulrich Kohlenbach; Andrei S. Morozov (Ann. Pure Appl. Log., 2009)