Pages that link to "Item:Q1423588"
From MaRDI portal
The following pages link to The complexity of hyperplane depth in the plane (Q1423588):
Displaying 8 items.
- On the least trimmed squares estimator (Q472475) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- Computing the least quartile difference estimator in the plane (Q1020878) (← links)
- Algorithms for bivariate zonoid depth (Q2456661) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
- Intersecting convex sets by rays (Q5896956) (← links)
- On approximate range counting and depth (Q5902137) (← links)
