iPhoneAlle anzeigen
iPhone 11iPhone 11 ProiPhone 11 Pro MaxiPhone 12iPhone 12 ProiPhone 12 Pro MaxiPhone 12 miniiPhone 13iPhone 13 ProiPhone 13 Pro MaxiPhone 13 miniiPhone 14iPhone 14 PlusiPhone 14 ProiPhone 14 Pro MaxiPhone 15iPhone 15 PlusiPhone 15 ProiPhone 15 Pro MaxiPhone 16iPhone 16 PlusiPhone 16 ProiPhone 16 Pro MaxiPhone 16eiPhone 8iPhone 8 PlusiPhone SE 2020iPhone SE 2022iPhone XiPhone XRiPhone XSiPhone XS Max
Galaxy A-SerieAlle anzeigen
Galaxy A12Galaxy A13Galaxy A13 5GGalaxy A14Galaxy A15Galaxy A16Galaxy A17 5GGalaxy A20eGalaxy A21Galaxy A22Galaxy A23Galaxy A24Galaxy A25Galaxy A26 5GGalaxy A32Galaxy A33Galaxy A34Galaxy A35Galaxy A36 5GGalaxy A37Galaxy A40Galaxy A41Galaxy A42Galaxy A50Galaxy A51Galaxy A52Galaxy A53Galaxy A54Galaxy A55Galaxy A56 5GGalaxy A57 5GGalaxy A70Galaxy A71Galaxy A72
Redmi SeriesAlle anzeigen
Redmi 10Redmi 13CRedmi 15 5GRedmi Note 10Redmi Note 10 ProRedmi Note 11Redmi Note 11 ProRedmi Note 11 Pro Plus 5GRedmi Note 11sRedmi Note 12Redmi Note 12 5GRedmi Note 12 ProRedmi Note 12 Pro 5GRedmi Note 12 Pro PlusRedmi Note 13Redmi Note 13 5GRedmi Note 13 ProRedmi Note 13 Pro PlusRedmi Note 14Redmi Note 14 Pro PlusRedmi Note 8Redmi Note 8 ProRedmi Note 9Redmi Note 9 Pro
- Startseite
Bücher Englische Bücher Wissen & Bildung Naturwissenschaft, Medizin, Informatik, Technik Informatik & EDV Datenkommunikation & Netzwerke Anonymous Distributed Computing
Derzeit nicht verfügbar
Handgeprüfte Gebrauchtware
Bis zu 50 % günstiger als neu
Der Umwelt zuliebe
Anonymous Distributed Computing
Jochen Seidel (Broschiert, Englisch)
★★★★★
☆☆☆☆☆ Keine Bewertungen vorhanden
Optischer Zustand
Beschreibung
This dissertation studies various aspects of computing in anonymous networks, where nodes are not equipped with unique identifiers. Nodes in the network exchange messages and each node computes some local output; the global output of the network is the combination of all local outputs. We focus mainly on randomized algorithms, beginning with the question “What can be computed in an anonymous… network?”.
Two classes of problems solvable in anonymous networks are defined, depending on whether nodes are allowed to revoke their outputs or not. We introduce and study the concept of a distributed oracle, which in yields a hierarchy of hard and complete problems for the classes. Several classic and/or characteristic problems in distributed computing are classified in terms of computability and hardness.
Access to random bits arguably has a huge impact on the computability in anonymous networks. In an effort to exactly characterize this impact, we prove that every problem that can be solved (and verified) by a randomized anonymous algorithm can also be solved by a deterministic anonymous algorithm provided that the latter is equipped with a 2-hop coloring of the input graph.
It is natural to ask how many random bits are required to solve any such problem. We find that the answer depends on the desired runtime of the algorithm. More precisely, we devise a randomized 2-hop coloring scheme that allows to trade an increase in runtime for a decrease in the random bit complexity. A lower bound we show yields that the trade-off achieved by our scheme is asymptotically optimal for any reasonable runtime, i.e., reducing the runtime must lead to an increase in the random bit complexity.
Lastly, we study local checkability of network properties like s-t reachability, or whether the network is acyclic or contains a cycle. A prover assigns a label to each node so that a verifier can check in constant time whether the property holds or not. We obtain asymptotically tight bounds for the label size of the latter two problems. For s-t reachability, we obtain a new asymptotically tight label size lower bound in one of our models, and devise an emulation technique that allows us to transfer a previously known upper bound without asymptotic loss in the bit complexity in another model. Dieses Produkt haben wir gerade leider nicht auf Lager.
Handgeprüfte Gebrauchtware
Bis zu 50 % günstiger als neu
Der Umwelt zuliebe
Technische Daten
Erscheinungsdatum
23.12.2015
Sprache
Englisch
EAN
9783866285576
Herausgeber
Hartung-Gorre
Serien- oder Bandtitel
Series in Distributed Computing
Sonderedition
Nein
Autor
Jochen Seidel
Seitenanzahl
136
Auflage
1
Einbandart
Broschiert
-.-
★★★★★
☆☆☆☆☆ Leider noch keine Bewertungen
Leider noch keine Bewertungen
Sicher bei rebuy kaufen
Schreib die erste Bewertung für dieses Produkt!
Wenn du eine Bewertung für dieses Produkt schreibst, hilfst du allen Kund:innen, die noch überlegen, ob sie das Produkt kaufen wollen. Vielen Dank, dass du mitmachst!
Sicher bei rebuy kaufen