| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910485589603321 |
|
|
Titolo |
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 |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2021.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (495 pages) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 12730 |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
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 |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
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. |
|
|
|
|
|
|
|
| |