東華大學圖書館 |

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 /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	SOFSEM 2021/ edited by Tomas Bures ... [et al.].
其他題名:	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
其他作者:	Bures, Tomas.
團體作者:	SOFSEM (Conference)
出版者:	Cham :Springer International Publishing : : 2021.,
面頁冊數:	xvi, 624 p. :ill. (some col.), digital ;24 cm.
內容註:	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.
Contained By:	Springer Nature eBook
標題:	Computer science - Congresses. -
電子資源:	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 2021theory 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 /[electronic resource] :SOFSEM 2021edited by Tomas Bures ... [et al.]. - Cham :Springer International Publishing :2021. - xvi, 624 p. :ill. (some col.), digital ;24 cm. - Theoretical computer science and general issues ;12607. - Theoretical computer science and general issues ;12607..

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:

606819
Computer science
--Congresses.

LC Class. No.: QA75.5 / .S647 2021

Dewey Class. No.: 004

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:04942nmm a2200361 a 4500 001 2237640
003 DE-He213
005 20210629141236.0
006 m d
007 cr nn 008maaau
008 211111s2021 sz s 0 eng d
020 $a 9783030677312 $q (electronic bk.)
020 $a 9783030677305 $q (paper)
024 7 $a 10.1007/978-3-030-67731-2 $2 doi
035 $a 978-3-030-67731-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA75.5 $b .S647 2021
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 $2 23
090 $a QA75.5 $b .S681 2021
111 2 $a SOFSEM (Conference) $n (47th : $d 2021 : $c Online) $3 3490056
245 1 0 $a SOFSEM 2021 $h [electronic resource] : $b 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 / $c edited by Tomas Bures ... [et al.].
246 3 $a SOFSEM 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xvi, 624 p. : $b ill. (some col.), digital ; $c 24 cm.
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 Computer science $v Congresses. $3 606819
650 0 $a Software engineering $x Congresses. $3 696781
650 0 $a Computers. $3 544777
650 0 $a Data structures (Computer science) $3 527210
650 0 $a Optical data processing. $3 649747
650 0 $a Software engineering. $3 559826
650 1 4 $a Theory of Computation. $3 892514
650 2 4 $a Data Structures and Information Theory. $3 3382368
650 2 4 $a Computer Imaging, Vision, Pattern Recognition and Graphics. $3 890871
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 891214
650 2 4 $a Information Systems and Communication Service. $3 891044
700 1 $a Bures, Tomas. $3 3490057
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Theoretical computer science and general issues ; $v 12607. $3 3490058
856 4 0 $u https://doi.org/10.1007/978-3-030-67731-2
950 $a Mathematics and Statistics (SpringerNature-11649)