The following pages link to (Q3140437):
Displaying 10 items.
- Linear classifiers are nearly optimal when hidden variables have diverse effects (Q420914) (← links)
- Exploiting storage redundancy to speed up randomized shared memory simulations (Q1365933) (← links)
- Randomized path coloring on binary trees. (Q1853533) (← links)
- Uniform generation of NP-witnesses using an NP-oracle (Q1854397) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Counting distinct items over update streams (Q2371800) (← links)
- Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis (Q2426667) (← links)
- Efficient parallel computing with memory faults (Q5055934) (← links)
- A time-randomness tradeoff for selection in parallel (Q5060137) (← links)
- THE IONESCU–WAINGER MULTIPLIER THEOREM AND THE ADELES (Q6048827) (← links)
