Pages that link to "Item:Q1823691"
From MaRDI portal
The following pages link to Optimal lower bounds for some distributed algorithms for a complete network of processors (Q1823691):
Displaying 17 items.
- Sublinear bounds for randomized leader election (Q477103) (← links)
- The power of multimedia: Combining point-to-point and multi-access networks (Q582899) (← links)
- Tight bounds on the round complexity of distributed 1-solvable tasks (Q673104) (← links)
- Wang tilings and distributed verification on anonymous torus networks (Q675863) (← links)
- Communication algorithms with advice (Q972382) (← links)
- Labeled versus unlabeled distributed Cayley networks (Q1917232) (← links)
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony (Q1938370) (← 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)
- Move-optimal gossiping among mobile agents (Q2481955) (← links)
- Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
- Efficient leader election using sense of direction (Q5137338) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- On the Complexity of Universal Leader Election (Q5501952) (← links)
- Singularly optimal randomized leader election (Q6535020) (← links)
