01285nam--2200409---450-99000037665020331620090603104654.090-6544-603-60037665USA010037665(ALEPH)000037665USA01003766520010327d1992----km-y0itay0103----baengUS||||||||001yyAdvertising law in Europe and North AmericaJames R. Maxeiner and Peter Schotthöfer (editors)DeventerKluwer law and taxation1992XIII, 380 p.25 cm2001001-------2001PubblicitàLegislazioneEuropaPubblicitàLegislazioneAmerica settentrionale343.4082MAXEINER,James R.SCHOTTHÖFER,PeterITsalbcISBD990000376650203316XXIX.1.C 39 (IG XX 47)596 ECXXIX.1.C 39 (IG XX)00171485BKECOPATTY0220010327USA01133520020403USA011645PATRY9020040406USA011626RSIAV29020090603USA011046Advertising law in Europe and North America875238UNISA01091nam2-2200361---450-99000314421020331620080915111704.03-540-44389-4000314421USA01000314421(ALEPH)000314421USA0100031442120080915d2003----km-y0itay50------baengDEa---||||001yy<<Vol.C:>> Disjoint paths, hypergraphsAlexander SchrijverBerlin [etc.]Springercopyr. 2003XXXIII, 1881 p.ill.24 cmAlgorithms and combinatorics242001Algorithms and combinatorics0010003144122001Combinatorial optimizationOttimizzazione matematica519.3SCHRIJVER,Alexander351376ITsalbcISBD990003144210203316519.3 SCH/C37288/CBS519.300217719BKSCICBAS1020080915USA011117Disjoint paths, hypergraphs1016337UNISA06822nam 22007815 450 99646527870331620200704230100.03-540-30186-010.1007/b101206(CKB)1000000000212592(DE-He213)978-3-540-30186-8(SSID)ssj0000140120(PQKBManifestationID)11160774(PQKBTitleCode)TC0000140120(PQKBWorkID)10029348(PQKB)10464928(MiAaPQ)EBC3089078(PPN)155168363(EXLCZ)99100000000021259220121227d2004 u| 0engurnn#008mamaatxtrdacontentcrdamediacrrdacarrierDistributed Computing[electronic resource] 18th International Conference, DISC 2004, Amsterdam, The Netherlands, October 4-8, 2004. Proceedings /edited by Rachid Guerraoui1st ed. 2004.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2004.1 online resource (XIV, 470 p.)Lecture Notes in Computer Science,0302-9743 ;3274Bibliographic Level Mode of Issuance: Monograph3-540-23306-7 Includes bibliographical references and index.The Synchronous Condition-Based Consensus Hierarchy -- Synchronous Condition-Based Consensus Adapting to Input-Vector Legality -- Group-Solvability -- The Notion of Veto Number and the Respective Power of and to Solve One-Shot Agreement Problems -- The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms -- Local-Spin Group Mutual Exclusion Algorithms -- On Quorum Systems for Group Resources with Bounded Capacity -- Bounded Version Vectors -- An Optimistic Approach to Lock-Free FIFO Queues -- A Single-Enqueuer Wait-Free Queue Implementation -- Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CAS -- Efficient Adaptive Collect Using Randomization -- Nonblocking Concurrent Data Structures with Condition Synchronization -- Dynamic Memory ABP Work-Stealing -- Coupling and Self-stabilization -- Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings -- Virtual Mobile Nodes for Mobile Ad Hoc Networks -- Contention-Free MAC Protocols for Wireless Sensor Networks -- Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems -- A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion -- Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies -- Routing with Improved Communication-Space Trade-Off -- Active and Concurrent Topology Maintenance -- Distributed Weighted Matching -- Exploiting Content Localities for Efficient Search in P2P Systems -- Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs -- Towards a Theory of Consistency Primitives -- Fault-Tolerant Storage in a Dynamic Environment -- Non-skipping Timestamps for Byzantine Data Storage Systems -- Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty -- Optimal Dispersal of Certificate Chains -- On Byzantine Agreement over (2,3)-Uniform Hypergraphs.DISC, the International Symposium on Distributed Computing, is an annual conference for the presentation of research on the theory, design, analysis, implementation, and application of distributed systems and network. DISC 2004 was held on October 4–7, 2004, in Amsterdam, The Netherlands. There were 142 papers submitted to DISC this year. These were read and evaluated by the program committee members, assisted by external reviewers. The quality of submissions was high and we were unable to accept many dese- ing papers. Thirty one papers were selected at the program committee meeting in Lausanne to be included in these proceedings. The proceedings include an extended abstract of the invited talk by Ueli Maurer. In addition, they include a eulogy for Peter Ruzicka by Shmuel Zaks. The Best Student Paper Award was split and given to two papers: the paper “Efficient Adaptive Collect Using Randomization”, co-authored by Hagit Attiya, Fabian Kuhn, Mirjam Wattenhofer and Roger Wattenhofer, and the paper “Coupling and Self-stabilization”,co-authored by Laurent Fribourg, Stephane Messika and Claudine Picaronny. The support of the CWI and EPFL is gratefully acknowledged. The review process and the preparation of this volume were done using CyberChairPRO. I also thank Sebastien Baehni and Sidath Handurukande for their crucial help with these matters. August 2004 Rachid Guerraoui Peter Ruzicka 1947–2003 Peter died on Sunday, October 5, 2003, at the age of 56, after a short disease. He was a Professor of Informatics at the Faculty of Mathematics, Physics and Informatics in Comenius University, Bratislava, Slovakia. Those of us who knew him through DISC and other occasions mourn his death and cherish his memory.Lecture Notes in Computer Science,0302-9743 ;3274ComputersComputer communication systemsAlgorithmsComputer programmingOperating systems (Computers)Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Computer Communication Networkshttps://scigraph.springernature.com/ontologies/product-market-codes/I13022Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Programming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14045Computers.Computer communication systems.Algorithms.Computer programming.Operating systems (Computers).Theory of Computation.Computer Communication Networks.Algorithm Analysis and Problem Complexity.Programming Techniques.Computation by Abstract Devices.Operating Systems.004.36Guerraoui Rachidedthttp://id.loc.gov/vocabulary/relators/edtDISC 2004MiAaPQMiAaPQMiAaPQBOOK996465278703316Distributed computing104445UNISA01200nam 2200349Ia 450 99638603000331620200824132125.0(CKB)4940000000080308(EEBO)2240888910(OCoLC)ocm13172962e(OCoLC)13172962(EXLCZ)99494000000008030819860219d1694 uy |engurbn||||a|bb|The London dispensatory, reduced to the practice of the London physicians[electronic resource] wherein are contain'd the medicines, both Galenical and chymical, that are now in use ... /by John Pechey ..London Printed by F. Collins for J. Lawrence ...1694[24], 187, [5] pReproduction of original in Cambridge University Library.Includes index.eebo-0021DispensatoriesDispensatories.Pechey John1655-1716.1001834EAAEAAm/cWaOLNBOOK996386030003316The London dispensatory, reduced to the practice of the London physicians2366158UNISA