國立虎尾科技大學 |

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 /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	SOFSEM 2021: Theory and Practice of Computer Science/ edited by Tomáš Bureš, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdziński, Claus Pahl, Florian Sikora, Prudence W.H. Wong.
Reminder of title:	47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021, Proceedings /
other author:	Bureš, Tomáš.
Description:	XVI, 624 p. 116 illus., 65 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computers. -
Online resource:	https://doi.org/10.1007/978-3-030-67731-2
ISBN:	9783030677312

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 /
SOFSEM 2021: Theory and Practice of Computer Science47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021, Proceedings /[electronic resource] :edited by Tomáš Bureš, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdziński, Claus Pahl, Florian Sikora, Prudence W.H. Wong. - 1st ed. 2021. - XVI, 624 p. 116 illus., 65 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12607. - Theoretical Computer Science and General Issues ;9163.

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.

This 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.

ISBN: 9783030677312

Standard No.: 10.1007/978-3-030-67731-2doiSubjects--Topical Terms:

565115
Computers.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

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 /
LDR:05398nam a22004335i 4500 001 1055514
003 DE-He213
005 20210826154918.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030677312 $9 978-3-030-67731-2
024 7 $a 10.1007/978-3-030-67731-2 $2 doi
035 $a 978-3-030-67731-2
050 4 $a QA75.5-76.95
050 4 $a QA76.63
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a SOFSEM 2021: Theory and Practice of Computer Science $h [electronic resource] : $b 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021, Proceedings / $c edited by Tomáš Bureš, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdziński, Claus Pahl, Florian Sikora, Prudence W.H. Wong.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XVI, 624 p. 116 illus., 65 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 12607
505 0 $a 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.
520 $a This 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.
650 0 $a Computers. $3 565115
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Optical data processing. $3 639187
650 0 $a Software engineering. $3 562952
650 1 4 $a Theory of Computation. $3 669322
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Computer Imaging, Vision, Pattern Recognition and Graphics. $3 671334
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 669780
650 2 4 $a Information Systems and Communication Service. $3 669203
700 1 $a Bureš, Tomáš. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1360714
700 1 $a Dondi, Riccardo. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1111291
700 1 $a Gamper, Johann. $e editor. $1 https://orcid.org/0000-0002-7128-507X $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1309935
700 1 $a Guerrini, Giovanna. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1078139
700 1 $a Jurdziński, Tomasz. $e editor. $1 https://orcid.org/0000-0003-1908-9458 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1360715
700 1 $a Pahl, Claus. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 567484
700 1 $a Sikora, Florian. $e editor. $1 https://orcid.org/0000-0003-2670-6258 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1317387
700 1 $a Wong, Prudence W.H. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1360716
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030677305
776 0 8 $i Printed edition: $z 9783030677329
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-67731-2
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)