The following pages link to (Q4038731):
Displaying 10 items.
- Fast randomized parallel methods for planar convex hull construction (Q676065) (← links)
- Linear-size constant-depth polylog-threshold circuits (Q1182085) (← links)
- On a compaction theorem of Ragde (Q1195502) (← links)
- Randomized range-maxima in nearly-constant parallel time (Q1210333) (← links)
- Almost fully-parallel parentheses matching (Q1345960) (← links)
- Optimal parallel algorithms for Prefix Matching (Q4632427) (← links)
- An O(log log n) algorithm to compute the kernel of a polygon (Q5054771) (← links)
- Retrieval of scattered information by EREW, CREW and CRCW PRAMs (Q5056126) (← links)
- Fast and optimal simulations between CRCW PRAMs (Q5096768) (← links)
- The log-star revolution (Q5096787) (← links)