Computer Science – Theory and Applications
Springer International Publishing (Verlag)
978-3-319-34170-5 (ISBN)
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.
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.
| Erscheinungsdatum | 08.10.2016 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XXI, 425 p. 49 illus. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm analysis and problem complexity • approximation algorithm • Automata Theory • communication complexity • computable analysis • computational complexity and cryptography • Computer Science • constraint satisfaction problem • denoising • design and analysis of algorithms • Discrete Mathematics • formal languages and automata theory • Information Complexity • Logic • machine learning • Models of Computation • NP-hard problem • Operations Research • parallel computing methodologies • randomness, geometry and discrete structures • Statistics • symbolic and algebraic manipulation • Theory and algorithms for application domains |
| ISBN-10 | 3-319-34170-7 / 3319341707 |
| ISBN-13 | 978-3-319-34170-5 / 9783319341705 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
