My Account Log in

1 option

Computer Science - Theory and Applications : 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28-July 2, 2021, Proceedings / edited by Rahul Santhanam, Daniil Musatov.

SpringerLink Books Computer Science (2011-2024) Available online

View online
Format:
Book
Contributor:
Santhanam, Rahul, Editor.
Musatov, Daniil, Editor.
SpringerLink (Online service)
Series:
Computer Science (SpringerNature-11645)
LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 12730
Theoretical Computer Science and General Issues, 2512-2029 ; 12730
Language:
English
Subjects (All):
Computer science.
Computer systems.
Data structures (Computer science).
Information theory.
Computer engineering.
Computer networks.
Numerical analysis.
Computer science-Mathematics.
Discrete mathematics.
Theory of Computation.
Computer System Implementation.
Data Structures and Information Theory.
Computer Engineering and Networks.
Numerical Analysis.
Discrete Mathematics in Computer Science.
Local Subjects:
Theory of Computation.
Computer System Implementation.
Data Structures and Information Theory.
Computer Engineering and Networks.
Numerical Analysis.
Discrete Mathematics in Computer Science.
Physical Description:
1 online resource (XI, 485 pages) : 28 illustrations, 6 illustrations in color.
Edition:
1st ed. 2021.
Contained In:
Springer Nature eBook
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2021.
System Details:
text file PDF
Summary:
This book constitutes the proceedings of the 16th International Computer Science Symposium in Russia, CSR 2021, held in Sochi, Russia, in June/July 2021. The 28 full papers were carefully reviewed and selected from 68 submissions. The papers cover a broad range of topics, such as formal languages and automata theory, geometry and discrete structures; theory and algorithms for application domains and much more.
Contents:
Models of computation
Formal languages and automata theory
Computational complexity and cryptography
Logic
Design and analysis of algorithms
Randomness, geometry and discrete structures
Theory and algorithms for application domains.
Other Format:
Printed edition:
ISBN:
978-3-030-79416-3
9783030794163
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account