Pages that link to "Item:Q1309384"
From MaRDI portal
The following pages link to Removing randomness in parallel computation without a processor penalty (Q1309384):
Displayed 18 items.
- Deterministic parallel algorithms for bilinear objective functions (Q666681) (← links)
- An improvement on parallel computation of a maximal matching (Q672837) (← links)
- Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
- Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces (Q1007250) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity (Q1350189) (← links)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- The local nature of \(\Delta\)-coloring and its algorithmic applications (Q1894705) (← links)
- Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM (Q1917253) (← links)
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (Q1923858) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors (Q2229293) (← links)
- Improved Dynamic Graph Coloring (Q5009642) (← links)
- Neighborhood graphs and distributed Δ+1-coloring (Q5054815) (← links)
- Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921) (← links)
- (Q5212563) (← links)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)