Language complexity on the synchronous anonymous ring
From MaRDI portal
(Redirected from Publication:1102125)
Recommendations
Cites work
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
- Computing on an anonymous ring
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- Lower Bounds for Distributed Maximum-Finding Algorithms
Cited in
(9)- String recognition on anonymous rings
- Computing on an anonymous ring
- scientific article; zbMATH DE number 17531 (Why is no real title available?)
- scientific article; zbMATH DE number 1754655 (Why is no real title available?)
- Hundreds of impossibility results for distributed computing
- scientific article; zbMATH DE number 5201364 (Why is no real title available?)
- On recognizing a string on an anonymous ring
- Anonymous wireless rings
- Scattering on a ring of processors
This page was built for publication: Language complexity on the synchronous anonymous ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102125)