scientific article; zbMATH DE number 1179121

Hagit Attiya, Jennifer Lundelius Welch

Publication date: 26 July 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

distributed systems distributed computing

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

Collapsibility of read/write models using discrete Morse theory ⋮ A case study on parametric verification of failure detectors ⋮ Synchronous condition-based consensus ⋮ Performing work in broadcast networks ⋮ The \(k\)-simultaneous consensus problem ⋮ Two absolute bounds for distributed bit complexity ⋮ Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time ⋮ Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority ⋮ Distributed universality ⋮ Tight Bounds for Asynchronous Renaming ⋮ Built-in coloring for highly-concurrent doubly-linked lists ⋮ Terminating distributed construction of shapes and patterns in a fair solution of automata ⋮ Structure theory of flip graphs with applications to weak symmetry breaking ⋮ Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems ⋮ The topology of distributed adversaries ⋮ Anonymous asynchronous systems: the case of failure detectors ⋮ Secure multi-party computation in large networks ⋮ Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time ⋮ Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds ⋮ Who are you? Secure identities in single hop ad hoc networks ⋮ A distributed approximation algorithm for the bottleneck connected dominating set problem ⋮ Stateless Information Dissemination Algorithms ⋮ The solvability of consensus in iterated models extended with safe-consensus ⋮ Renaming and the weakest family of failure detectors ⋮ Fault-tolerant graph realizations in the congested clique ⋮ The limits of helping in non-volatile memory data structures ⋮ Reaching consensus in the presence of contention-related crash failures ⋮ Multidimensional agreement in Byzantine systems ⋮ Verification of distributed systems with local-global predicates ⋮ Using asynchrony and zero degradation to speed up indulgent consensus protocols ⋮ Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes ⋮ Relationships between broadcast and shared memory in reliable anonymous distributed systems ⋮ Unnamed Item ⋮ A family of optimal termination detection algorithms ⋮ Failure detectors as type boosters ⋮ Renaming in synchronous message passing systems with Byzantine failures ⋮ The weakest failure detectors to boost obstruction-freedom ⋮ Locality and checkability in wait-free computing ⋮ Time-efficient read/write register in crash-prone asynchronous message-passing systems ⋮ Distributed Graph Algorithms and their Complexity: An Introduction ⋮ Making Asynchronous Distributed Computations Robust to Channel Noise ⋮ Assigning labels in an unknown anonymous network with a leader ⋮ Long lived adaptive splitter and applications ⋮ Adaptive and efficient mutual exclusion ⋮ Hundreds of impossibility results for distributed computing ⋮ Randomized protocols for asynchronous consensus ⋮ Condition-based consensus solvability: a hierarchy of conditions and efficient protocols ⋮ Linear space bootstrap communication schemes ⋮ Threshold protocols in survivor set systems ⋮ The complexity of updating snapshot objects ⋮ Help when needed, but no more: efficient read/write partial snapshot ⋮ Known Unknowns: Time Bounds and Knowledge of Ignorance ⋮ Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds ⋮ Partially Ordered Knowledge Sharing and Fractionated Systems in the Context of other Models for Distributed Computing ⋮ Randomized mutual exclusion on a multiple access channel ⋮ Sparse covers for planar graphs and graphs that exclude a fixed minor ⋮ Efficient algorithms for anonymous Byzantine agreement ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ What Can be Computed in a Distributed System? ⋮ Practically stabilizing SWMR atomic memory in message-passing systems ⋮ Partition consistency. A case study in modeling systems with weak memory consistency and proving correctness of their implementations ⋮ Distributed agreement in tile self-assembly ⋮ A survey of challenges for runtime verification from advanced application domains (beyond software) ⋮ Transmitting once to elect a leader on wireless networks ⋮ Strong order-preserving renaming in the synchronous message passing model ⋮ A simple Byzantine generals protocol ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ How long it takes for an ordinary node with an ordinary ID to output? ⋮ New combinatorial topology bounds for renaming: the lower bound ⋮ Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects ⋮ Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations ⋮ Wait-freedom with advice ⋮ A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks ⋮ An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems ⋮ Labeling schemes for tree representation ⋮ Locality and Checkability in Wait-Free Computing ⋮ Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers ⋮ Structured Derivation of Semi-Synchronous Algorithms ⋮ How Many Cooks Spoil the Soup? ⋮ Asynchronous Coordination Under Preferences and Constraints ⋮ Concurrent Use of Write-Once Memory ⋮ In the Search for Optimal Concurrency ⋮ t-Resilient Immediate Snapshot Is Impossible ⋮ How many cooks spoil the soup? ⋮ On the Complexity of Universal Leader Election ⋮ Computing (and Life) Is All about Tradeoffs ⋮ Election in fully anonymous shared memory systems: tight space bounds and algorithms ⋮ Unnamed Item ⋮ Distributed probabilistic polling and applications to proportionate agreement ⋮ Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications ⋮ Distributed agreement in dynamic peer-to-peer networks