Pages that link to "Item:Q3769980"
From MaRDI portal
The following pages link to The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors (Q3769980):
Displaying 13 items.
- Sublinear bounds for randomized leader election (Q477103) (← links)
- Communication algorithms with advice (Q972382) (← links)
- Optimal lower bounds for some distributed algorithms for a complete network of processors (Q1823691) (← links)
- Sense of direction in distributed computing (Q1870525) (← links)
- A fast distributed approximation algorithm for minimum spanning trees (Q1954259) (← links)
- The complexity of leader election in diameter-two networks (Q1988528) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms (Q2456363) (← links)
- Leader election in well-connected graphs (Q2696279) (← links)
- Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
- THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS (Q3022016) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Singularly optimal randomized leader election (Q6535020) (← links)
