LEADER 00663nam0 2200241 450 001 9910633090703321 005 20221228103604.0 010 $a9781350094734 100 $a20221228d2017----km y0itay50 ba 101 0 $aeng 102 $aUS 105 $ay 001yy 200 1 $aMereology$ea philosophical introduction$fGiorgio Lando 210 $aLondon [etc.]$cBloomsbury Academic$d2017 215 $aVIII, 237 p.$d24 cm 700 1$aLando,$bGiorgio$0611841 801 0$aIT$bUNINA$gREICAT$2UNIMARC 901 $aBK 912 $a9910633090703321 952 $a111.82 LANG 01$b2021/4092$fFLFBC 959 $aFLFBC 996 $aMereology$92679544 997 $aUNINA LEADER 00855nam0-2200289 --450 001 9910675595303321 005 20230329153850.0 010 $a978-88-921-3703-5 010 $a978-88-921-9165-5$beBook-PDF 020 $aIT$b2020-9611 100 $a20230329d2020----kmuy0itay5050 ba 101 0 $aita$cita 102 $aIT 105 $a 001yy 200 1 $aFetialis religio$fGiovanni Turelli 210 $aTorino$cGiappichelli$d2020 215 $aXV, 120 p.$d24 cm 225 1 $aCollana del Dipartimento di giurisprudenza, Università degli studi di Brescia. I quaderni$v3 676 $a340.54$v23$zita 700 1$aTurelli,$bGiovanni$0515706 801 0$aIT$bUNINA$gREICAT$2UNIMARC 901 $aBK 912 $a9910675595303321 952 $aII C 125$b2021/1247$fFGBC 959 $aFGBC 996 $aFetialis religio$91867036 997 $aUNINA LEADER 01699nas 2200577- 450 001 996434739503316 005 20230123213018.0 011 $a2574-254X 035 $a(DE-599)ZDB2963932-3 035 $a(OCoLC)1001253638 035 $a(CKB)4930000000013008 035 $a(CONSER)--2017201867 035 $a(EXLCZ)994930000000013008 100 $a20170816a20189999 o-- a 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aChild and adolescent obesity 210 1$a[Abingdon, UK] :$cTaylor & Francis,$d[2018]- 215 $a1 online resource 300 $aRefereed/Peer-reviewed 517 1 $aChild & adolescent obesity 517 1 $aCHAO 531 10$aChild Adolesc Obes 531 0 $aChild adolesc. obes. 606 $aObesity in children$vPeriodicals 606 $aObesity in adolescence$vPeriodicals 606 $aObesity 606 $aChild 606 $aAdolescent 606 $aChild Nutritional Physiological Phenomena 606 $aObesity in children$2fast$3(OCoLC)fst01042770 606 $aObesity in adolescence$2fast$3(OCoLC)fst01042766 608 $aPeriodical. 608 $aPeriodicals.$2fast 610 $aPediatrics 615 0$aObesity in children 615 0$aObesity in adolescence 615 12$aObesity. 615 12$aChild. 615 22$aAdolescent. 615 22$aChild Nutritional Physiological Phenomena. 615 7$aObesity in children. 615 7$aObesity in adolescence. 676 $a618.92398 906 $aJOURNAL 912 $a996434739503316 996 $aChild and adolescent obesity$91905614 997 $aUNISA LEADER 07958nam 22007455 450 001 9910483840403321 005 20251226204140.0 010 $a3-540-44627-3 024 7 $a10.1007/11864219 035 $a(CKB)1000000000283818 035 $a(SSID)ssj0000317261 035 $a(PQKBManifestationID)11258601 035 $a(PQKBTitleCode)TC0000317261 035 $a(PQKBWorkID)10292651 035 $a(PQKB)11068299 035 $a(DE-He213)978-3-540-44627-9 035 $a(MiAaPQ)EBC3068239 035 $a(PPN)123138426 035 $a(EXLCZ)991000000000283818 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDistributed Computing $e20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings /$fedited by Shlomi Dolev 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XVI, 580 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4167 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-44624-9 320 $aIncludes bibliographical references and index. 327 $aExploring Gafni?s Reduction Land: From ? k to Wait-Free Adaptive -Renaming Via k-Set Agreement -- Exploring Gafni?s Reduction Land: From ? k to Wait-Free Adaptive -Renaming Via k-Set Agreement -- Renaming in Message Passing Systems with Byzantine Failures -- Built-In Coloring for Highly-Concurrent Doubly-Linked Lists -- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering -- Fast Computation by Population Protocols with a Leader -- On Self-stabilizing Search Trees -- Efficient Dynamic Aggregation -- Groupings and Pairings in Anonymous Networks -- A New Proof of the GHS Minimum Spanning Tree Algorithm -- A Knowledge-Based Analysis of Global Function Computation -- Checking a Multithreaded Algorithm with ?+?CAL -- Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium Architecture -- Conflict Detection and Validation Strategies for Software Transactional Memory -- Transactional Locking II -- Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects -- One-Step Consensus Solvability -- Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols -- On Consistency of Encrypted Files -- Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data -- A Lazy Snapshot Algorithm with Eager Validation -- Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients -- Time and Communication Efficient Consensus for Crash Failures -- Subconsensus Tasks: Renaming Is Weaker Than Set Agreement -- Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes -- A Fast Distributed Approximation Algorithm for Minimum Spanning Trees -- On Randomized Broadcasting in Power Law Networks -- Distributed Approximation Algorithms in Unit-Disk Graphs -- TheWeakest Failure Detectors to Boost Obstruction-Freedom -- Fully-Adaptive Algorithms for Long-Lived Renaming -- Constructing Shared Objects That Are Both Robust and High-Throughput -- Byzantine and Multi-writer K-Quorums -- On Minimizing the Number of ADMs in a General Topology Optical Network -- Robust Network Supercomputing with Malicious Processes -- Distributed Resource Allocation in Stream Processing Systems -- Low-latency Atomic Broadcast in the presence of contention -- Oblivious Gradient Clock Synchronization -- Brief Announcement: Abortable and Query-Abortable Objects -- Brief Announcement: Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers -- Brief Announcement: Convergence Analysis of Scalable Gossip Protocols -- Brief Announcement: Computing Automatically the Stabilization Time Against the Worst and the Best Schedules -- Brief Announcement: Many Slices Are Better Than One -- Brief Announcement: On Augmented Graph Navigability -- Brief Announcement: Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems -- Brief Announcement: Optimistic Algorithms for Partial Database Replication -- Brief Announcement: Performance Analysis of Cyclon, an Inexpensive Membership Management for Unstructured P2P Overlays -- Brief Announcement: Decentralized, Connectivity-Preserving, and Cost-Effective Structured Overlay Maintenance -- Brief Announcement Monitoring of Linear Distributed Computations -- Brief Announcement: Communication-Optimal Implementation of Failure Detector Class -- Brief Announcement: Synchronous Distributed Algorithms for Node Discovery and Configuration in Multi-channel Cognitive Radio Networks -- Invited Talks -- Provably Unbreakable Hyper-encryption Using Distributed Systems -- Time, Clocks, and the Ordering of My Ideas AboutDistributed Systems -- My Early Days in Distributed Computing Theory: 1979?1982 -- Panel on the Contributions of the DISC Community to Distributed Computing: A Historical Perspective -- DISC at Its 20th Anniversary:Past, Present and Future -- Erratum -- DISC at Its 20th Anniversary: Past, Present and Future. 330 $aDISC, the International Symposium on DIStributed Computing, is an annual forum for presentation of research on all facets of distributed computing, inc- ding the theory, design, analysis, implementation, and application of distributed systems and networks. The 20th anniversary edition of DISC was held on S- tember 18-20, 2006, in Stockholm, Sweden. There were 145 extended abstracts submitted to DISC this year, and this - lume contains the 35 contributions selected by the Program Committee and one invited paper among these 145 submissions. All submitted papers were read and evaluated by at least three Program Committee members, assisted by external reviewers. The ?nal decision regarding every paper was taken during the P- gram Committee meeting, which took place in Beer-Sheva, June 30 and July 1, 2006. The Best Student Award was split and given to two papers: the paper ?- act Distance Labelings Yield Additive-Stretch Compact Routing Schemes,? by Arthur Bradly, and Lenore Cowen, and the paper ?A Fast Distributed App- ximation Algorithm for Minimum Spanning Trees? co-authored by Maleq Khan and Gopal Pandurangan. The proceedings also include 13 three-page-long brief announcements (BA). TheseBAsarepresentationsofongoingworksforwhichfullpapersarenotready yet, or of recent results whose full description will soon be or has been recently presented in other conferences. Researchers use the BA track to quickly draw the attention of the community to their experiences, insights and results from ongoing distributed computing research and projects. The BAs included in this proceedings volume were selected among 26 BA submissions. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4167 606 $aComputer science 606 $aComputer networks 606 $aAlgorithms 606 $aComputer programming 606 $aOperating systems (Computers) 606 $aTheory of Computation 606 $aComputer Communication Networks 606 $aAlgorithms 606 $aProgramming Techniques 606 $aOperating Systems 615 0$aComputer science. 615 0$aComputer networks. 615 0$aAlgorithms. 615 0$aComputer programming. 615 0$aOperating systems (Computers). 615 14$aTheory of Computation. 615 24$aComputer Communication Networks. 615 24$aAlgorithms. 615 24$aProgramming Techniques. 615 24$aOperating Systems. 676 $a004.0151 701 $aDolev$b Shlomi$01369733 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483840403321 996 $aDistributed computing$94201315 997 $aUNINA