Skip to main content
Book cover
  • Conference proceedings
  • © 1981

Algorithms in Modern Mathematics and Computer Science

Proceedings, Urgench, Uzbek SSR September 16-22, 1979

Editors:

  1. Andrei P. Ershov
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Donald E. Knuth
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 122)

Sections

Softcover Book USD 49.99
Price excludes VAT (USA)
Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (24 papers)

  1. Front Matter

    PDF

  4. What are the gains of the theory of algorithms

    • V. A. Uspensky, A. L. Semenov
    Pages 100-234

  5. On inductive synthesis of programs

    • J. M. Barzdin
    Pages 235-254

  6. Expanding constructive universes

    • Yu. I. Manin
    Pages 255-260

  7. The logical approach to programming

    • N. N. Nepeivoda
    Pages 261-289

  8. The structural synthesis of programs

    • E. H. Tyugu
    Pages 290-303

  9. On finding invariant relations of program

    • A. A. Letichevsky
    Pages 304-314

  10. What can we do with problems of exhaustive search?

    • G. M. Adel'son-Vel'skii, A. O. Slisenko
    Pages 315-342

  11. The algorithmic complexity of linear algebras

    • A. Alder, V. Strassen
    Pages 343-354

  12. Algorithms in various contexts

    • Stephen C. Kleene
    Pages 355-360

  16. Algorithms and algebra

    • F. L. Bauer
    Pages 421-429

  17. On formal transformations of algorithms

    • V. M. Glushkov
    Pages 430-440
Back to top

Keywords

  • Algorithm
  • Algorithmus
  • Hwarismi, Muhammad B. Musa al-
  • Mathematics
  • algorithms
  • ants
  • complexity
  • algorithm analysis and problem complexity
Back to top

Bibliographic Information

  • Book Title: Algorithms in Modern Mathematics and Computer Science

  • Book Subtitle: Proceedings, Urgench, Uzbek SSR September 16-22, 1979

  • Editors: Andrei P. Ershov, Donald E. Knuth

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-11157-3

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1981

  • Softcover ISBN: 978-3-540-11157-3Published: 01 November 1981

  • eBook ISBN: 978-3-540-38621-6Published: 14 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XIV, 490

  • Topics: Programming Techniques, Algorithms

Back to top
Access via your institution
Softcover Book USD 49.99
Price excludes VAT (USA)
Learn about institutional subscriptions