00913nam0-22003371i-450-9900030716004033210-226-11103-2000307160FED01000307160(Aleph)000307160FED0100030716020000920d1994----km-y0itay50------baitaITEssays on Economics and EconomistsRonald H. Coase.ChicagoUniversity of Chicago Press\c\\1994.VIII, 222 p.22 cmEconomistiBiografieD/0.2D/3.22D/7Coase,Ronald Harry<1910- >ITUNINARICAUNIMARCBK990003071600403321D/0.2 COA16980SESD/0.2 COA17394SESSESEssays on Economics and Economists464284UNINAING0105171nam 22007335 450 99646613210331620200702093541.03-540-48799-910.1007/BFb0020419(CKB)1000000000234179(SSID)ssj0000322686(PQKBManifestationID)11277539(PQKBTitleCode)TC0000322686(PQKBWorkID)10288256(PQKB)11773902(DE-He213)978-3-540-48799-9(PPN)155169262(EXLCZ)99100000000023417920121227d1994 u| 0engurnn|008mamaatxtccrDistributed Algorithms[electronic resource] 8th International Workshop, WDAG 1994, Terschelling, The Netherlands, September 29 - October 1, 1994. Proceedings /edited by Gerard Tel, Paul Vitanyi1st ed. 1994.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1994.1 online resource (X, 378 p.) Lecture Notes in Computer Science,0302-9743 ;857Bibliographic Level Mode of Issuance: Monograph3-540-58449-8 Replicated file management in large-scale distributed systems -- Realization of PRAMs: Processor design -- Factoring -- Primary partition “Virtually-synchronous communication” harder than consensus -- Secure distributed computing: Theory and practice -- Fast increment registers -- Coping with contention -- Exotic behaviour of consensus numbers -- Space-optimum conflict-free construction of 1-writer 1-reader multivalued atomic variable -- Linear-time snapshot using multi-writer multi-reader registers -- Fast, long-lived renaming -- Anomalies in the wait-free hierarchy -- Finding the extrema of a distributed multiset -- The level of handshake required for establishing a connection -- Local labeling and resource allocation using preprocessing -- A scalable approach to routing in ATM networks -- Low complexity network synchronization -- An incremental distributed algorithm for computing biconnected components -- Reaching (and maintaining) agreement in the presence of mobile faults -- Uniform deterministic self-stabilizing ring-orientation on odd-length rings -- Using failure detectors to solve consensus in asynchronous shared-memory systems -- An algorithm with optimal failure locality for the dining philosophers problem -- Average and randomized complexity of distributed problems -- Self-stabilization by local checking and global reset -- Breakpoints and time in distributed computations -- Cheaper matrix clocks.This volume presents the proceedings of the 8th International Workshop on Distributed Algorithms (WDAG '94), held on the island of Terschelling, The Netherlands in September 1994. Besides the 23 research papers carefully selected by the program committee, the book contains 3 invited papers. The volume covers all relevant aspects of distributed algorithms; the topics discussed include network protocols, distributed control and communication, real-time systems, dynamic algorithms, self-stabilizing algorithms, synchronization, graph algorithms, wait-free algorithms, mechanisms for security, replicating data, and distributed databases.Lecture Notes in Computer Science,0302-9743 ;857ComputersSoftware engineeringComputer programmingAlgorithmsComputer communication systemsTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Software Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Computation 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/I13022Computers.Software engineering.Computer programming.Algorithms.Computer communication systems.Theory of Computation.Software Engineering/Programming and Operating Systems.Computation by Abstract Devices.Programming Techniques.Algorithm Analysis and Problem Complexity.Computer Communication Networks.004/.36Tel Gerardedthttp://id.loc.gov/vocabulary/relators/edtVitanyi Pauledthttp://id.loc.gov/vocabulary/relators/edtInternational Workshop on Distributed AlgorithmsBOOK996466132103316Distributed algorithms382926UNISA