• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 31 matches

• 1981
• 
  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 [contents]
• 1979
• 
  G. M. Adelson-Velskiy, A. O. Slisenko:
  What can we do with problems of exhaustive search?. Algorithms in Modern Mathematics and Computer Science 1979: 315-342
• 
  A. Alder, Volker Strassen:
  The algorithmic complexity of linear algebras. Algorithms in Modern Mathematics and Computer Science 1979: 343-354
• 
  A. V. Anisimov:
  Church-Rosser transformers and decidable properties of tree processing. Algorithms in Modern Mathematics and Computer Science 1979: 449-457
• 
  J. M. Barzdin:
  On inductive synthesis of programs. Algorithms in Modern Mathematics and Computer Science 1979: 235-254
• 
  Friedrich L. Bauer:
  Algorithms and algebra. Algorithms in Modern Mathematics and Computer Science 1979: 421-429
• 
  Anatoliy O. Buda:
  On the experience of riding two horses in programming. Algorithms in Modern Mathematics and Computer Science 1979: 444-448
• 
  Andrei P. Ershov:
  Abstract computability on algebraic structures. Algorithms in Modern Mathematics and Computer Science 1979: 397-420
• 
  Yuri Leonidovich Ershov:
  How does algebra help to solve problems from the theory of algorithms (an example). Algorithms in Modern Mathematics and Computer Science 1979: 462-463
• 
  V. M. Glushkov:
  On formal transformations of algorithms. Algorithms in Modern Mathematics and Computer Science 1979: 430-440
• 
  Julia V. Kapitonova:
  On design and implementation of algorithms. Algorithms in Modern Mathematics and Computer Science 1979: 462
• 
  Stephen Cole Kleene:
  Algorithms in various contexts. Algorithms in Modern Mathematics and Computer Science 1979: 355-360
• 
  Donald E. Knuth:
  Algorithms in modern mathematics and computer science. Algorithms in Modern Mathematics and Computer Science 1979: 82-99
• 
  Antoni Kreczmar:
  Some historical remarks on algorithmic logic. Algorithms in Modern Mathematics and Computer Science 1979: 460
• 
  Alexander A. Letichevsky:
  On finding invariant relations of programs. Algorithms in Modern Mathematics and Computer Science 1979: 304-314
• 
  Yuri I. Manin:
  Expanding constructive universes. Algorithms in Modern Mathematics and Computer Science 1979: 255-260
• 
  Yuri Matijasevic:
  What should we do having proved a decision problem to be unsolvable? Algorithms in Modern Mathematics and Computer Science 1979: 441-448
• 
  Antoni W. Mazurkiewicz:
  Concurrent algorithms schemata. Algorithms in Modern Mathematics and Computer Science 1979: 460-461
• 
  N. M. Nagorny:
  Algorithm as a basis for Formulating constructive mathematical notions. Algorithms in Modern Mathematics and Computer Science 1979: 463-464
• 
  N. N. Nepeivoda:
  The logical approach to programming. Algorithms in Modern Mathematics and Computer Science 1979: 261-289
• 
  Mike Paterson:
  The linear postman: a message-forwarding algorithm using sequential storage. Algorithms in Modern Mathematics and Computer Science 1979: 463
• 
  G. N. Salikhov:
  On an Algorithm for finding weights and nodes of cubic formulae. Algorithms in Modern Mathematics and Computer Science 1979: 465
• 
  Nikolai A. Shanin:
  Role of a notion of algorithms in the arithmetic language semantics. Algorithms in Modern Mathematics and Computer Science 1979: 361-389
• 
  S. Kh. Sirazhdinov:
  On Euler numbers and Euler polynomial roots. Algorithms in Modern Mathematics and Computer Science 1979: 464-465
• 
  Boris A. Trakhtenbrot:
  Some reflections on the connection between computer science and the theory of algorithms. Algorithms in Modern Mathematics and Computer Science 1979: 461-462
• 
  Gregory S. Tseytin:
  From logicism of proceduralsm (an autobiographical account). Algorithms in Modern Mathematics and Computer Science 1979: 390-396
• 
  Enn Tyugu:
  The structural synthesis of programs. Algorithms in Modern Mathematics and Computer Science 1979: 290-303
• 
  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. Algorithms in Modern Mathematics and Computer Science 1979: 100-234
• 
  Adriaan van Wijngaarden:
  Languageless programming. Algorithms in Modern Mathematics and Computer Science 1979: 459
• 
  Supplement 1 summaries of oral presentations. Algorithms in Modern Mathematics and Computer Science. 1979: 458-465

skipping 1 more match