國立虎尾科技大學 |

Fundamentals of Computation Theory = 23rd International Symposium, FCT 2021, Athens, Greece, September 12–15, 2021, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Fundamentals of Computation Theory/ edited by Evripidis Bampis, Aris Pagourtzis.
Reminder of title:	23rd International Symposium, FCT 2021, Athens, Greece, September 12–15, 2021, Proceedings /
other author:	Bampis, Evripidis.
Description:	XIX, 476 p. 74 illus., 24 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.1007/978-3-030-86593-1
ISBN:	9783030865931

Fundamentals of Computation Theory = 23rd International Symposium, FCT 2021, Athens, Greece, September 12–15, 2021, Proceedings /
Fundamentals of Computation Theory23rd International Symposium, FCT 2021, Athens, Greece, September 12–15, 2021, Proceedings /[electronic resource] :edited by Evripidis Bampis, Aris Pagourtzis. - 1st ed. 2021. - XIX, 476 p. 74 illus., 24 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12867. - Theoretical Computer Science and General Issues ;9163.

Invited papers -- Two sided matching markets with strongly correlated random preferences -- Communicating Finite state machines and an extensible toolchain for multiparty session types -- Contributed papers -- First-Order logic and its Infinitary Quantifier Extensions over Countable Words -- From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization -- A Poly-Log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider -- Computational Complexity of Covering Disconnected Multigraphs -- The Complexity of Bicriteria Tree-depth -- TS-Reconfiguration of Dominating Sets in circle and circular-arc graphs -- Bipartite 3-Regular Counting Problems with Mixed Signs -- The Satisfiability Problem for a Quantitative Fragment of PCTL -- Beyond the BEST Theorem: Fast Assessment of Eulerian Trails -- Regular Model Checking with Regular Relations -- Minimum Consistent Subset of Trees -- Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes -- The Space Complexity of Sum Labelling -- On Minimizing Regular Expressions Without Kleene Star -- Computational Complexity of Computing a Quasi-Proper Equilibrium -- Computational Complexity of Synchronization under Sparse Regular Constraints -- On Dasgupta’s hierarchical clustering objective and its relation to other graph parameter -- Mengerian Temporal Graphs Revisited -- Faster FPT Algorithms for Deletion to Pairs of Graph Classes -- Fast Algorithms for the Rooted Triplet Distance Between Caterpillars -- Deciding Top-Down Determinism of Regular Tree Languages -- Propositional Gossip Protocols -- Complexity of word problems for HNN-extensions -- On Finding Separators in Temporal Split and Permutation Graphs -- The Possible Winner Problem with Uncertain Weights Revisited -- Streaming Deletion Problems Parameterized by Vertex Cover -- On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits -- Concentration of Collision Estimator -- Valency-based Consensus under Message Adversaries without Limit-Closure. .

This book constitutes the proceedings of the 23rd International Symposium on Fundamentals of Computation Theory, FCT 2021, held in Athens, Greece, in September 2021. The 30 full papers included in this volume were carefully reviewed and selected from 94 submissions. In addition, the book contains 2 invited talks. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.

ISBN: 9783030865931

Standard No.: 10.1007/978-3-030-86593-1doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Fundamentals of Computation Theory = 23rd International Symposium, FCT 2021, Athens, Greece, September 12–15, 2021, Proceedings /
LDR:04017nam a22004095i 4500 001 1045843
003 DE-He213
005 20210911215739.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030865931 $9 978-3-030-86593-1
024 7 $a 10.1007/978-3-030-86593-1 $2 doi
035 $a 978-3-030-86593-1
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Fundamentals of Computation Theory $h [electronic resource] : $b 23rd International Symposium, FCT 2021, Athens, Greece, September 12–15, 2021, Proceedings / $c edited by Evripidis Bampis, Aris Pagourtzis.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XIX, 476 p. 74 illus., 24 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 12867
505 0 $a Invited papers -- Two sided matching markets with strongly correlated random preferences -- Communicating Finite state machines and an extensible toolchain for multiparty session types -- Contributed papers -- First-Order logic and its Infinitary Quantifier Extensions over Countable Words -- From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization -- A Poly-Log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider -- Computational Complexity of Covering Disconnected Multigraphs -- The Complexity of Bicriteria Tree-depth -- TS-Reconfiguration of Dominating Sets in circle and circular-arc graphs -- Bipartite 3-Regular Counting Problems with Mixed Signs -- The Satisfiability Problem for a Quantitative Fragment of PCTL -- Beyond the BEST Theorem: Fast Assessment of Eulerian Trails -- Regular Model Checking with Regular Relations -- Minimum Consistent Subset of Trees -- Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes -- The Space Complexity of Sum Labelling -- On Minimizing Regular Expressions Without Kleene Star -- Computational Complexity of Computing a Quasi-Proper Equilibrium -- Computational Complexity of Synchronization under Sparse Regular Constraints -- On Dasgupta’s hierarchical clustering objective and its relation to other graph parameter -- Mengerian Temporal Graphs Revisited -- Faster FPT Algorithms for Deletion to Pairs of Graph Classes -- Fast Algorithms for the Rooted Triplet Distance Between Caterpillars -- Deciding Top-Down Determinism of Regular Tree Languages -- Propositional Gossip Protocols -- Complexity of word problems for HNN-extensions -- On Finding Separators in Temporal Split and Permutation Graphs -- The Possible Winner Problem with Uncertain Weights Revisited -- Streaming Deletion Problems Parameterized by Vertex Cover -- On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits -- Concentration of Collision Estimator -- Valency-based Consensus under Message Adversaries without Limit-Closure. .
520 $a This book constitutes the proceedings of the 23rd International Symposium on Fundamentals of Computation Theory, FCT 2021, held in Athens, Greece, in September 2021. The 30 full papers included in this volume were carefully reviewed and selected from 94 submissions. In addition, the book contains 2 invited talks. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.
650 0 $a Algorithms. $3 527865
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Optical data processing. $3 639187
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Computer Imaging, Vision, Pattern Recognition and Graphics. $3 671334
700 1 $a Bampis, Evripidis. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 896851
700 1 $a Pagourtzis, Aris. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1141162
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030865924
776 0 8 $i Printed edition: $z 9783030865948
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-86593-1
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)