Heinz Zemanek DIXIT Algorizmi - His Background, his Personality, his Work, and his Influence. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:1-81 [Conf]

Donald E. Knuth Algorithms in modern mathematics and computer science. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:82-99 [Conf]

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. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:100-234 [Conf]

J. M. Barzdin On inductive synthesis of programs. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:235-254 [Conf]

Yu. I. Manin Expanding constructive universes. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:255-260 [Conf]

N. N. Nepeivoda The logical approach to programming. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:261-289 [Conf]

Enn Tyugu The structural synthesis of programs. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:290-303 [Conf]

A. Alder, Volker Strassen The algorithmic complexity of linear algebras. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:343-354 [Conf]

N. A. Shanin Role of a notion of algorithms in the arithmetic language semantics. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:361-389 [Conf]

Gregory S. Tseytin From logicism of proceduralsm (an autobiographical account). [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:390-396 [Conf]

Andrei P. Ershov Abstract computability on algebraic structures. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:397-420 [Conf]

V. M. Glushkov On formal transformations of algorithms. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:430-440 [Conf]

Yuri Matijasevic What should we do having proved a decision problem to be unsolvable? [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:441-448 [Conf]

Anatoly Buda On the experience of riding two horses in programming. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:444-448 [Conf]

A. V. Anisimov Church-Rosser transformers and decidable properties of tree processing. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:449-457 [Conf]

Antoni Kreczmar Some historical remarks on algorithmic logic. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:460-460 [Conf]

Boris A. Trakhtenbrot Some reflections on the connection between computer science and the theory of algorithms. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:461-462 [Conf]

Julia V. Kapitonova On design and implementation of algorithms. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:462- [Conf]

Yuri Leonidovich Ershov How does algebra help to solve problems from the theory of algorithms (an example). [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:462-463 [Conf]

Mike Paterson The linear postman: a message-forwarding algorithm using sequential storage. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:463- [Conf]

N. M. Nagorny Algorithm as a basis for Formulating constructive mathematical notions. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:463-464 [Conf]

S. Kh. Sirazhdinov On Euler numbers and Euler polynomial roots. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:464-465 [Conf]

G. N. Salikhov On an Algorithm for finding weights and nodes of cubic formulae. [Citation Graph (0, 0)][DBLP] Algorithms in Modern Mathematics and Computer Science, 1979, pp:465- [Conf]

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP