On the microscopic view of time and messages
From MaRDI portal
Publication:4686647
DOI10.1007/978-3-319-46376-6_5zbMATH Open1396.68029OpenAlexW2546715517MaRDI QIDQ4686647FDOQ4686647
Authors: N. Santoro 
Publication date: 4 October 2018
Published in: Emergent Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-46376-6_5
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
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
- Trading bit, message, and time complexity of distributed algorithms
- Design and Analysis of Distributed Algorithms
- Electing a leader in a synchronous ring
- Computing on an anonymous ring
- Distributed Computing: A Locality-Sensitive Approach
- The firing squad synchronization problem for graphs
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Title not available (Why is that?)
- Stabilizing unison
- An optimal bit complexity randomized distributed MIS algorithm
- A fast and simple randomized parallel algorithm for maximal matching
- Fast Distributed Construction of Smallk-Dominating Sets and Applications
- A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
- Symmetry breaking in distributed networks
- Consensus algorithms with one-bit messages
- An efficient distributed algorithm for constructing small dominating sets
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge
- Parallel Symmetry-Breaking in Sparse Graphs
- Faster computation on directed networks of automata
- Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
- Distributed Weighted Matching
- Bit-optimal election in synchronous rings
- Distributed large independent sets in one round on bounded-independence graphs
- A faster distributed protocol for constructing a minimum spanning tree
- Improved bounds for electing a leader in a synchronous ring
- Title not available (Why is that?)
- Efficient distributed algorithms by using the archimedean time assumption
- Finding the extrema of a distributed multiset
- New protocols for the election of a leader in a ring
- Unison, canon, and sluggish clocks in networks controlled by a synchronizer
- Tight bounds for synchronous communication of information using bits and silence
- Self-Stabilizing Symmetry Breaking in Constant Space
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
