國立虎尾科技大學 |

Computer science - theory and applications = 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017 : proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Computer science - theory and applications/ edited by Pascal Weil.
Reminder of title:	12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017 : proceedings /
remainder title:	CSR 2017
other author:	Weil, Pascal.
corporate name:	Workshop on the Preservation of Stability under Discretization
Published:	Cham :Springer International Publishing : : 2017.,
Description:	x, 337 p. :ill., digital ; : 24 cm.;
Contained By:	Springer eBooks
Subject:	Computer science -
Online resource:	http://dx.doi.org/10.1007/978-3-319-58747-9
ISBN:	9783319587479$q(electronic bk.)

Computer science - theory and applications = 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017 : proceedings /
Computer science - theory and applications12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017 : proceedings /[electronic resource] :CSR 2017edited by Pascal Weil. - Cham :Springer International Publishing :2017. - x, 337 p. :ill., digital ;24 cm. - Lecture notes in computer science,103040302-9743 ;. - Lecture notes in computer science ;6140..

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.

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.

ISBN: 9783319587479$q(electronic bk.)

Standard No.: 10.1007/978-3-319-58747-9doiSubjects--Topical Terms:

675907
Computer science

LC Class. No.: QA75.5

Dewey Class. No.: 004

Computer science - theory and applications = 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017 : proceedings /
LDR:03708nam a2200337 a 4500 001 885785
003 DE-He213
005 20170505051939.0
006 m d
007 cr nn 008maaau
008 180531s2017 gw s 0 eng d
020 $a 9783319587479$q(electronic bk.)
020 $a 9783319587462$q(paper)
024 7 $a 10.1007/978-3-319-58747-9 $2 doi
035 $a 978-3-319-58747-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA75.5
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 004 $2 23
090 $a QA75.5 $b .I61 2017
111 2 $a Workshop on the Preservation of Stability under Discretization $d (2001 : $c Fort Collins, Colo.) $3 527686
245 1 0 $a Computer science - theory and applications $h [electronic resource] : $b 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017 : proceedings / $c edited by Pascal Weil.
246 3 $a CSR 2017
260 $a Cham : $c 2017. $b Springer International Publishing : $b Imprint: Springer,
300 $a x, 337 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10304
505 0 $a 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.
520 $a 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.
650 0 $a Computer science $3 675907
650 0 $a Computer algorithms $v Congresses. $3 528474
650 1 4 $a Computer Science. $3 593922
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Data Structures. $3 669824
700 1 $a Weil, Pascal. $3 1143166
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 6140. $3 744199
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-58747-9
950 $a Computer Science (Springer-11645)