Yuri Leonidovich Ershov

According to our database, Yuri Leonidovich Ershov authored at least 12 papers between 1979 and 2009.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2009

Preface.

Yuri Leonidovich Ershov, Klaus Keimel, Ulrich Kohlenbach, Andrei S. Morozov

Ann. Pure Appl. Log., 2009

On the classification of (effective) φ-spaces.

Yuri Leonidovich Ershov

Ann. Pure Appl. Log., 2009

2005

Mathtree - Tree Catalog of Mathematical Resources in the Internet.

Yuri Leonidovich Ershov, V. Filippov, O. Klimenko, O. Trofimov

Proceedings of the Second IASTED International Multi-Conference on Automation, 2005

1999

On d-Spaces.

Yuri Leonidovich Ershov

Theor. Comput. Sci., 1999

Theory of Numberings.

Yuri Leonidovich Ershov

Proceedings of the Handbook of Computability Theory, 1999

1998

Sigma predicates of finite types.

Yuri Leonidovich Ershov

Proceedings of the Workshop on Domains IV 1998, 1998

1997

The Bounded-Complete Hull of an Alpha-Space.

Yuri Leonidovich Ershov

Theor. Comput. Sci., 1997

1993

Theory of Domains and Nearby (Invited Paper).

Yuri Leonidovich Ershov

Proceedings of the Formal Methods in Programming and Their Applications, International Conference, Akademgorodok, Novosibirsk, Russia, June 28, 1993

1989

RRC-Fields with Small Absolute Galois Groups.

Yuri Leonidovich Ershov

Ann. Pure Appl. Log., 1989

1987

Semantic Foundations of Programming.

Yuri Leonidovich Ershov, Sergei S. Goncharov, Dmitri Ivanovich Sviridenko

Proceedings of the Fundamentals of Computation Theory, 1987

1986

Semantic Programming.

Sergei S. Goncharov, Yuri Leonidovich Ershov, Dmitri Ivanovich Sviridenko

Proceedings of the Information Processing 86, 1986

1979

How does algebra help to solve problems from the theory of algorithms (an example).

Yuri Leonidovich Ershov

Proceedings of the Algorithms in Modern Mathematics and Computer Science, 1979