Pages that link to "Item:Q4875445"
From MaRDI portal
The following pages link to A Fast Derandomization Scheme and Its Applications (Q4875445):
Displaying 5 items.
- Deterministic parallel algorithms for bilinear objective functions (Q666681) (← links)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs (Q1607053) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC (Q5860478) (← links)
