Academician Andrei Ershov and Graphs in Programming

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

Academician Andrei Petrovich Ershov (19 April 1931 - 8 December 1988) was one of the Soviet pioneers in the field of theoretical and systems programming, the founder of the Siberian School of Programming. His significant contributions to establishing informatics as a new branch of science and a new phenomenon of the social life are widely recognized both in Russia and abroad. His pioneering works on graph-theory methods in programming are somewhat less well known but equally important and highly regarded by the experts. A.P. Ershov called graphs to be the basic tool for the programmer, and said that graphs possess a vast, inexhaustible power commensurate with the scale of programming tasks. He made a fundamental contribution to graph theory particularly in the area of programming. In this paper, A.P. Ershov's works on graph methods in programming are considered.

Original languageEnglish
Title of host publication2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages73-77
Number of pages5
ISBN (Electronic)9781728129860
DOIs
Publication statusPublished - Aug 2019
Event15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019 - Novosibirsk, Russian Federation
Duration: 26 Aug 201930 Aug 2019

Publication series

Name2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019

Conference

Conference15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019
Country/TerritoryRussian Federation
CityNovosibirsk
Period26.08.201930.08.2019

Keywords

  • academician Andrei Ershov
  • Alpha system
  • graph methods in programming
  • optimizing compiler
  • program scheme

Fingerprint

Dive into the research topics of 'Academician Andrei Ershov and Graphs in Programming'. Together they form a unique fingerprint.

Cite this