Isbn: 9780124045781 - distributed computing through combinatorial topology (17 risultati)

Paperback. Condizione: Very Good. This book is in very good condition; no remainder marks. It does have some cover shelfwear and corner wear. Inside pages are clean. ; Height: 9.25 Inches, Length: 7.5 Inches, Width: 0.76 Inches; 336 pages.

Paperback. Condizione: New. Brand new book, sourced directly from publisher. Dispatch time is 9-10 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Condizione: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.

Condizione: New.

Paperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days.

Condizione: New. In English.

Condizione: As New. Unread book in perfect condition.

Paperback. Condizione: New.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Taschenbuch. Condizione: Neu. Distributed Computing Through Combinatorial Topology | Maurice Herlihy (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2014 | Elsevier Inc | EAN 9780124045781 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu. …

Kartoniert / Broschiert. Condizione: New. Named a 2013 Notable Computer Book for Computing Methodologies by Computing Reviews Gathers knowledge otherwise spread across research and conference papers using consistent notations and a standard approach to facilitate understand.

Condizione: new. Questo è un articolo print on demand.

Paperback. Condizione: Brand New. 1st edition. 336 pages. 9.25x7.50x1.00 inches. In Stock. This item is printed on demand.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols. Today, a new student or researcher must assemble a collection of scattered conference publications, which are typically terse and commonly use different notations and terminologies. This book provides a self-contained explanation of the mathematics to readers with computer science backgrounds, as well as explaining computer science concepts to readers with backgrounds in applied mathematics. The first section presents mathematical notions and models, including message passing and shared-memory systems, failures, and timing models. The next section presents core concepts in two chapters each: first, proving a simple result that lends itself to examples and pictures that will build up readers' intuition; then generalizing the concept to prove a more sophisticated result. The overall result weaves together and develops the basic concepts of the field, presenting them in a gradual and intuitively appealing way. The book's final section discusses advanced topics typically found in a graduate-level course for those who wish to explore further. 334 pp. Englisch.…

Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols. Today, a new student or researcher must assemble a collection of scattered conference publications, which are typically terse and commonly use different notations and terminologies. This book provides a self-contained explanation of the mathematics to readers with computer science backgrounds, as well as explaining computer science concepts to readers with backgrounds in applied mathematics. The first section presents mathematical notions and models, including message passing and shared-memory systems, failures, and timing models. The next section presents core concepts in two chapters each: first, proving a simple result that lends itself to examples and pictures that will build up readers' intuition; then generalizing the concept to prove a more sophisticated result. The overall result weaves together and develops the basic concepts of the field, presenting them in a gradual and intuitively appealing way. The book's final section discusses advanced topics typically found in a graduate-level course for those who wish to explore further.…