|
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465683003316 |
|
|
Titolo |
Computer Science – Theory and Applications [[electronic resource] ] : 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings / / edited by Alexander S. Kulikov, Gerhard J. Woeginger |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2016.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XXI, 425 p. 49 illus.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 9691 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Algorithms |
Computer science—Mathematics |
Discrete mathematics |
Computer science |
Numerical analysis |
Machine theory |
Discrete Mathematics in Computer Science |
Theory of Computation |
Numerical Analysis |
Computer Science Logic and Foundations of Programming |
Formal Languages and Automata Theory |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di contenuto |
|
Algorithms and data structures -- Combinatorial optimization -- Constraint solving -- Computational complexity -- Cryptography -- Combinatorics in computer science -- Formal languages and automata -- Computational models and concepts -- Algorithms for concurrent and distributed systems, networks -- Proof theory and applications of logic to computer science -- Model checking -- Automated reasoning -- Deductive methods. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the proceedings of the 11th International Computer Science Symposium in Russia, CSR 2016, held in St. |
|
|
|
|
|
|
|
|
|
|
Petersburg, Russia, in June 2016. The 28 full papers presented in this volume were carefully reviewed and selected from 71 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas such as: include, but are not limited to: algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; computational models and concepts; algorithms for concurrent and distributed systems, networks; proof theory and applications of logic to computer science; model checking; automated reasoning; and deductive methods. |
|
|
|
|
|
| |