LEADER 05395nam 22006495 450 001 996418309003316 005 20230325073930.0 010 $a3-030-50026-8 024 7 $a10.1007/978-3-030-50026-9 035 $a(CKB)5310000000016606 035 $a(MiAaPQ)EBC6232565 035 $a(DE-He213)978-3-030-50026-9 035 $a(PPN)248595199 035 $a(EXLCZ)995310000000016606 100 $a20200612d2020 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aComputer Science ? Theory and Applications$b[electronic resource] $e15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 ? July 3, 2020, Proceedings /$fedited by Henning Fernau 205 $a1st ed. 2020. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020. 215 $a1 online resource (xi, 433 pages) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12159 300 $aIncludes index. 311 $a3-030-50025-X 327 $aQuantum Hashing and Fingerprinting for Quantum Cryptography and Computations -- Parameterized Analysis of Art Gallery and Terrain Guarding -- Central Positions in Social Networks -- Second-Order Finite Automata -- Isomorphic Distances Among Elections -- Tandem Duplications, Segmental Duplications and Deletions, and their Applications -- Faster 2-Disjoint-Shortest-Path Algorithm -- An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter -- The Normalized Algorithmic Information Distance Cannot be Approximated -- Definable Subsets of Polynomial-Time Algebraic Structures -- Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics -- Nested Regular Expressions can be Compiled to Small Deterministic Nested Word Automata -- On Embeddability of Unit Disk Graphs onto Straight Lines.-On the Decision Tree Complexity of Threshold Functions -- Randomized and Symmetric Catalytic Computation -- On the Parameterized Complexity of the Expected Coverage Problem -- Computational Hardness of Multidimensional Subtraction Games -- Parameterized Complexity of Fair Feedback Vertex Set Problem -- The Power of Leibniz-like Functions as Oracles -- Optimal Skeleton Huffman Trees Revisited -- The Subtrace Order and Counting First-Order Logic -- Speedable left-c.e. Numbers -- The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters -- On the Transformation of LL(k)-linear Grammars to LL(1)-linear -- On Computing the Hamiltonian Index of Graphs -- A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels -- Kernelization of Arc Disjoint Cycle Packing in $\alpha$-bounded Digraphs -- On Subquadratic Derivational Complexity of Semi-Thue Systems -- The Untold Story of SBP -- Weighted Rooted Trees: Fat or Tall -- Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals. 330 $aThis book constitutes the proceedings of the 15th International Computer Science Symposium in Russia, CSR 2020, held in Yekaterinburg, Russia, in June 2020. The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissions. The papers cover a broad range of topics, such as: algorithms and data structures; computational complexity, including hardness of approximation and parameterized complexity; randomness in computing, approximation algorithms, fixed-parameter algorithms; combinatorial optimization, constraint satisfaction, operations research; computational geometry; string algorithms; formal languages and automata, including applications to computational linguistics; codes and cryptography; combinatorics in computer science; computational biology; applications of logic to computer science, proof complexity; database theory; distributed computing; fundamentals of machine learning, including learning theory, grammatical inference and neural computing; computational social choice; quantum computing and quantum cryptography; theoretical aspects of big data. The conference was cancelled as a live conference due to the corona pandemic. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12159 606 $aComputer science 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aData structures (Computer science) 606 $aInformation theory 606 $aTheory of Computation 606 $aDiscrete Mathematics in Computer Science 606 $aData Structures and Information Theory 606 $aMathematics of Computing 615 0$aComputer science. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 14$aTheory of Computation. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Structures and Information Theory. 615 24$aMathematics of Computing. 676 $a004 702 $aFernau$b Henning$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996418309003316 996 $aComputer Science - Theory and Applications$92889860 997 $aUNISA