Algorithms in Modern Mathematics and Computer Science 1979: Urgench, Uzbek SSR

Andrei P. Ershov, Donald E. Knuth (Eds.): Algorithms in Modern Mathematics and Computer Science, Proceedings, Urgench, Uzbek SSR, September 16-22, 1979. Lecture Notes in Computer Science 122 Springer 1981, ISBN 3-540-11157-3 BibTeX

@proceedings{DBLP:conf/ershov/1979,
  editor    = {Andrei P. Ershov and
               Donald E. Knuth},
  title     = {Algorithms in Modern Mathematics and Computer Science, Proceedings,
               Urgench, Uzbek SSR, September 16-22, 1979},
  booktitle = {Algorithms in Modern Mathematics and Computer Science},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {122},
  year      = {1981},
  isbn      = {3-540-11157-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Heinz Zemanek: DIXIT Algorizmi - His Background, his Personality, his Work, and his Influence. 1-81 BibTeX
Donald E. Knuth: Algorithms in modern mathematics and computer science. 82-99 BibTeX
Vladimir A. Uspensky, Alexei L. Semenov: What are the gains of the theory of algorithms: Basis developments connected with the concept of algorithm and with its application in mathematics. 100-234 BibTeX
J. M. Barzdin: On inductive synthesis of programs. 235-254 BibTeX
Yu. I. Manin: Expanding constructive universes. 255-260 BibTeX
N. N. Nepeivoda: The logical approach to programming. 261-289 BibTeX
Enn Tyugu: The structural synthesis of programs. 290-303 BibTeX
Alexander A. Letichevsky: On finding invariant relations of programs. 304-314 BibTeX
G. M. Adelson-Velskiy, A. O. Slisenko: What can we do with problems of exhaustive search?. 315-342 BibTeX
A. Alder, Volker Strassen: The algorithmic complexity of linear algebras. 343-354 BibTeX
Stephen Cole Kleene: Algorithms in various contexts. 355-360 BibTeX
N. A. Shanin: Role of a notion of algorithms in the arithmetic language semantics. 361-389 BibTeX
Gregory S. Tseytin: From logicism of proceduralsm (an autobiographical account). 390-396 BibTeX
Andrei P. Ershov: Abstract computability on algebraic structures. 397-420 BibTeX
Friedrich L. Bauer: Algorithms and algebra. 421-429 BibTeX
V. M. Glushkov: On formal transformations of algorithms. 430-440 BibTeX
Yuri Matijasevic: What should we do having proved a decision problem to be unsolvable? 441-448 BibTeX
Anatoly Buda: On the experience of riding two horses in programming. 444-448 BibTeX
A. V. Anisimov: Church-Rosser transformers and decidable properties of tree processing. 449-457 BibTeX

Summaries of oral presentations

Adriaan van Wijngaarden: Languageless programming. 459-459 BibTeX
Antoni Kreczmar: Some historical remarks on algorithmic logic. 460-460 BibTeX
Antoni W. Mazurkiewicz: Concurrent algorithms schemata. 460-461 BibTeX
Boris A. Trakhtenbrot: Some reflections on the connection between computer science and the theory of algorithms. 461-462 BibTeX
Julia V. Kapitonova: On design and implementation of algorithms. 462 BibTeX
Yuri Leonidovich Ershov: How does algebra help to solve problems from the theory of algorithms (an example). 462-463 BibTeX
Mike Paterson: The linear postman: a message-forwarding algorithm using sequential storage. 463 BibTeX
N. M. Nagorny: Algorithm as a basis for Formulating constructive mathematical notions. 463-464 BibTeX
S. Kh. Sirazhdinov: On Euler numbers and Euler polynomial roots. 464-465 BibTeX
G. N. Salikhov: On an Algorithm for finding weights and nodes of cubic formulae. 465 BibTeX