Thinning protocols for routing h-relations over shared media
From MaRDI portal
(Redirected from Publication:666178)
Thinning protocols for routing \(h\)-relations over shared media
Thinning protocols for routing \(h\)-relations over shared media
Recommendations
- scientific article; zbMATH DE number 1283996
- An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks
- Scheduling parallel communication: The \(h\)-relation problem
- Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
- Asynchronous shared channel
Cites work
- scientific article; zbMATH DE number 1261812 (Why is no real title available?)
- scientific article; zbMATH DE number 1263198 (Why is no real title available?)
- scientific article; zbMATH DE number 1283996 (Why is no real title available?)
- scientific article; zbMATH DE number 1142307 (Why is no real title available?)
- A guided tour of Chernoff bounds
- An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks
- An Optical Simulation of Shared Memory
- Analysis of Backoff Protocols for Multiple Access Channels
- Analysis of practical backoff protocols for contention resolution with multiple servers
- Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
- ERCW PRAMs and optical communication
- Efficient PRAM simulation on a distributed memory machine
- Stochastic Contention Resolution With Short Delays
This page was built for publication: Thinning protocols for routing \(h\)-relations over shared media
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666178)