{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":24,"n_cols":5,"rows_kept":24,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[17,2,17,3],[18,2,18,3],[21,2,21,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996418309003316"]
[null,null,"Titolo",null,"Computer Science – Theory and Applications [[electronic resource] ] : 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings / / edited by Henning Fernau"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020"]
[null,null,"ISBN",null,"3-030-50026-8"]
[null,null,"Edizione",null,"[1st ed. 2020.]"]
[null,null,"Descrizione fisica",null,"1 online resource (xi, 433 pages)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 12159"]
[null,null,"Disciplina",null,"004"]
[null,null,"Soggetti",null,"Computer science"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Information theory"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Data Structures and Information Theory"]
[{"$nulls":4},"Mathematics of Computing"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Includes index."]
[null,null,"Nota di contenuto",null,"Quantum 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 "]
[{"$nulls":4},"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."]
[null,null,null,"Sommario/riassunto","This 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."]