00920cam0 2200277 450 E60020002747920201203085234.088-420-3964-020070606d1992 |||||ita|0103 baitaITClero e società nell'Italia contemporaneaMario RosaRomaBariLaterza1992334 p.21 cmStoria e società001LAEC000150262001 *Storia e societàRosa, MarioA600200042133070139777ITUNISOB20201203RICAUNISOBUNISOB900|Coll|7|K73290E600200027479M 102 Monografia moderna SBNM900|Coll|7|K000166Si73290acquistopregresso1UNISOBUNISOB20070606093700.020201203085234.0rovitoClero e società nell'Italia contemporanea843854UNISOB01546nam0 22003731i 450 UON0028366820231205103848.61485-326-3212-285-326-3280-720061113d2005 |0itac50 baporBR|||| |||||Virtudes para um outro mundo possivelLeonardo BoffRio de Janeiro : Vozes2005-20062 vv.23 cmVol. 1.HospitalidadeUON00376792Hospitalidade : direito e dever de todosUON00376793Convivencia, respeito e toleranciaTOLLERANZAUONC024445FIRELAZIONI INTERPERSONALIUONC058074FIRISPETTOUONC064294FICONVIVENZAUONC064295FIPetrópolis (Rio de Janeiro)UONL003837304.2Fattori influenzanti il comportamento sociale. Ecologia umana21302Interazione sociale21BOFFLeonardoUONV169866205946VozesUONV270237650ITSOL20240220RICAUON00283668SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI Bras XII 0075/1 SI DA 1497 5 0075/1 SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI Bras XII 0075/2 SI DA 1498 5 0075/2 Virtudes para um outro mundo possivel1245874UNIOR04955nam 22006975 450 991050300330332120251225175005.03-030-86593-210.1007/978-3-030-86593-1(CKB)4100000012025936(MiAaPQ)EBC6725057(Au-PeEL)EBL6725057(OCoLC)1268267432(DE-He213)978-3-030-86593-1(PPN)258051442(EXLCZ)99410000001202593620210911d2021 u| 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierFundamentals of Computation Theory 23rd International Symposium, FCT 2021, Athens, Greece, September 12–15, 2021, Proceedings /edited by Evripidis Bampis, Aris Pagourtzis1st ed. 2021.Cham :Springer International Publishing :Imprint: Springer,2021.1 online resource (491 pages)Theoretical Computer Science and General Issues,2512-2029 ;128673-030-86592-4 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 onHereditary 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.Theoretical Computer Science and General Issues,2512-2029 ;12867AlgorithmsData structures (Computer science)Information theoryComputer scienceMathematicsImage processingDigital techniquesComputer visionDesign and Analysis of AlgorithmsData Structures and Information TheoryMathematics of ComputingComputer Imaging, Vision, Pattern Recognition and GraphicsAlgorithms.Data structures (Computer science).Information theory.Computer scienceMathematics.Image processingDigital techniques.Computer vision.Design and Analysis of Algorithms.Data Structures and Information Theory.Mathematics of Computing.Computer Imaging, Vision, Pattern Recognition and Graphics.004.0151Bampis EvripidisPagourtzis ArisMiAaPQMiAaPQMiAaPQBOOK9910503003303321Fundamentals of Computation Theory2557870UNINA