1 option
Computer Science - Theory and Applications : 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.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 9691.
- Theoretical Computer Science and General Issues ; 9691
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Computers.
- Numerical analysis.
- Computer logic.
- Logic, Symbolic and mathematical.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Computation by Abstract Devices.
- Numeric Computing.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Local Subjects:
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Computation by Abstract Devices.
- Numeric Computing.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Physical Description:
- 1 online resource (XXI, 425 pages) : 49 illustrations.
- Edition:
- First edition 2016.
- Contained In:
- Springer eBooks
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2016.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-34171-2
- 9783319341712
- 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.