| 000 | 05359nam a22005775i 4500 | ||
|---|---|---|---|
| 001 | 978-3-030-50026-9 | ||
| 003 | DE-He213 | ||
| 005 | 20240730174111.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 200612s2020 sz | s |||| 0|eng d | ||
| 020 |
_a9783030500269 _9978-3-030-50026-9 |
||
| 024 | 7 |
_a10.1007/978-3-030-50026-9 _2doi |
|
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 072 | 7 |
_aUYA _2thema |
|
| 082 | 0 | 4 |
_a004.0151 _223 |
| 245 | 1 | 0 |
_aComputer Science - Theory and Applications _h[electronic resource] : _b15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 - July 3, 2020, Proceedings / _cedited by Henning Fernau. |
| 250 | _a1st ed. 2020. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2020. |
|
| 300 |
_aXI, 433 p. 187 illus., 23 illus. in color. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v12159 |
|
| 505 | 0 | _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. | |
| 520 | _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. | ||
| 650 | 0 |
_aComputer science. _99832 |
|
| 650 | 0 |
_aComputer science _xMathematics. _93866 |
|
| 650 | 0 |
_aDiscrete mathematics. _912873 |
|
| 650 | 0 |
_aData structures (Computer science). _98188 |
|
| 650 | 0 |
_aInformation theory. _914256 |
|
| 650 | 1 | 4 |
_aTheory of Computation. _9111092 |
| 650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
| 650 | 2 | 4 |
_aData Structures and Information Theory. _931923 |
| 650 | 2 | 4 |
_aMathematics of Computing. _931875 |
| 700 | 1 |
_aFernau, Henning. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9111093 |
|
| 710 | 2 |
_aSpringerLink (Online service) _9111094 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783030500252 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783030500276 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v12159 _9111095 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-50026-9 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cELN | ||
| 999 |
_c89259 _d89259 |
||