On the public citation graph
A provably fast linear-expected-time maxima-finding algorithm
0 signed · 29 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/978-1-4899-3531-1openalex-snapshot
Lecture Notes on Bucket Algorithms
inferredcites →https://doi.org/10.1007/bf02915448openalex-snapshot
Applications of the theory of records in the study of random trees
inferredcites →https://doi.org/10.1016/0020-0190(89)90156-7openalex-snapshot
On the average number of maxima in a set of vectors
inferredcites →https://doi.org/10.1016/0020-0190(90)90214-iopenalex-snapshot
A guided tour of chernoff bounds
inferredcites →https://doi.org/10.1145/321906.321910openalex-snapshot
On Finding the Maxima of a Set of Vectors
inferredcites →https://doi.org/10.1145/322092.322095openalex-snapshot
On the Average Number of Maxima in a Set of Vectors and Applications
inferredcites →https://doi.org/10.1145/379172.379188openalex-snapshot
Kinder, gentler average-case analysis for convex hulls and maximal vectors
inferredcites →https://doi.org/10.5555/320176.320196openalex-snapshot
Fast linear expected-time alogorithms for computing maxima and convex hulls
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_12openalex-snapshot
Two New Families of List Update Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_44openalex-snapshot
Maximal and Convex Layers of Random Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_51openalex-snapshot
A Fast Algorithm for Three-Dimensional Layers of Maxima Problem
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-015-9677-yopenalex-snapshot
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
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/j.spl.2023.109847openalex-snapshot
A phase transition for the probability of being a maximum among random vectors with general iid coordinates
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.013openalex-snapshot
A volume first maxima-finding algorithm
inferred← citeshttps://doi.org/10.1109/etcs.2009.439openalex-snapshot
An External Memory Algorithm of Maxima-Finding Problems
inferred← citeshttps://doi.org/10.1137/12089702xopenalex-snapshot
Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls
inferred← citeshttps://doi.org/10.1137/s0097539794277871openalex-snapshot
Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1145/1998196.1998198openalex-snapshot
Orthogonal range searching on the RAM, revisited
inferred← citeshttps://doi.org/10.1145/2261250.2261291openalex-snapshot
Self-improving algorithms for coordinate-wise maxima
inferred← citeshttps://doi.org/10.1145/2582112.2582166openalex-snapshot
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
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
inferred← citeshttps://doi.org/10.48550/arxiv.1007.1593openalex-snapshot
A Fast Algorithm for Three-Dimensional Layers of Maxima Problem
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.