Pages that link to "Item:Q2796236"
From MaRDI portal
The following pages link to Near-optimal scheduling of distributed algorithms (Q2796236):
Displaying 19 items.
- A lower bound on the period length of a distributed scheduler (Q689104) (← links)
- Fast distributed algorithms to make mutually coordinated decisions in stringent real time (Q1003069) (← links)
- On efficient distributed construction of near optimal routing schemes (Q1741966) (← links)
- Near-optimal scheduling in the congested clique (Q2117708) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- A distributed exact algorithm for the multiple resource constrained sequencing problem (Q2368093) (← links)
- DESH: Overhead reduction algorithms for deferrable scheduling (Q2379858) (← links)
- Optimal scheduling of contract algorithms with soft deadlines (Q2400436) (← links)
- (Q3102308) (← links)
- Distributed scheduling: a review of concepts and applications (Q3163175) (← links)
- (Q3640352) (← links)
- Efficient distributed algorithms by using the archimedean time assumption (Q3816977) (← links)
- (Q4668735) (← links)
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- (Q5090923) (← links)
- Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) (← links)
- Distributed constructions of dual-failure fault-tolerant distance preservers (Q6535019) (← links)
- Near-optimal distributed computation of small vertex cuts (Q6579850) (← links)
