Cargando…

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

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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Hirsch, Edward (Editor ), Kuznetsov, Sergei O. (Editor ), Pin, Jean-Éric (Editor ), Vereshchagin, Nikolay (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cham : Springer International Publishing : Imprint: Springer, 2014.
Edición:1st ed. 2014.
Colección:Theoretical Computer Science and General Issues, 8476
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-319-06686-8
003 DE-He213
005 20230221004124.0
007 cr nn 008mamaa
008 140602s2014 sz | s |||| 0|eng d
020 |a 9783319066868  |9 978-3-319-06686-8 
024 7 |a 10.1007/978-3-319-06686-8  |2 doi 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
072 7 |a UMB  |2 thema 
082 0 4 |a 518.1  |2 23 
245 1 0 |a Computer Science - Theory and Applications  |h [electronic resource] :  |b 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings /  |c edited by Edward Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay Vereshchagin. 
250 |a 1st ed. 2014. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2014. 
300 |a XX, 389 p. 39 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 8476 
505 0 |a 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. 
520 |a 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. 
650 0 |a Algorithms. 
650 0 |a Computer science-Mathematics. 
650 0 |a Discrete mathematics. 
650 0 |a Computer science. 
650 0 |a Numerical analysis. 
650 0 |a Machine theory. 
650 1 4 |a Algorithms. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Numerical Analysis. 
650 2 4 |a Computer Science Logic and Foundations of Programming. 
650 2 4 |a Formal Languages and Automata Theory. 
700 1 |a Hirsch, Edward.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Kuznetsov, Sergei O.  |e editor.  |0 (orcid)0000-0003-3284-9001  |1 https://orcid.org/0000-0003-3284-9001  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Pin, Jean-Éric.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Vereshchagin, Nikolay.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783319066875 
776 0 8 |i Printed edition:  |z 9783319066851 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 8476 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-319-06686-8  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)