LEADER 04956nam 22006975 450 001 9910503003303321 005 20230515184632.0 010 $a3-030-86593-2 024 7 $a10.1007/978-3-030-86593-1 035 $a(CKB)4100000012025936 035 $a(MiAaPQ)EBC6725057 035 $a(Au-PeEL)EBL6725057 035 $a(OCoLC)1268267432 035 $a(DE-He213)978-3-030-86593-1 035 $a(PPN)258051442 035 $a(EXLCZ)994100000012025936 100 $a20210911d2021 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFundamentals of Computation Theory $e23rd International Symposium, FCT 2021, Athens, Greece, September 12?15, 2021, Proceedings /$fedited by Evripidis Bampis, Aris Pagourtzis 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (491 pages) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12867 311 $a3-030-86592-4 327 $aInvited 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. . 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12867 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer science$xMathematics 606 $aImage processing$xDigital techniques 606 $aComputer vision 606 $aDesign and Analysis of Algorithms 606 $aData Structures and Information Theory 606 $aMathematics of Computing 606 $aComputer Imaging, Vision, Pattern Recognition and Graphics 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aComputer science$xMathematics. 615 0$aImage processing$xDigital techniques. 615 0$aComputer vision. 615 14$aDesign and Analysis of Algorithms. 615 24$aData Structures and Information Theory. 615 24$aMathematics of Computing. 615 24$aComputer Imaging, Vision, Pattern Recognition and Graphics. 676 $a004.0151 702 $aBampis$b Evripidis 702 $aPagourtzis$b Aris 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910503003303321 996 $aFundamentals of Computation Theory$92557870 997 $aUNINA