default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithms in Modern Mathematics and Computer Science 1979: Urgench, Uzbek SSR
- Andrei P. Ershov, Donald E. Knuth:
Algorithms in Modern Mathematics and Computer Science, Proceedings, Urgench, Uzbek SSR, USSR, September 16-22, 1979. Lecture Notes in Computer Science 122, Springer 1981, ISBN 3-540-11157-3 - Heinz Zemanek:
DIXIT Algorizmi - His Background, his Personality, his Work, and his Influence. 1-81 - Donald E. Knuth:
Algorithms in modern mathematics and computer science. 82-99 - 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 - J. M. Barzdin:
On inductive synthesis of programs. 235-254 - Yuri I. Manin:
Expanding constructive universes. 255-260 - N. N. Nepeivoda:
The logical approach to programming. 261-289 - Enn Tyugu:
The structural synthesis of programs. 290-303 - Alexander A. Letichevsky:
On finding invariant relations of programs. 304-314 - G. M. Adelson-Velskiy, A. O. Slisenko:
What can we do with problems of exhaustive search?. 315-342 - A. Alder, Volker Strassen:
The algorithmic complexity of linear algebras. 343-354 - Stephen Cole Kleene:
Algorithms in various contexts. 355-360 - Nikolai A. Shanin:
Role of a notion of algorithms in the arithmetic language semantics. 361-389 - Gregory S. Tseytin:
From logicism of proceduralsm (an autobiographical account). 390-396 - Andrei P. Ershov:
Abstract computability on algebraic structures. 397-420 - Friedrich L. Bauer:
Algorithms and algebra. 421-429 - V. M. Glushkov:
On formal transformations of algorithms. 430-440 - Yuri Matijasevic:
What should we do having proved a decision problem to be unsolvable? 441-448 - Anatoliy O. Buda:
On the experience of riding two horses in programming. 444-448 - A. V. Anisimov:
Church-Rosser transformers and decidable properties of tree processing. 449-457
- Supplement 1 summaries of oral presentations. 458-465
- Adriaan van Wijngaarden:
Languageless programming. 459 - Antoni Kreczmar:
Some historical remarks on algorithmic logic. 460 - Antoni W. Mazurkiewicz:
Concurrent algorithms schemata. 460-461 - Boris A. Trakhtenbrot:
Some reflections on the connection between computer science and the theory of algorithms. 461-462 - Julia V. Kapitonova:
On design and implementation of algorithms. 462 - Yuri Leonidovich Ershov:
How does algebra help to solve problems from the theory of algorithms (an example). 462-463 - Mike Paterson:
The linear postman: a message-forwarding algorithm using sequential storage. 463 - N. M. Nagorny:
Algorithm as a basis for Formulating constructive mathematical notions. 463-464 - S. Kh. Sirazhdinov:
On Euler numbers and Euler polynomial roots. 464-465 - G. N. Salikhov:
On an Algorithm for finding weights and nodes of cubic formulae. 465
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-25 23:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
