The following pages link to (Q4036581):
Displaying 11 items.
- Efficient sampling of random permutations (Q954966) (← links)
- On a compaction theorem of Ragde (Q1195502) (← links)
- Randomized range-maxima in nearly-constant parallel time (Q1210333) (← links)
- Fine-grained secure computation (Q1631318) (← links)
- The parallel complexity of growth models (Q1906438) (← links)
- Randomization helps to perform independent tasks reliably (Q4446875) (← links)
- Parallel Weighted Random Sampling (Q5075804) (← links)
- Fast and optimal simulations between CRCW PRAMs (Q5096768) (← links)
- The log-star revolution (Q5096787) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
- Algorithm 947 (Q5270708) (← links)
