Computer Science - Theory and Applications

9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings

Edward Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay Vereshchagin (Herausgeber)

Buch | Softcover

XX, 389 Seiten

2014
Springer International Publishing (Verlag)
978-3-319-06685-1 (ISBN)

Artikel merken

This book constitutes the proceedings of the 9th International Computer Science Symposium in Russia, CSR 2014, held in Moscow, Russia, in June 2014. The 27 full papers presented in this volume were carefully reviewed and selected from 76 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.

Finding All Solutions of Equations in Free Groups and Monoids with Involution.- Algorithmic Meta Theorems for Sparse Graph Classes.- The Lattice of Definability.- Counting Popular Matchings in House Allocation Problems.- Vertex Disjoint Paths in Upward Planar Graphs.- On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains.- Testing low degree trigonometric polynomials.- Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees.- A Fast Branching Algorithm for Cluster Vertex Deletion.- Separation Logic with One Quantified Variable.- Notions of metric dimension of corona products.- On the Complexity of Computing Two Nonlinearity Measures.- Model Checking for String Problems.- Semiautomatic Structures.- The Query Complexity of Witness Finding.- Primal implication as encryption.- Processing Succinct Matrices and Vectors.- Constraint Satisfaction with Counting Quantifiers.- Dynamic Complexity of Planar 3-connected Graph Isomorphism.- Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions.- First-Order Logic on CPDA Graphs.- Recognizing two-sided contexts in cubic time.- A Parameterized Algorithm for Packing Overlapping Subgraphs.- Crossing-free spanning trees in visibility graphs of points between monotone polygonal obstacles.- The Connectivity of Boolean Satisfiability.- Randomized communication complexity of approximating Kolmogorov complexity.- Space Saving by Dynamic Algebraization.

Erscheint lt. Verlag	15.5.2014
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XX, 389 p. 39 illus.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Gewicht	629 g
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Themenwelt	Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
Schlagworte	Algorithm analysis and problem complexity • approximation algorithms • Computational Complexity • Discrete Mathematics • Graph Algorithms • graph theory • Mathematical Analysis • Numerical analysis • theoretical computer science • Theory of Computation
ISBN-10	3-319-06685-4 / 3319066854
ISBN-13	978-3-319-06685-1 / 9783319066851
Zustand	Neuware