Computer Science - Theory and Applications
12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings
Published on 6. May 2017
Book
Paperback/Softback
X, 337 pages
978-3-319-58746-2 (ISBN)
Description
This book constitutes the proceedings of the 12th International Computer Science Symposium in Russia, CSR 2017, held in Kazan, Russia, in June 2017.
The 22 full papers presented in this volume were carefully reviewed and selected from 44 submissions. In addition the book contains 6 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; algorithms for concurrent and distributed systems, networks; applications of logic to computer science, e.g. proof theory, model checking and verification; formal and algorithmic aspects of bio-informatics; current challenges such as quantum computing.
More details
Series
Edition
1st ed. 2017
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Illustrations
30 s/w Abbildungen
X, 337 p. 30 illus.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 19 mm
Weight
528 gr
ISBN-13
978-3-319-58746-2 (9783319587462)
DOI
10.1007/978-3-319-58747-9
Schweitzer Classification
Other editions
Additional editions
Pascal Weil
Computer Science - Theory and Applications
12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings
E-Book
05/2017
Springer
€53.49
Available for download
Content
Type Theory and Formalization of Mathematics.- Advances in Parameterized Verification of Population Protocols.- Verification of Quantum Computation and the Price of Trust.- Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs.- Concatenation Hierarchies: New Bottle, Old Wine.- Can We Locally Compute Sparse Connected Subgraphs.- Palindromic Decompositions with Gaps and Errors.- Cascade Heaps: Towards Time-Optimal Extractions.- Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets.- Parameterized Counting of Trees, Forests and Matroid Bases.- Generalized Dyck Shifts.- Green's Relations in Finite Transformation Semigroups.- Nondeterministic Unitary OBDDs.- Unary Coded PSPACE-Complete Languages in ASPACE(loglog n).- Turing Degree Spectra of Minimal Subshifts.- Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams.- Dynamic stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals.- The Transformation Monoid of a Partially Lossy Queue.- Approximation Algorithms for the Maximum Carpool Matching Problem.- The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC=0.- On Algorithmic Statistics for Space-bounded Algorithms.- Popularity in the Generalized Hospital Residents Setting.- Edit Distance Neighbourhoods of Input-driven Pushdown Automata.- The (Minimum) Rank of Typical Fooling-set Matrices.- On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem.- Dag-like Communication and Its Applications.- The Descriptive Complexity of Subgraph Isomorphism Without Numerics.- On a Generalization of Horn Constraint Systems.