Pages that link to "Item:Q2787673"
From MaRDI portal
The following pages link to Competitive concurrent distributed queuing (Q2787673):
Displayed 9 items.
- Concurrent counting is harder than queuing (Q604464) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Spanners of bounded degree graphs (Q1944059) (← links)
- Distributed transactional memory for metric-space networks (Q1954240) (← links)
- Distributed transactional memory for general networks (Q2256963) (← links)
- Online graph exploration on trees, unicyclic graphs and cactus graphs (Q2656355) (← links)
- Euclidean Steiner Spanners: Light and Sparse (Q5043642) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
- Online Spanners in Metric Spaces (Q6195959) (← links)