01330nam1 2200397 450 99000577874020331620121112145811.0000577874USA01000577874(ALEPH)000577874USA0100057787420121112d--------km-y0itay0103----baitaIT||||||||001yy<<I>> quaderni di Avallonrivista di studi sull'uomo e sul sacroRiminiIl cerchiovolumi22 cmQuadrimestrale0019900057787802033162001 <<Vol. 7:>> Scienza e conoscenza0019900057788102033162001 <<Vol. 16:>> Pace, cultura,religioni0019900057788302033162001 <<Vol. 5:>> <<Il>> sacro e il politico0019900057788502033162001 <<Vol. 24:>> Fine dei tempi fine del millennioReligione [e] SocietàBNCF261.1ITsalbcISBD990005778740203316II.2. /7-8-9L.M.II.2.BKUMAPASSARO9020121112USA011429PASSARO9020121112USA011452PASSARO9020121112USA011458PATRY9020140826USA011633Quaderni di Avallon893624UNISA01010cam0-22003251i-450-99000465062040332120040518093310.0000465062FED01000465062(Aleph)000465062FED0100046506219990604d1938----km-y0itay50------baitaITy-------001yyRubriche della polizia piemontese(1821-1848)a cura del R. Archivio di Stato di TorinoRomaVittoriano1938XXIII, 229 p.25 cmRegio Istituto per la Storia del Risorgimento Italiano. Biblioteca scientificaII serieFonti24Risorgimento italiano1821-1848364.13ITUNINARICAUNIMARCBK990004650620403321CONT.39(24)Bibl.15216FLFBCXXXII Ant. 18336326FSPBCFLFBCFSPBCRubriche della polizia piemontese554115UNINA01808nam0 22002893i 450 VAN010982220221206031058.12988-14-18043-120170609d2013 |0itac50 baitaIT|||| |||||Dall'assicurazione obbligatoria R. C. auto alla no-fault insuranceuno studio comparativo dei sistemi di traffic accident compensationValentina Vincenza CuocciMilanoGiuffrè2013XVI, 277 p.24 cm.001VAN00991332001 Università degli studi di Foggia, Dipartimento di Giurisprudenza. Scuola di specializzazione per le professioni legali210 MilanoGiuffrè300 L' editore varia: Pacini dal 201844MilanoVANL000284CuocciValentina VincenzaVANV084983617985GiuffrèVANV109181650ITSOL20221209RICAhttps://books.google.it/books?id=3jLZTc_ubkUC&printsec=frontcover&hl=ithttps://books.google.it/books?id=3jLZTc_ubkUC&printsec=frontcover&hl=it/sebina/repository/catalogazione/documenti/Dall'assicurazione obbligatoria R. C. auto alla no-fault insurance - uno studio comparativo dei sistemi di traffic accident compensation.pdfDall'assicurazione obbligatoria R. C. auto alla no-fault insurance - uno studio comparativo dei sistemi di traffic accident compensation.pdfBIBLIOTECA DEL DIPARTIMENTO DI SCIENZE POLITICHE JEAN MONNETIT-CE0182VAN04VAN0109822BIBLIOTECA DEL DIPARTIMENTO DI SCIENZE POLITICHE JEAN MONNET04CONS IV.B.m.16 04OMA372 20170609 Dall'assicurazione obbligatoria R. C. auto alla no-fault insurance1075170UNISOB06726nam 22006975 450 99619967930331620230330053047.03-662-45174-310.1007/978-3-662-45174-8(CKB)3710000000249798(SSID)ssj0001354106(PQKBManifestationID)11705813(PQKBTitleCode)TC0001354106(PQKBWorkID)11317616(PQKB)11104299(DE-He213)978-3-662-45174-8(MiAaPQ)EBC6294774(MiAaPQ)EBC5595435(Au-PeEL)EBL5595435(OCoLC)892338863(PPN)181352281(EXLCZ)99371000000024979820140929d2014 u| 0engurnn#008mamaatxtccrDistributed Computing[electronic resource] 28th International Symposium DISC 2014, Austin, TX, USA, October 12-15, 2014, Proceedings /edited by Fabian Kuhn1st ed. 2014.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2014.1 online resource (XXIV, 574 p. 76 illus.)Theoretical Computer Science and General Issues,2512-2029 ;8784Includes index.3-662-45173-5 Concurrency -- Automatically Adjusting Concurrency to the Level of Synchrony -- Biological and Chemical Networks -- Speed Faults in Computation by Chemical Reaction Networks -- Fault-Tolerant ANTS -- Task Allocation in Ant Colonies -- Agreement Problems -- Communication-Efficient Randomized Consensus -- Tight Bound on Mobile Byzantine Agreement -- Unbeatable Consensus -- Reliable Broadcast with Respect to Topology Knowledge -- Robot Coordination, Scheduling -- Evacuating Robots via Unknown Exit in a Disk -- Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile Robots -- A Theoretical Foundation for Scheduling and Designing Heterogeneous Processors for Interactive Applications -- Graph Distances and Routing -- Vertex Fault Tolerant Additive Spanners -- Close to Linear Space Routing Schemes -- Near-Optimal Distributed Tree Embedding -- Radio Networks -- Deterministic Leader Election in Multi-hop Beeping Networks (Extended Abstract) -- Who Are You? Secure Identities in Ad Hoc Networks -- Approximate Local Sums and Their Applications in Radio Networks -- Radio Network Lower Bounds Made Easy -- Shared Memory -- On Correctness of Data Structures under Reads-Write Concurrency -- Solo-Fast Universal Constructions for Deterministic Abortable Objects -- Space Bounds for Adaptive Renaming -- Dynamic and Social Networks Lower Bounds for Structuring Unreliable Radio Networks -- Random Walks on Evolving Graphs with Recurring Topologies -- Randomized Rumor Spreading in Poorly Connected Small-World Networks -- Relativistic Systems -- Making Sense of Relativistic Distributed Systems -- Transactional Memory and Concurrent Data Structures -- Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient -- Decomposing Opacity -- The Adaptive Priority Queue with Elimination and Combining -- Improving Average Performance by Relaxing Distributed Data Structures -- Distributed Graph Algorithms -- Almost-Tight Distributed Minimum Cut Algorithms -- Distributed Algorithms for Coloring Interval Graphs -- Distributed Symmetry Breaking in Hypergraphs -- Communication -- On Streaming and Communication Complexity of the Set Cover Problem -- On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model -- Near-Constant-Time Distributed Algorithms on a Congested Clique -- Brief Announcement: Replacement - Handling Failures in a Replicated State Machine -- Brief Announcement: The Power of Scheduling-Aware Synchronization -- Brief Announcement: Assignment of Different-Sized Inputs in MapReduce -- Brief Announcement: Scheduling Multiple Objects in Distributed Transactional Memory -- Brief Announcement: Relaxing Opacity in Pessimistic Transactional Memory -- Brief Announcement: A Practical Transactional Memory Interface -- Brief Announcement: On Dynamic and Multi-functional Labeling Schemes -- Brief Announcement: Update Consistency in Partitionable Systems -- Brief Announcement: Breaching the Wall of Impossibility Results on Disjoint-Access Parallel TM -- Brief Announcement: COP Composition Using Transaction Suspension in the Compiler -- Brief Announcement: Non-blocking Monitor Executions for Increased Parallelism -- Brief Announcement: Agreement in Partitioned Dynamic Networks -- Brief Announcement: The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm -- Brief Announcement: k-Selection and Sorting in the SINR Model -- Brief Announcement: Distributed 3/2-Approximation of the Diameter -- Brief Announcement: Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes -- Brief Announcement: Secure Anonymous Broadcast -- Brief Announcement: Privacy-Preserving Location-Based Services.This book constitutes the proceedings of the 28th International Symposium on Distributed Computing, DISC 2014, held in Austin, TX, USA, in October 2014. The 35 full papers presented in this volume were carefully reviewed and selected from 148 full paper submissions. In the back matter of the volume a total of 18 brief announcements is presented. The papers are organized in topical sections named: concurrency; biological and chemical networks; agreement problems; robot coordination and scheduling; graph distances and routing; radio networks; shared memory; dynamic and social networks; relativistic systems; transactional memory and concurrent data structures; distributed graph algorithms; and communication.Theoretical Computer Science and General Issues,2512-2029 ;8784AlgorithmsComputer networksData structures (Computer science)Information theoryAlgorithmsComputer Communication NetworksData Structures and Information TheoryAlgorithms.Computer networks.Data structures (Computer science).Information theory.Algorithms.Computer Communication Networks.Data Structures and Information Theory.004.36Kuhn Fabianedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK996199679303316Distributed computing104445UNISA