Computer Science - Theory and Applications 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings / edited by Edward Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay Vereshchagin.

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....

Full description

Saved in:

Bibliographic Details
Corporate Author:	SpringerLink (Online service)
Other Authors:	Hirsch, Edward (Editor), Kuznetsov, Sergei O. (Editor), Pin, Jean-Éric (Editor), Vereshchagin, Nikolay (Editor)
Format:	eBook
Language:	English
Published:	Cham : Springer International Publishing : Imprint: Springer, 2014.
Edition:	1st ed. 2014.
Series:	Theoretical Computer Science and General Issues ; 8476 Springer eBook Collection.
Subjects:	Algorithms. Computer science—Mathematics. Computers. Numerical analysis. Computer logic. Mathematical logic. Electronic resources (E-books)
Online Access:	Click to view e-book
Holy Cross Note:	Loaded electronically. Electronic access restricted to members of the Holy Cross Community.

Table of Contents:

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.

Computer Science - Theory and Applications 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings / edited by Edward Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay Vereshchagin.

Similar Items