SOFSEM 2021: Theory and Practice of Computer Science: 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021, Proceedings: Lecture Notes in Computer Science, cartea 12607
Editat de Tomáš Bureš, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdziński, Claus Pahl, Florian Sikora, Prudence W.H. Wongen Limba Engleză Paperback – 21 ian 2021
Din seria Lecture Notes in Computer Science
- 20% Preț: 741.34 lei
- 20% Preț: 340.22 lei
- 20% Preț: 343.43 lei
- 20% Preț: 315.18 lei
- 20% Preț: 327.41 lei
- 20% Preț: 1031.06 lei
- 20% Preț: 438.67 lei
- 20% Preț: 315.76 lei
- 20% Preț: 330.61 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 995.03 lei
- 20% Preț: 562.71 lei
- 20% Preț: 237.99 lei
- 20% Preț: 504.57 lei
- 20% Preț: 332.20 lei
- 15% Preț: 563.85 lei
- 20% Preț: 636.26 lei
- 5% Preț: 365.59 lei
- 20% Preț: 321.95 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.38 lei
- Preț: 370.38 lei
- 20% Preț: 172.68 lei
- 20% Preț: 315.76 lei
- 20% Preț: 662.78 lei
- 20% Preț: 256.26 lei
- 20% Preț: 440.36 lei
- 20% Preț: 626.79 lei
- 20% Preț: 566.70 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 579.38 lei
- 20% Preț: 301.94 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 330.61 lei
- 20% Preț: 1044.38 lei
- 20% Preț: 574.58 lei
- Preț: 399.17 lei
- 20% Preț: 802.24 lei
- 20% Preț: 569.11 lei
- 20% Preț: 1374.12 lei
- 20% Preț: 333.84 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.97 lei
Preț: 643.50 lei
Preț vechi: 804.37 lei
-20% Nou
Puncte Express: 965
Preț estimativ în valută:
123.16€ • 129.93$ • 102.63£
123.16€ • 129.93$ • 102.63£
Carte tipărită la comandă
Livrare economică 03-17 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030677305
ISBN-10: 3030677303
Pagini: 624
Ilustrații: XVI, 624 p. 116 illus., 65 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.89 kg
Ediția:1st ed. 2021
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: 3030677303
Pagini: 624
Ilustrații: XVI, 624 p. 116 illus., 65 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.89 kg
Ediția:1st ed. 2021
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
Invited Papers.- Algorithms that Access the Input via Queries.- Towards Knowledge Exchange: State-of-the-Art and Open Problems.- Invited Talk: Resilient Distributed Algorithms.- Towards Minimally Conscious Finite-State Controlled Cyber-Physical Systems – A Manifesto.- Reconstructing Phylogenetic Networks from Sequences: Where we Stand and What to do Next.- Foundations of Computer Science – Full Papers.- Amnesiac Flooding: Synchronous Stateless Information Dissemination.- Asymptotic Approximation by Regular Languages.- Balanced Independent and Dominating Sets on Colored Interval Graphs.- Bike Assisted Evacuation on a Line.- Blocksequences of k-local Words.- Complexity of limit-cycle problems in Boolean networks.- Concatenation Operations and Restricted Variants of Two-Dimensional Automata.- Distance Hedonic Games.- Distributed Independent Set in Interval and Segment Intersection Graphs.- Hierarchical b-Matching.- Improved algorithms for online load balancing.- Iterated Uniform Finite-State Transducers on Unary Languages.- New bounds on the half-duplex communication complexity.- Novel Results on the Number of Runs of the Burrows-Wheeler-Transform.- On the Redundancy of D-ary Fano Codes.- On the Terminal Connection Problem.- Parameterized Complexity of d-Hitting Set with Quotas.- Parameterizing Role Coloring on Forests.- The Balanced Satisfactory Partition Problem.- The Multiple Traveling Salesman Problem on Spiders.- Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs.- Using the Metro-Map Metaphor for Drawing Hypergraphs.- Weighted Microscopic Image Reconstruction.- Foundations of Computer Science – Short Papers.- A Normal Sequence Compressed by PPM* but not by Lempel-Ziv 78.- Clusters of repetition roots: single chains.- Drawing Two Posets.- Fair Division is Hard even for Amicable Agents.- The Complexity of Flow Expansion and Electrical Flow Expansion.- Foundations of Software Engineering – Full papers.- An Infrastructure for Platform-Independent Experimentation of Software Changes.- Using Process Models to understand Security Standards.- Web Test Automation: Insights from the Grey Literature.- Foundations of Data Science and Engineering – Full Papers.- A Pipeline for Measuring Brand Loyalty through Social Media Mining.- Predicting Tennis Match Outcomes With Network Analysis and Machine Learning.- Role-Based Access Control on Graph Databases.- Semi-Automatic Column Type Inference for CSV Table Understanding.- Foundations of Data Science and Engineering – Short papers.- Metadata Management on Data Processing in Data Lakes.- S2CFT: A new approach for paper submission recommendation.- Foundations of Algorithmic Computational Biology – Full Papers.- Adding Matrix Control: Insertion-Deletion Systems With Substitutions III.- Sorting by Multi-Cut Rearrangements.- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails.