Competitive concurrent distributed queuing
From MaRDI portal
Recommendations
- Dynamic analysis of the arrow distributed protocol
- Dynamic analysis of the Arrow distributed directory protocol in general networks
- Concurrent counting is harder than queuing
- scientific article; zbMATH DE number 2006654
- The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms
Cited in
(18)- Online spanners in metric spaces
- Euclidean Steiner spanners: light and sparse
- Spanners in sparse graphs
- A tight bound on approximating arbitrary metrics by tree metrics
- scientific article; zbMATH DE number 1696666 (Why is no real title available?)
- Compositional competitiveness for distributed algorithms
- scientific article; zbMATH DE number 2006654 (Why is no real title available?)
- Dynamic analysis of the Arrow distributed directory protocol in general networks
- Concurrent counting is harder than queuing
- On euclidean Steiner (1+)-spanners
- Light Euclidean Steiner spanners in the plane
- Spanners of bounded degree graphs
- Distributed transactional memory for general networks
- Distributed transactional memory for metric-space networks
- Online Spanners in Metric Spaces
- Concurrent expandable AMQs on the basis of quotient filters
- Online graph exploration on trees, unicyclic graphs and cactus graphs
- Distributed queuing in dynamic networks
This page was built for publication: Competitive concurrent distributed queuing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2787673)