01513cam2-22004691--450-99000824274040332120080215112506.0000824274FED01000824274(Aleph)000824274FED0100082427420051207g19671968km-y0itay50------baitaITy---n---001yy<<L'>>ordinamento comunale e provincialeVicenzaNeri Pozza1967-19682 v.25 cm1.: I Comuni / a cura di Massimo Severo Giannini2.: Le province / a cura di Antonio Amorth0010008111372001Atti del congresso celebrativo del centenario delle leggi amministrative di unificazione sotto l'alto patronato del Presidente della Repubblica3342.450 619342.029221itaGiannini,Massimo Severo<1915-2000>Amorth,AntonioITUNINARICAUNIMARCBK990008242740403321F 202411DSSVI M 5 (1-2)86697FGBCI G 153784FSPBCI G 163784FSPBC342.02 AMO 1 (1)I.st.r.c.1658FLFBC342.02 AMO 1 (2)I.st.r.c.1657FLFBCF 202 (3)411DSSVI H 151250DDADSSDDAFSPBCFLFBCFGBCOrdinamento comunale e provinciale737224UNINA05369nam 22007215 450 99646589080331620200706042328.03-540-48029-310.1007/3-540-57271-6(CKB)1000000000234024(SSID)ssj0000322684(PQKBManifestationID)11233038(PQKBTitleCode)TC0000322684(PQKBWorkID)10289880(PQKB)11348399(DE-He213)978-3-540-48029-7(PPN)155223658(EXLCZ)99100000000023402420121227d1993 u| 0engurnn|008mamaatxtccrDistributed Algorithms[electronic resource] 7th International Workshop, WDAG `93, Lausanne, Switzerland, September 27-29, 1993. Proceedings /edited by Andre Schiper1st ed. 1993.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1993.1 online resource (IX, 331 p.) Lecture Notes in Computer Science,0302-9743 ;725Bibliographic Level Mode of Issuance: Monograph3-540-57271-6 Efficient wait-free implementation of a concurrent priority queue -- Binary snapshots -- Linear-time snapshot protocols for unbalanced systems -- Towards a necessary and sufficient condition for wait-free synchronization (Extended Abstract) -- Efficient algorithms for checking the atomicity of a run of read and write operations -- Benign failure models for shared memory -- Generalized agreement between concurrent fail-stop processes -- Controlling memory access concurrency in efficient fault-tolerant parallel algorithms (extended abstract) -- Asynchronous epoch management in replicated databases -- Crash resilient communication in dynamic networks -- Distributed job scheduling using snapshots -- Optimal time self stabilization in dynamic systems -- Tolerating transient and permanent failures (extended abstract) -- Quick atomic broadcast -- Time bounds for decision problems in the presence of timing uncertainty and failures -- Boolean Routing -- Notes on sorting and counting networks (extended abstract) -- A simple, efficient algorithm for maximum finding on rings -- Wang tilings and distributed orientation on anonymous torus networks (extended abstract) -- Fairness of N-party synchronization and its implementation in a distributed environment -- Programming distributed reactive systems: A strong and weak synchronous coupling -- Using message semantics to reduce rollback in the time warp mechanism.This volume presents the proceedings of the Seventh International Workshop on Distributed Algorithms (WDAG 93), held in Lausanne, Switzerland, September 1993. It contains 22 papers selected from 72 submissions. The selection was based on originality, quality, and relevance to the field of distributed computing: 6 papers are from Europe, 13 from North America, and 3 from the Middle East. The papers discuss topics from all areas of distributed computing and their applications, including distributed algorithms for control and communication, fault-tolerant distributed algorithms, network protocols, algorithms for managing replicated data, protocols for real-time distributed systems, issues of asynchrony, synchrony and real-time, mechanisms for security in distributed systems, techniques for the design and analysis of distributed algorithms, distributed database techniques, distributed combinatorial and optimization algorithms, and distributed graph algorithms.Lecture Notes in Computer Science,0302-9743 ;725ComputersComputer programmingAlgorithmsComputer communication systemsOperating systems (Computers)Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Programming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Computer Communication Networkshttps://scigraph.springernature.com/ontologies/product-market-codes/I13022Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14045Computers.Computer programming.Algorithms.Computer communication systems.Operating systems (Computers).Theory of Computation.Computation by Abstract Devices.Programming Techniques.Algorithm Analysis and Problem Complexity.Computer Communication Networks.Operating Systems.004/.36Schiper Andreedthttp://id.loc.gov/vocabulary/relators/edtInternational Workshop on Distributed Algorithms(7th :1993 :Lausanne, Switzerland)BOOK996465890803316Distributed algorithms382926UNISA