On the public citation graph
A hybrid algorithm for finding thekth smallest ofn elements in O(n) time
0 signed · 30 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.1016/0020-0190(75)90056-3openalex-snapshot
An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
inferredcites →https://doi.org/10.1016/0020-0190(77)90072-2openalex-snapshot
Understanding the complexity of interpolation search
inferredcites →https://doi.org/10.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1145/355694.355704openalex-snapshot
Remark on “Algorithm 489: The Algorithm SELECT—for Finding the i th Smallest of n Elements [M1]”
inferredcites →https://doi.org/10.1145/360680.360691openalex-snapshot
Expected time bounds for selection
inferredcites →https://doi.org/10.1145/360680.360694openalex-snapshot
Algorithm 489: the algorithm SELECT—for finding the i th smallest of n elements [M1]
inferredcites →https://doi.org/10.1145/366707.367561openalex-snapshot
Certification of algorithms 63, 64 and 65, partition, quicksort, and find
inferredcites →https://doi.org/10.1287/moor.4.4.339openalex-snapshot
Fast Approximation Algorithms for Knapsack Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11881223_15openalex-snapshot
Immune Clonal Strategies Based on Three Mutation Methods
inferred← citeshttps://doi.org/10.1007/bf02288325openalex-snapshot
Algorithms for finding optimum trees: Description, use and evaluation
inferred← citeshttps://doi.org/10.1007/s11704-010-0573-6openalex-snapshot
An immune memory clonal algorithm for numerical and combinatorial optimization
inferred← citeshttps://doi.org/10.1007/s12532-012-0039-yopenalex-snapshot
Cutting plane versus compact formulations for uncertain (integer) linear programs
inferred← citeshttps://doi.org/10.1016/0167-6377(90)90035-4openalex-snapshot
An exact algorithm for large unbounded knapsack problems
inferred← citeshttps://doi.org/10.1016/j.cie.2003.09.005openalex-snapshot
A greedy random adaptive search procedure for the weighted maximal planar graph problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.02.011openalex-snapshot
An empirical analysis of exact algorithms for the unbounded knapsack problem
inferred← citeshttps://doi.org/10.1016/j.engappai.2010.01.006openalex-snapshot
Predication based immune network for multimodal function optimization
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2013.06.004openalex-snapshot
How hard is it to tell which is a Condorcet committee?
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601698openalex-snapshot
An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem
inferred← citeshttps://doi.org/10.1080/09540091.2013.834877openalex-snapshot
A novel artificial immune clonal selection classification and rule mining with swarm learning model
inferred← citeshttps://doi.org/10.1109/tevc.2002.1011539openalex-snapshot
Learning and optimization using the clonal selection principle
inferred← citeshttps://doi.org/10.1145/1543834.1543924openalex-snapshot
Association based immune network for multimodal function optimization
inferred← citeshttps://doi.org/10.1201/9781420034349.ch25openalex-snapshot
Computation time of evolutionary operators
inferred← citeshttps://doi.org/10.1201/9781420050387.pteopenalex-snapshot
Evolutionary Computation Implementations
inferred← citeshttps://doi.org/10.1287/ijoc.1070.0246openalex-snapshot
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
inferred← citeshttps://doi.org/10.1287/ijoc.7.2.191openalex-snapshot
Optimal Scheduling of Tasks on Identical Parallel Processors
inferred← citeshttps://doi.org/10.1287/trsc.35.2.165.10135openalex-snapshot
Models and Algorithms for Single-Depot Vehicle Scheduling
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.