On the public citation graph
Moment inequalities for random variables in computational geometry
0 signed · 52 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/nav.3800210414openalex-snapshot
The minimum sphere covering a convex polyhedron
inferredcites →https://doi.org/10.1007/bf00531885openalex-snapshot
Die konvexe H�lle von n rotationssymmetrisch verteilten Punkten
inferredcites →https://doi.org/10.1007/bf00535300openalex-snapshot
�ber die konvexe H�lle von n zuf�llig gew�hlten Punkten
inferredcites →https://doi.org/10.1007/bf00535973openalex-snapshot
�ber die konvexe H�lle von n zuf�llig gew�hlten Punkten. II
inferredcites →https://doi.org/10.1007/bf01851005openalex-snapshot
ZufÄllige konvexe Polygone in einem Ringgebiet
inferredcites →https://doi.org/10.1007/bf02237955openalex-snapshot
A note on linear expected time algorithms for finding convex hulls
inferredcites →https://doi.org/10.1016/0020-0190(72)90045-2openalex-snapshot
An efficient algorith for determining the convex hull of a finite planar set
inferredcites →https://doi.org/10.1016/0020-0190(73)90020-3openalex-snapshot
On the identification of the convex hull of a finite set of points in the plane
inferredcites →https://doi.org/10.1016/0020-0190(78)90051-0openalex-snapshot
Divide and conquer for linear expected time
inferredcites →https://doi.org/10.1016/0020-0190(80)90036-8openalex-snapshot
A note on finding convex hulls via maximal vectors
inferredcites →https://doi.org/10.1016/0898-1221(81)90059-6openalex-snapshot
How to reduce the average complexity of convex hull finding algorithms
inferredcites →https://doi.org/10.1137/1111020openalex-snapshot
On the Distribution of the Number of Admissible Points in a Vector Random Sample
inferredcites →https://doi.org/10.1287/mnsc.19.1.96openalex-snapshot
The Minimum Covering Sphere Problem
inferredcites →https://doi.org/10.14288/1.0051821openalex-snapshot
A convex hull algorithm optimal for point sets in even dimensions
inferredcites →https://doi.org/10.2307/3212146openalex-snapshot
Sur L'enveloppe convexe des nuages de points aleatoires dans R n . I
inferredcites →https://doi.org/10.82308/19057openalex-snapshot
Application of computational geometry to pattern recognition problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcom.1996.0022openalex-snapshot
On the Expected Number of Shadow Vertices of the Convex Hull of Random Points
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_68openalex-snapshot
Exact asymptotics of divide-and-conquer recurrences
inferred← citeshttps://doi.org/10.1007/978-1-4613-9464-8_12openalex-snapshot
Recent Results on the Average Time Behavior of Some Algorithms in Computational Geometry
inferred← citeshttps://doi.org/10.1007/978-94-009-7772-3_7openalex-snapshot
Computational Geometric Problems in Pattern Recognition
inferred← citeshttps://doi.org/10.1007/bf01553902openalex-snapshot
An algorithm for geometric minimum spanning trees requiring nearly linear expected time
inferred← citeshttps://doi.org/10.1007/bf02770866openalex-snapshot
Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
inferred← citeshttps://doi.org/10.1007/pl00009256openalex-snapshot
A Note on the Expected Time for Finding Maxima by List Algorithms
inferred← citeshttps://doi.org/10.1007/s00454-004-1109-3openalex-snapshot
An Identity Relating Moments of Functionals of Convex Hulls
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90028-6openalex-snapshot
A note on the expected time required to construct the outer layer
inferred← citeshttps://doi.org/10.1016/0047-259x(91)90106-copenalex-snapshot
The excess-mass ellipsoid
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90064-4openalex-snapshot
Convex hulls of samples from spherically symmetric distributions
inferred← citeshttps://doi.org/10.1016/0898-1221(82)90035-9openalex-snapshot
On the computer generation of random convex hulls
inferred← citeshttps://doi.org/10.1016/0898-1221(93)90195-2openalex-snapshot
Records, the maximal layer, and uniform distributions in monotone sets
inferred← citeshttps://doi.org/10.1016/0898-1221(95)00015-qopenalex-snapshot
Linear programming approaches to the convex hull problem in Rm
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90014-wopenalex-snapshot
How many maxima can there be?
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90017-zopenalex-snapshot
Maximal and minimal balls
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50008-6openalex-snapshot
On Geometric Algorithms that use the Furthest-Point Voronoi Diagram
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50010-4openalex-snapshot
Expected Time Analysis of Algorithms in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.08.001openalex-snapshot
Maxima-finding algorithms for multidimensional samples: A two-phase approach
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00208-0openalex-snapshot
An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00066-xopenalex-snapshot
An asymptotic theory for recurrence relations based on minimization and maximization
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00004-2openalex-snapshot
Intersections with random geometric objects
inferred← citeshttps://doi.org/10.1017/s0021900200041474openalex-snapshot
On the convex hull of random points in a polytope
inferred← citeshttps://doi.org/10.1109/etcs.2009.439openalex-snapshot
An External Memory Algorithm of Maxima-Finding Problems
inferred← citeshttps://doi.org/10.1137/s0097539794277871openalex-snapshot
Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1145/262839.263075openalex-snapshot
Probabilistic analysis for combinatorial functions of moving points
inferred← citeshttps://doi.org/10.1145/3127585openalex-snapshot
Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half
inferred← citeshttps://doi.org/10.1145/379172.379188openalex-snapshot
Kinder, gentler average-case analysis for convex hulls and maximal vectors
inferred← citeshttps://doi.org/10.1214/aoap/1028903455openalex-snapshot
On the variance of the number of maxima in random vectors and its applications
inferred← citeshttps://doi.org/10.2307/3214289openalex-snapshot
On the convex hull of random points in a polytope
inferred← citeshttps://doi.org/10.4304/jsw.5.2.235-242openalex-snapshot
An almost Linear I/O Algorithm for Skyline Query
inferred← citeshttps://doi.org/10.46298/dmtcs.337openalex-snapshot
Efficient maxima-finding algorithms for random planar samples
inferred← citeshttps://doi.org/10.48550/arxiv.0910.1392openalex-snapshot
Simple, efficient maxima-finding algorithms for multidimensional samples
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.