Pages that link to "Item:Q863197"
From MaRDI portal
The following pages link to Dynamic analysis of the arrow distributed protocol (Q863197):
Displaying 8 items.
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Low complexity variants of the arrow distributed directory (Q1604202) (← links)
- A fast distributed approximation algorithm for minimum spanning trees (Q1954259) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Distributed transactional memory for general networks (Q2256963) (← links)
- An analysis framework for distributed hierarchical directories (Q2346963) (← links)
- Competitive concurrent distributed queuing (Q2787673) (← links)
- Dynamic analysis of the Arrow distributed directory protocol in general networks (Q6487494) (← links)