Fault Tolerance in Networks of Bounded Degree
From MaRDI portal
Publication:3823119
DOI10.1137/0217061zbMath0669.68007OpenAlexW1971817342MaRDI QIDQ3823119
Eli Upfal, Cynthia Dwork, David Peleg, Nicholas J. Pippenger
Publication date: 1988
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1118&context=hmc_fac_pub
Related Items
Oblivious transfer in incomplete networks, Lower bound for scalable Byzantine agreement, Instant block confirmation in the sleepy model, Agreement in synchronous networks with ubiquitous faults, Robust gossiping with an application to consensus, Secure multi-party computation in large networks, Large fault-tolerant interconnection networks, Is information-theoretic topology-hiding computation possible?, Coordinated consensus in dynamic networks, Error-free multi-valued consensus with byzantine failures, Distributed graph coloring in a few rounds, MIS on trees, Toward more localized local algorithms, The complexity of robust atomic storage, Resilience of mutual exclusion algorithms to transient memory faults, The impact of memory models on software reliability in multiprocessors, A complexity separation between the cache-coherent and distributed shared memory models, From bounded to unbounded concurrency objects and back, The space complexity of long-lived and one-shot timestamp implementations, Locally checkable proofs, Fault-tolerant spanners, Adaptively secure broadcast, revisited, Scalable rational secret sharing, Analyzing consistency properties for fun and profit, Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions, Optimal-time adaptive strong renaming, with applications to counting, The round complexity of distributed sorting, A tight unconditional lower bound on distributed randomwalk computation, Minimum congestion mapping in a cloud, Conflict on a communication channel, Stability of a peer-to-peer communication system, Tight bounds on information dissemination in sparse mobile networks, Time-efficient randomized multiple-message broadcast in radio networks, Faster information dissemination in dynamic networks via network coding, Broadcast (and Round) Efficient Verifiable Secret Sharing, Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party, The complexity of open k-monopolies in graphs for negative k, Bounding the open \(k\)-monopoly number of strong product graphs, Practical provably secure flooding for blockchains, On private computation in incomplete networks, Order optimal information spreading using algebraic gossip, Must the communication graph of MPC protocols be an expander?, Dynamics of random graphs with bounded degrees, Fast and compact self-stabilizing verification, computation, and fault detection of an MST, Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks, Doing-it-all with bounded work and communication, Structuring unreliable radio networks, Byzantine agreement with homonyms, Distributed deterministic edge coloring using bounded neighborhood independence, Compact policy routing, Efficient reliable communication over partially authenticated networks, Distributed Corruption Detection in Networks, Fault-Tolerant Consensus with an Abstract MAC Layer., Reliable communication over partially authenticated networks, Leader Election in Sparse Dynamic Networks with Churn, Xheal, Dynamic monopolies of constant size, Unnamed Item, Fast consensus in networks of bounded degree., Local majorities, coalitions and monopolies in graphs: A review, Distributed agreement in dynamic peer-to-peer networks, Efficient constructions for almost-everywhere secure computation
