Pages that link to "Item:Q1172863"
From MaRDI portal
The following pages link to Moment inequalities for random variables in computational geometry (Q1172863):
Displaying 16 items.
- Maxima-finding algorithms for multidimensional samples: A two-phase approach (Q425621) (← links)
- A note on the expected time required to construct the outer layer (Q1062448) (← links)
- On the computer generation of random convex hulls (Q1155367) (← links)
- Convex hulls of samples from spherically symmetric distributions (Q1175782) (← links)
- The excess-mass ellipsiod (Q1182767) (← links)
- On the variance of the number of maxima in random vectors and its applications (Q1296610) (← links)
- Maximal and minimal balls (Q1314525) (← links)
- Intersections with random geometric objects (Q1392845) (← links)
- An asymptotic theory for recurrence relations based on minimization and maximization. (Q1401173) (← links)
- An algorithm for geometric minimum spanning trees requiring nearly linear expected time (Q1824386) (← links)
- Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\) (Q1894936) (← links)
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points (Q2365326) (← links)
- How many maxima can there be? (Q2365811) (← links)
- Records, the maximal layer, and uniform distributions in monotone sets (Q2365949) (← links)
- On random cartesian trees (Q4286297) (← links)
- Exact asymptotics of divide-and-conquer recurrences (Q4630256) (← links)