001439659 000__ 05478cam\a2200697\i\4500
001439659 001__ 1439659
001439659 003__ OCoLC
001439659 005__ 20230309004513.0
001439659 006__ m\\\\\o\\d\\\\\\\\
001439659 007__ cr\cn\nnnunnun
001439659 008__ 210916s2021\\\\sz\a\\\\o\\\\\101\0\eng\d
001439659 019__ $$a1268574509
001439659 020__ $$a9783030865931$$q(electronic bk.)
001439659 020__ $$a3030865932$$q(electronic bk.)
001439659 020__ $$z9783030865924$$q(print)
001439659 0247_ $$a10.1007/978-3-030-86593-1$$2doi
001439659 035__ $$aSP(OCoLC)1268267432
001439659 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dOCLCO$$dDKU$$dEBLCP$$dOCLCF$$dOCLCO$$dOCLCQ$$dCOM$$dOCLCO$$dOCLCQ
001439659 049__ $$aISEA
001439659 050_4 $$aQA75.5
001439659 08204 $$a004$$223
001439659 1112_ $$aFCT (Symposium)$$n(23rd :$$d2021 :$$cOnline)
001439659 24510 $$aFundamentals of computation theory :$$b23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings /$$cEvripidis Bampis, Aris Pagourtzis (eds.).
001439659 2463_ $$aFCT 2021
001439659 264_1 $$aCham, Switzerland :$$bSpringer,$$c2021.
001439659 300__ $$a1 online resource (xix, 476 pages) :$$billustrations (some color)
001439659 336__ $$atext$$btxt$$2rdacontent
001439659 337__ $$acomputer$$bc$$2rdamedia
001439659 338__ $$aonline resource$$bcr$$2rdacarrier
001439659 347__ $$atext file
001439659 347__ $$bPDF
001439659 4901_ $$aLecture notes in computer science ;$$v12867
001439659 4901_ $$aAdvanced research in computing and software science
001439659 4901_ $$aLNCS sublibrary, SL 1, Theoretical computer science and general issues
001439659 500__ $$a"The 23rd International Symposium on Fundamentals of Computation Theory (FCT2021) was hosted virtually ..."--Preface
001439659 500__ $$aIncludes author index.
001439659 5050_ $$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.
001439659 506__ $$aAccess limited to authorized users.
001439659 520__ $$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.
001439659 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed September 16, 2021).
001439659 650_0 $$aComputer science$$vCongresses.
001439659 650_0 $$aComputer science$$xMathematics$$vCongresses.
001439659 650_6 $$aInformatique$$vCongrès.
001439659 650_6 $$aInformatique$$xMathématiques$$vCongrès.
001439659 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001439659 655_7 $$aConference papers and proceedings.$$2lcgft
001439659 655_7 $$aActes de congrès.$$2rvmgf
001439659 655_0 $$aElectronic books.
001439659 7001_ $$aBampis, Evripidis,$$eeditor$$1https://orcid.org/0000-0002-4498-3040
001439659 7001_ $$aPagourtzis, Aris,$$eeditor$$1https://orcid.org/0000-0002-6220-3722
001439659 77608 $$iPrint version: $$z9783030865924
001439659 77608 $$iPrint version: $$z9783030865948
001439659 830_0 $$aLecture notes in computer science ;$$v12867.
001439659 830_0 $$aLecture notes in computer science.$$pAdvanced research in computing and software science.
001439659 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
001439659 852__ $$bebk
001439659 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-86593-1$$zOnline Access$$91397441.1
001439659 909CO $$ooai:library.usi.edu:1439659$$pGLOBAL_SET
001439659 980__ $$aBIB
001439659 980__ $$aEBOOK
001439659 982__ $$aEbook
001439659 983__ $$aOnline
001439659 994__ $$a92$$bISE