On the public citation graph
A sublogarithmic convex hull algorithm
0 signed · 23 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.1007/bf01762130openalex-snapshot
Parallel algorithms for some functions of two convex polygons
inferredcites →https://doi.org/10.1007/bfb0105127openalex-snapshot
Finding the maximum, merging and sorting in a parallel computation model
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(87)90002-0openalex-snapshot
Finding the convex hull of a sorted point set in parallel
inferredcites →https://doi.org/10.1016/0196-6774(81)90010-9openalex-snapshot
Finding the maximum, merging, and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0743-7315(86)90011-0openalex-snapshot
Efficient parallel solutions to some geometric problems
inferredcites →https://doi.org/10.1016/0890-5401(89)90036-9openalex-snapshot
Faster optimal parallel prefix sums and list ranking
inferredcites →https://doi.org/10.1145/65950.65958openalex-snapshot
Optimal bounds for decision problems on the CRCW PRAM
inferredcites →https://doi.org/10.1145/73393.73414openalex-snapshot
Optimal parallel algorithms for polygon and point-set problems
inferredcites →https://doi.org/10.1145/73833.73846openalex-snapshot
Optimal parallel algorithm for visibility of a simple polygon from a point
inferredcites →https://doi.org/10.1145/800061.808735openalex-snapshot
Lower bounds for algebraic computation trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bfb0045071openalex-snapshot
Constructing a strongly convex superhull of points
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00041-aopenalex-snapshot
An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
inferred← citeshttps://doi.org/10.1109/icapp.1995.472195openalex-snapshot
A parallel method for finding the convex hull of discs
inferred← citeshttps://doi.org/10.1109/icapp.1995.472293openalex-snapshot
An optimal parallel algorithm for the Euclidean distance maps of binary images
inferred← citeshttps://doi.org/10.1142/s0218195901000614openalex-snapshot
CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS
inferred← citeshttps://doi.org/10.1142/s0218195998000151openalex-snapshot
Finding the Convex Hull of Discs in Parallel
inferred← citeshttps://doi.org/10.1145/3369740.3372916openalex-snapshot
Convex Hull Formation for Programmable Matter
inferred← citeshttps://doi.org/10.12737/25044openalex-snapshot
The Neuronal Plasticity of Sensorimotor Cortex in the Conditions of Increased Background Radiation
inferred← citeshttps://doi.org/10.48550/arxiv.1702.08545openalex-snapshot
Synergistic Computation of Planar Maxima and Convex Hull
inferred← citeshttps://doi.org/10.6688/jise.1999.15.3.3openalex-snapshot
Computational Geometry on the Broadcast Communication Model
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.