On the microscopic view of time and messages
From MaRDI portal
Publication:4686647
Recommendations
- Synchronization and informational agreement in distributed computing systems
- Towards a real-time distributed computing model
- On the minimal time required for execution of distributed concurrent processes in synchronous modes
- Synchronous, asynchronous, and causally ordered communication
- Timestamping messages and events in a distributed system using synchronous communication
Cites work
- scientific article; zbMATH DE number 3967924 (Why is no real title available?)
- scientific article; zbMATH DE number 4049013 (Why is no real title available?)
- scientific article; zbMATH DE number 176511 (Why is no real title available?)
- scientific article; zbMATH DE number 1140070 (Why is no real title available?)
- A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
- A fast and simple randomized parallel algorithm for maximal matching
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- A faster distributed protocol for constructing a minimum spanning tree
- An efficient distributed algorithm for constructing small dominating sets
- An optimal bit complexity randomized distributed MIS algorithm
- Bit-optimal election in synchronous rings
- Computing on an anonymous ring
- Consensus algorithms with one-bit messages
- Design and Analysis of Distributed Algorithms
- Distributed Computing: A Locality-Sensitive Approach
- Distributed Weighted Matching
- Distributed large independent sets in one round on bounded-independence graphs
- Efficient distributed algorithms by using the archimedean time assumption
- Electing a leader in a synchronous ring
- Fast Distributed Construction of Smallk-Dominating Sets and Applications
- Faster computation on directed networks of automata
- Finding the extrema of a distributed multiset
- Improved bounds for electing a leader in a synchronous ring
- Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
- New protocols for the election of a leader in a ring
- Parallel Symmetry-Breaking in Sparse Graphs
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge
- Self-Stabilizing Symmetry Breaking in Constant Space
- Stabilizing unison
- Symmetry breaking in distributed networks
- The firing squad synchronization problem for graphs
- Tight bounds for synchronous communication of information using bits and silence
- Trading bit, message, and time complexity of distributed algorithms
- Unison, canon, and sluggish clocks in networks controlled by a synchronizer
Cited in
(2)
This page was built for publication: On the microscopic view of time and messages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4686647)
