Computer Science -- Theory and Applications 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings /

This book constitutes the proceedings of the 10th International Computer Science Symposium in Russia, CSR 2015, held in Listvyanka, Russia, in July 2015. The 25 full papers presented in this volume were carefully reviewed and selected from 61 submissions. In addition the book contains 4 invited lect...

Full description

Bibliographic Details
Published in:Springer eBooks
Corporate Author: SpringerLink (Online service)
Other Authors: Beklemishev, Lev D. (Editor), Musatov, Daniil V. (Editor)
Format: eBook
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2015.
Series:Lecture Notes in Computer Science,
Subjects:
Online Access:http://dx.doi.org/10.1007/978-3-319-20297-6
Перейти в каталог НБ ТГУ
LEADER 04530nam a22006015i 4500
001 vtls000560274
003 RU-ToGU
005 20210922090037.0
007 cr nn 008mamaa
008 170212s2015 gw | s |||| 0|eng d
020 |a 9783319202976  |9 978-3-319-20297-6 
024 7 |a 10.1007/978-3-319-20297-6  |2 doi 
035 |a to000560274 
039 9 |y 201702122321  |z Александр Эльверович Гилязов 
040 |a Springer  |c Springer  |d RU-ToGU 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
082 0 4 |a 005.1  |2 23 
245 1 0 |a Computer Science -- Theory and Applications  |h electronic resource  |b 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings /  |c edited by Lev D. Beklemishev, Daniil V. Musatov. 
260 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2015.  |9 742221 
300 |a XX, 443 p. 66 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 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 9139 
505 0 |a Propositional Proofs in Frege and Extended Frege Systems -- Circuit Complexity Meets Ontology-Based Data Access -- NEXP-Completeness and Universal Hardness Results for Justification Logic -- A Combinatorial Algorithm for the Planar Multi flow Problem with Demands Located on Three Holes -- Generalized LR Parsing for Grammars with Contexts -- On Compiling Structured CNFs to OBDDs -- Satisfiability of ECTL* with Tree Constraints -- On Growth and Fluctuation of k-Abelian Complexity -- A Polynomial-Time Algorithm for Outerplanar Diameter Improvement -- Editing to a Planar Graph of Given Degrees -- On the Satisfiability of Quantum Circuits of Small Treewidth -- Equations over Free Inverse Monoids with Idempotent Variables -- A Logical Characterization of Timed Pushdown Languages -- An In-place Priority Queue with O(1) Time for Push and lg n + O(1) Comparisons for Pop -- Resolution Complexity of Perfect Matching Principles for Sparse Graphs -- Operations on Self-verifying Finite Automata -- Automath Type Inclusion in Barendregt's Cube -- Circuit Lower Bounds for Average-Case MA -- Making Randomness Public in Unbounded-Round Information Complexity -- First-Order Logic Definability of Free Languages -- Representation of (Left) Ideal Regular Languages by Synchronizing Automata -- Some Properties of Antistochastic Strings -- Approximation and Exact Algorithms for Special Cases of Connected f-Factors -- Rewriting Higher-Order Stack Trees -- Interacting with Modal Logics in the Coq Proof Assistant -- Delay Games with WMSOþU Winning Conditions -- Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems. 
520 |a This book constitutes the proceedings of the 10th International Computer Science Symposium in Russia, CSR 2015, held in Listvyanka, Russia, in July 2015. The 25 full papers presented in this volume were carefully reviewed and selected from 61 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 Computer Science.  |9 155490 
650 0 |a computers.  |9 460101 
650 0 |a Algorithms.  |9 304813 
650 0 |a Computer logic.  |9 463252 
650 0 |a Mathematical logic.  |9 461383 
650 0 |a Numerical analysis.  |9 566288 
650 0 |a Computer science  |x Mathematics.  |9 304486 
650 1 4 |a Computer Science.  |9 155490 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |9 303732 
650 2 4 |a Discrete Mathematics in Computer Science.  |9 304816 
650 2 4 |a Computation by Abstract Devices.  |9 305111 
650 2 4 |a Numeric Computing.  |9 303733 
650 2 4 |a Logics and Meanings of Programs.  |9 306257 
650 2 4 |a Mathematical Logic and Formal Languages.  |9 303363 
700 1 |a Beklemishev, Lev D.  |e editor.  |9 466551 
700 1 |a Musatov, Daniil V.  |e editor.  |9 466552 
710 2 |a SpringerLink (Online service)  |9 143950 
773 0 |t Springer eBooks 
830 0 |a Lecture Notes in Computer Science,  |9 279505 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-20297-6 
856 |y Перейти в каталог НБ ТГУ  |u https://koha.lib.tsu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=414614 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645) 
999 |c 414614  |d 414614