The following pages link to Andrei Z. Broder (Q671934):
Displaying 5 items.
- The worst-case running time of the random simplex algorithm is exponential in the height (Q671935) (← links)
- On the problem of approximating the number of bases of a matroid (Q1321827) (← links)
- Min-wise independent permutations (Q1577016) (← links)
- Finding hidden hamiltonian cycles (Q4306372) (← links)
- Existence and Construction of Edge-Disjoint Paths on Expander Graphs (Q4312418) (← links)
