scientific article

From MaRDI portal
Publication:2782251

zbMath1026.93001MaRDI QIDQ2782251

Shlomi Dolev

Publication date: 15 April 2002


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



Related Items

On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency, \textit{Renaissance}: a self-stabilizing distributed SDN control plane using in-band communications, A mathematical modeling framework for software reliability testing†, Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks, Self-stabilizing smoothing and balancing networks, SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS, Distributed edge coloration for bipartite networks, The Theta-Model: achieving synchrony without clocks, Global Synchronization of Pulse-Coupled Oscillators on Trees, A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler, Argumentation through a distributed self-stabilizing approach, Self-stabilisation of Cellular Automata on Tilings, An anonymous self-stabilizing algorithm for 1-maximal independent set in trees, Local deal-agreement algorithms for load balancing in dynamic general graphs, A self-stabilizing algorithm for the st-order problem, Fault tolerant network constructors, Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast, The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs, Certification of an exact worst-case self-stabilization time, Self-stabilizing systems in spite of high dynamics, On specifications and proofs of timed circuits, Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast, Self-stabilizing 2-minimal dominating set algorithms based on loop composition, Neighborhood mutual remainder: self-stabilizing distributed implementation and applications, Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles, Efficient Counting with Optimal Resilience, Effective Search for a Naval Mine with Application to Distributed Failure Detection, On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion, Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs, A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives, Squeezing streams and composition of self-stabilizing algorithms, Self-stabilizing indulgent zero-degrading binary consensus, Distributed Self-Stabilizing MIS with Few States and Weak Communication, Self-stabilizing gathering of mobile robots under crash or Byzantine faults, Location functions for self-stabilizing Byzantine tolerant swarms, Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks, A self-stabilizing algorithm for finding weighted centroid in trees, Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs, Explicit Communication Among Stigmergic Robots, A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring, Constant-Space Localized Byzantine Consensus, Self-stabilization with r-operators, Hundreds of impossibility results for distributed computing, Safety assurance via on-line monitoring, Explorative anytime local search for distributed constraint optimization, Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks, Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems, SELF-STABILIZING MASTER–SLAVE TOKEN CIRCULATION AND EFFICIENT SIZE-COMPUTATION IN A UNIDIRECTIONAL RING OF ARBITRARY SIZE, RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES, A multiple random walks based self-stabilizingk-exclusion algorithm in ad hoc networks, The Optimal Strategy for the Average Long-Lived Consensus, Partially Ordered Knowledge Sharing and Fractionated Systems in the Context of other Models for Distributed Computing, On Stabilization in Herman’s Algorithm, A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET, A note on the parallel runtime of self-stabilizing graph linearization, Practically stabilizing SWMR atomic memory in message-passing systems, A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity, Ascending runs in dependent uniformly distributed random variables: application to wireless networks, SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS, The first fully polynomial stabilizing algorithm for BFS tree construction, Unnamed Item, Snap-Stabilizing Waves in Anonymous Networks, ANALYSIS OF THE AVERAGE EXECUTION TIME FOR A SELF-STABILIZING LEADER ELECTION ALGORITHM, Self-stabilizing \(\ell\)-exclusion, Computing fault-containment times of self-stabilizing algorithms using lumped Markov chains, Self-stabilizing robots in highly dynamic environments, Verifying Recurrence Properties in Self-stabilization by Checking the Absence of Finite Counterexamples, Self-stabilizing Virtual Synchrony, Near-optimal self-stabilising counting and firing squads, Snap-stabilizing tasks in anonymous networks, Stand up indulgent gathering, Stand up indulgent gathering, Stability of Multi-Valued Continuous Consensus11Preliminary Version, Some proofs are omitted from this version., Self-Stabilizing Domination Algorithms, Oblivious Collaboration, A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given, SKIP +, Leader Election in Sparse Dynamic Networks with Churn, Unnamed Item, Safe and stabilizing distributed multi-path cellular flows, Introduction to local certification, Distributed agreement in dynamic peer-to-peer networks, A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs, Synchronization of finite-state pulse-coupled oscillators, Competitive self-stabilizing \(k\)-clustering, A divide \& conquer approach to conditional stable model checking, Synthesizing optimal bias in randomized self-stabilization, A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem, A self-stabilizing algorithm for \(b\)-matching, Magnifying computing gaps. Establishing encrypted communication over unidirectional channels, Self-stabilizing timestamps, Limiting behavior of 3-color excitable media on arbitrary graphs, Practically-self-stabilizing virtual synchrony, Circle formation of weak robots and Lyndon words, An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity, A leader election algorithm for dynamic networks with causal clocks, A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees, The snap-stabilizing message forwarding algorithm on tree topologies, Self-stabilizing labeling and ranking in ordered trees, The computational power of simple protocols for self-awareness on graphs, Spanders: distributed spanning expanders, Self-stabilizing algorithms for minimal global powerful alliance sets in graphs, Compact routing messages in self-healing trees, Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs, Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register, Bounds on Herman's algorithm, Synchronous counting and computational algorithm design, Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks, Causality, influence, and computation in possibly disconnected synchronous dynamic networks, Stability of long-lived consensus., Probabilistic verification of Herman's self-stabilisation algorithm, Three tokens in Herman's algorithm, Tiara: a self-stabilizing deterministic skip list and skip graph, A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs, Stabilizing data-link over non-FIFO channels with optimal fault-resilience, An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs, Self-stabilizing minimum degree spanning tree within one from the optimal degree, A self-stabilizing algorithm to maximal 2-packing with improved complexity, Loosely-stabilizing leader election in a population protocol model, Coupling and self-stabilization, Parallel composition for time-to-fault adaptive stabilization, Transient fault detectors, Fault-containing self-stabilizing distributed protocols, HyperTree for self-stabilizing peer-to-peer systems, An \(O(n)\)-time self-stabilizing leader election algorithm, Feasibility analysis for robustness quantification by symbolic model checking, When consensus meets self-stabilization, Self-stabilizing Byzantine asynchronous unison, Robust and scalable middleware for selfish-computer systems, Synchronous vs. asynchronous unison, Distance-\(k\) knowledge in self-stabilizing algorithms, Self-stabilizing repeated balls-into-bins, Re-Chord: a self-stabilizing chord overlay network, A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs, A self-stabilizing \(k\)-clustering algorithm for weighted graphs, Snap-stabilization in message-passing systems, Maximum metric spanning tree made Byzantine tolerant, A nearly optimal upper bound for the self-stabilization time in Herman's algorithm, Fast and compact self-stabilizing verification, computation, and fault detection of an MST, Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative, A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets, Self-stabilizing silent disjunction in an anonymous network, Self-stabilizing leader election in polynomial steps, A self-stabilizing algorithm for edge monitoring in wireless sensor networks, Average long-lived binary consensus: quantifying the stabilizing role played by memory, Quiescence of self-stabilizing gossiping among mobile agents in graphs, A state-based model of sensor protocols, Coordination without communication: the case of the flocking problem, From distributed coordination to field calculus and aggregate computing, Dynamic FTSS in asynchronous systems: the case of unison, Game authority for robust and scalable distributed selfish-computer systems, Constructing self-stabilizing oscillators in population protocols, Automated constraint-based addition of nonmasking and stabilizing fault-tolerance, A self-stabilizing transformer for population protocols with covering, Consensus when all processes may be Byzantine for some time, Separation of circulating tokens, Nash equilibria in stabilizing systems, Oracle-based flocking of mobile robots in crash-recovery model, A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks, Randomization adaptive self-stabilization, Timer-based composition of fault-containing self-stabilizing protocols, A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity, A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem, A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2, Self-stabilizing leader election in optimal space under an arbitrary scheduler, Secure and self-stabilizing clock synchronization in sensor networks, A self-stabilizing algorithm for constructing weakly connected minimal dominating sets, Self-stabilizing leader election in dynamic networks, On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms, Empire of colonies: Self-stabilizing and self-organizing distributed algorithm, A new self-stabilizing maximal matching algorithm, Rapid almost-complete broadcasting in faulty networks, A geometric approach to deploying robot swarms, Quasi-self-stabilization of a distributed system assuming read/write atomicity, Optimized silent self-stabilizing scheme for tree-based constructions, Stabilizing mobile philosophers, Distributed backup placement, Local mending, Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps, Elements of security: Closure, convergence, and protection, Available stabilizing heaps, Self-stabilization with path algebra, The epigenetic consensus problem, On the expected time for Herman's probabilistic self-stabilizing algorithm