On Adaptive Tree Polling Algorithms
From MaRDI portal
Publication:3341885
Recommendations
- scientific article; zbMATH DE number 3869354
- ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS
- On the communication complexity of polling
- Belated analyses of three credit-based adaptive polling algorithms
- Performance evaluation of polling systems by means of the power-series algorithm
Cited in
(6)- ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS
- A unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback
- On a Frankl-type problem for a mixed parabolic-hyperbolic equation
- scientific article; zbMATH DE number 3869354 (Why is no real title available?)
- scientific article; zbMATH DE number 1759379 (Why is no real title available?)
- Belated analyses of three credit-based adaptive polling algorithms
This page was built for publication: On Adaptive Tree Polling Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3341885)