scientific article; zbMATH DE number 996442
From MaRDI portal
Publication:3126969
Cited in
(only showing first 100 items - show all)- An efficient distributed algorithm for canonical labeling on directed split-stars
- A topological treatment of early-deciding set-agreement
- Towards a real-time distributed computing model
- Liveness of a mutex algorithm in a fair process algebra
- Trace-based derivation of a scalable lock-free stack algorithm
- Classifying rendezvous tasks of arbitrary dimension
- Is VAT really single linkage in disguise?
- Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound
- Self-stabilizing coloration in anonymous planar networks
- Modularity for teams of I/O automata
- Developing topology discovery in Event-B
- On the round complexity of Byzantine agreement without initial set-up
- A bivalency proof of the lower bound for uniform consensus
- A derivation of distributed implementation of Warshall's algorithm
- Distributed algorithms in synchronous broadcasting networks
- Interactive foundations of computing
- Tuning distributed control algorithms for optimal functioning
- Eventually-serializable data services
- Faster asynchronous systems.
- Stability of long-lived consensus.
- Hybrid I/O automata.
- On modelling mobility
- Revisiting the PAXOS algorithm
- Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
- A minimal property for characterizing deadlock-free programs
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
- Specification of real-time and hybrid systems in rewriting logic
- Mutual exclusion as a matter of priority
- Improved time bounds for linearizable implementations of abstract data types
- Generalized interface automata with multicast synchronization
- Shared-object system equilibria: delay and throughput analysis
- Consensus for wireless sensor networks with Markovian switching topology and stochastic communication noises
- Counter machines and distributed automata -- a story about exchanging space and time
- Terminating distributed construction of shapes and patterns in a fair solution of automata
- Geometric and combinatorial views on asynchronous computability
- Event-triggered consensus of nonlinear multi-agent systems with stochastic switching topology
- Orbit consensus of quantum networks based on interaction design
- Highly-fair bakery algorithm using symmetric tokens
- Compact routing messages in self-healing trees
- Randomized k-set agreement in crash-prone and Byzantine asynchronous systems
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- An automata-theoretic approach to the verification of distributed algorithms
- Resilient consensus of switched multi-agent systems
- Self-stabilizing repeated balls-into-bins
- Resilience against misbehaving nodes in asynchronous networks
- Communication and location discovery in geometric ring networks
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge
- Verifying the consistency of remote untrusted services with conflict-free operations
- Approximate agreement under mobile Byzantine faults
- Impact of knowledge on election time in anonymous networks
- Distributed containment control of networked fractional-order systems with delay-dependent communications
- Measuring the performance of asynchronous systems with PAFAS
- Exact communication costs for consensus and leader in a tree
- Cooperative computing with fragmentable and mergeable groups
- A time-optimal distributed sorting algorithm on a line network.
- Wait-free Byzantine consensus.
- A simple proof of the uniform consensus synchronous lower bound.
- Performance measure sensitive congruences for Markovian process algebras
- Fair simulation
- Linear parametric model checking of timed automata
- Directed cycles and related structures in random graphs. I: Static properties
- Self-stabilizing timestamps
- A framework for automated distributed implementation of component-based models
- The correctness proof of Ben-Or's randomized consensus algorithm
- Gathering identical autonomous systems on a circle using stigmergy
- Fast leader election in anonymous rings with bounded expected delay
- Stabilizing data-link over non-FIFO channels with optimal fault-resilience
- The inherent price of indulgence
- GeoQuorums: implementing atomic memory in mobile ad hoc networks
- Randomized leader election
- Snap-stabilization and PIF in tree networks
- A family of optimal termination detection algorithms
- Failure detectors as type boosters
- HyperTree for self-stabilizing peer-to-peer systems
- Renaming in synchronous message passing systems with Byzantine failures
- When consensus meets self-stabilization
- Byzantine-tolerant causal broadcast
- MinMax algorithms for stabilizing consensus
- The complexity of leader election in diameter-two networks
- Parallel alternating direction method of multipliers
- Making asynchronous distributed computations robust to noise
- Search on a line with faulty robots
- A modular framework for verifying versatile distributed systems
- Ensuring liveness properties of distributed systems: open problems
- From distributed coordination to field calculus and aggregate computing
- Reaching approximate Byzantine consensus with multi-hop communication
- A simple Byzantine generals protocol
- Synchronization of networks with time-varying couplings
- On fast-slow consensus networks with a dynamic weight
- A simplicial complex model for dynamic epistemic logic to study distributed task computability
- Higher-order quantifier elimination, counter simulations and fault-tolerant systems
- Periodic consensus in network systems with general distributed processing delays
- A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks
- Advice complexity of treasure hunt in geometric terrains
- Resilient self/event-triggered consensus based on ternary control
- Output-based dynamic event-triggered consensus control for linear multiagent systems
- How many cooks spoil the soup?
- Stochastic consensus control of multi-agent systems under general noises and delays
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3126969)
