Computer Science – Theory and Applications: 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings: Lecture Notes in Computer Science, cartea 12159
Editat de Henning Fernauen Limba Engleză Paperback – 13 iun 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.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1043.63 lei
- 20% Preț: 334.61 lei
- 20% Preț: 336.22 lei
- 20% Preț: 445.69 lei
- 20% Preț: 238.01 lei
- 20% Preț: 334.61 lei
- 20% Preț: 438.69 lei
- Preț: 442.03 lei
- 20% Preț: 337.87 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 634.41 lei
- 17% Preț: 427.22 lei
- 20% Preț: 643.99 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1057.10 lei
- 20% Preț: 581.55 lei
- Preț: 374.84 lei
- 20% Preț: 331.36 lei
- 15% Preț: 431.22 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1390.89 lei
- 20% Preț: 1007.16 lei
- 20% Preț: 569.54 lei
- 20% Preț: 575.48 lei
- 20% Preț: 573.59 lei
- 20% Preț: 750.35 lei
- 15% Preț: 570.71 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 347.59 lei
- 20% Preț: 576.02 lei
- Preț: 404.00 lei
- 20% Preț: 586.43 lei
- 20% Preț: 750.35 lei
- 20% Preț: 812.01 lei
- 20% Preț: 649.49 lei
- 20% Preț: 344.34 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 334.11 lei
Preț vechi: 417.64 lei
-20% Nou
Puncte Express: 501
Preț estimativ în valută:
63.96€ • 65.78$ • 53.06£
63.96€ • 65.78$ • 53.06£
Carte tipărită la comandă
Livrare economică 20 februarie-06 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030500252
ISBN-10: 303050025X
Pagini: 433
Ilustrații: XI, 433 p. 187 illus., 23 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.62 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
ISBN-10: 303050025X
Pagini: 433
Ilustrații: XI, 433 p. 187 illus., 23 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.62 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
Cuprins
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 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.