Computer science -- theory and applications : 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings /: 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings. (2017)
- Record Type:
- Book
- Title:
- Computer science -- theory and applications : 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings /: 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings. (2017)
- Main Title:
- Computer science -- theory and applications : 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings
- Other Titles:
- CSR 2017
- Further Information:
- Note: Pascal Weil (ed.).
- Editors:
- Weil, Pascal
- Other Names:
- International Computer Science Symposium in Russia, 12th
- Contents:
- 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 forType 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. … (more)
- Publisher Details:
- Cham, Switzerland : Springer
- Publication Date:
- 2017
- Extent:
- 1 online resource (x, 337 pages), illustrations
- Subjects:
- 004
Computer science
Computer science -- Congresses
Computer algorithms -- Congresses
Computer algorithms
Computer science
Computers -- Data Processing
Computers -- Programming -- General
Mathematics -- Logic
Computers -- Data Modeling & Design
Discrete mathematics
Computer programming / software development
Mathematical theory of computation
Algorithms & data structures
Computer software
Computational complexity
Logic design
Data structures (Computer science)
Computers -- Programming -- Algorithms
Electronic books
Conference papers and proceedings - Languages:
- English
- ISBNs:
- 9783319587479
3319587471
3319587463
9783319587462 - Related ISBNs:
- 9783319587462
- Notes:
- Note: Online resource; title from PDF title page (SpringerLink, viewed May 25, 2017).
- Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.365531
- Ingest File:
- 01_340.xml