Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9139)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: CSR 2015.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (27 papers)
Other volumes
-
Computer Science -- Theory and Applications
Keywords
- Approximation algorithms
- Computational complexity
- Discrete mathematics
- Formal grammars
- Graph algorithms
- Graph theory
- Kolmogorov complexity
- Planar graph
- Polynomial-time algorithms
- Proof complexity
- Reset complexity
- Satisfiability of quantum circuits
- Shift-reduce
- Strongly connected automaton
- Strongly polynomial algorithm
- Synchronizing automaton
- Theory of computation
- Timed languages
- Timed pushdown automata
- Visibly pushdown languages
About this book
This book constitutes the proceedings of the 10th International Computer Science Symposium in Russia, CSR 2015, held in Listvyanka, Russia, in July 2015.
The 25 full papers presented in this volume were carefully reviewed and selected from 61 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 in theoretical computer science and its applications.
Editors and Affiliations
Bibliographic Information
Book Title: Computer Science -- Theory and Applications
Book Subtitle: 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings
Editors: Lev D. Beklemishev, Daniil V. Musatov
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-20297-6
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2015
Softcover ISBN: 978-3-319-20296-9Published: 06 July 2015
eBook ISBN: 978-3-319-20297-6Published: 22 June 2015
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XX, 443
Number of Illustrations: 66 b/w illustrations
Topics: 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