Descript 
1 online resource (x, 337 pages) : illustrations, digital ; 24 cm 

text txt rdacontent 

computer c rdamedia 

online resource cr rdacarrier 

text file PDF rda 
Series 
Lecture notes in computer science, 03029743 ; 10304


Lecture notes in computer science ; 10304

Note 
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 TimeOptimal Extractions  Entropic Uniform Sampling of Linear Extensions in SeriesParallel Posets  Parameterized Counting of Trees, Forests and Matroid Bases  Generalized Dyck Shifts  Green's Relations in Finite Transformation Semigroups  Nondeterministic Unitary OBDDs  Unary Coded PSPACEComplete 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 Sublogarithmic 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 Spacebounded Algorithms  Popularity in the Generalized Hospital Residents Setting  Edit Distance Neighbourhoods of Inputdriven Pushdown Automata  The (Minimum) Rank of Typical Foolingset Matrices  On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem  Daglike Communication and Its Applications  The Descriptive Complexity of Subgraph Isomorphism Without Numerics  On a Generalization of Horn Constraint Systems 

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 bioinformatics; current challenges such as quantum computing 
Host Item 
Springer eBooks

Subject 
Computer science  Congresses


Computer algorithms  Congresses


Computer Science


Algorithm Analysis and Problem Complexity


Discrete Mathematics in Computer Science


Logics and Meanings of Programs


Mathematical Logic and Formal Languages


Data Structures

Alt Author 
Weil, Pascal, editor


SpringerLink (Online service)

Alt Title 
CSR 2017 
