000 06474nam a2200493 i 4500
999 _c334776
_d334776
_x1
001 334776
003 ES-MaUEC
005 20230102114745.0
006 a|||| o|||| 10| 0
007 cr nn nnnaamaa
008 210120s2021 gw a o |1|| 0|eng d
020 _a9783030677312
024 7 _a10.1007/978-3-030-67731-2
_2doi
040 _aES-MaUEC
_bspa
_cES-MaUEC
_dES-MaUEC
050 4 _aQA76
_b2021 EB
245 0 0 _aSOFSEM 2021 :
_btheory 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
_cedited by Tomáš Bureš, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdziński, Claus Pahl, Florian Sikora, Prudence WH Wong
250 _aFirst edition 2021
264 1 _aCham, Switzerland
_bSpringer International Publising
_c2021
300 _a1 recurso en línea (XVI, 624 páginas)
_b116 ilustraciones, 65 ilustraciones a color
336 _2rdacontent
_aTexto
_btxt
337 _2rdamedia
_aelectrónico
_bc
338 _2rdacarrier
_arecurso electrónico
_bcr
347 _atext file
_bPDF
_2rda
490 0 _aTheoretical Computer Science and General Issues
_v12607
505 0 _aInvited 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.
520 3 _aThis book contains the invited and contributed papers selected for presentation at SOFSEM 2021, the 47th International Conference on Current Trends in Theory and Practice of Computer Science, which was held online during January 25-28, 2021, hosted by the Free University of Bozen-Bolzano, Italy. The 33 full and 7 short papers included in the volume were carefully reviewed and selected from 100 submissions. They were organized in topical sections on: foundations of computer science; foundations of software engineering; foundations of data science and engineering; and foundations of algorithmic computational biology. The book also contains 5 invited papers.
988 _aSpringer_Computer_2021
650 7 _2embne
_aInformática
_vCongresos y asambleas
_9139268
650 7 _2embne
_aIngeniería del software
_vCongresos y asambleas
_9152630
700 1 _aBureš, Tomáš
_eeditor literario
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aDondi, Riccardo
_eeditor literario
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aGamper, Johann
_eeditor literario
_0(orcid)0000-0002-7128-507X
_1https://orcid.org/0000-0002-7128-507X
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aGuerrini, Giovanna
_eeditor literario
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aJurdziński, Tomasz
_eeditor literario
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPahl, Claus
_eeditor literario
_0(orcid)0000-0002-9049-212X
_1https://orcid.org/0000-0002-9049-212X
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSikora, Florian
_eeditor literario
_0(orcid)0000-0003-2670-6258
_1https://orcid.org/0000-0003-2670-6258
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aWong, Prudence W.H
_eeditor literario
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink
856 4 0 _uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-030-67731-2
_zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942 _2lcc
_cLE
998 _b05/2021
_dz
_eb
_zSI