On the public citation graph

A linear time randomizing algorithm for searching ranked functions

https://doi.org/10.1007/bf01840350
0 signed · 17 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1109/sfcs.1981.6openalex-snapshot
A fast probabilistic parallel sorting algorithm
inferredcites →https://doi.org/10.1137/0215052openalex-snapshot
On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
inferredcites →https://doi.org/10.1145/2157.322410openalex-snapshot
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
inferredcites →https://doi.org/10.1287/moor.8.4.498openalex-snapshot
The Weighted Euclidean 1-Center Problem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/bf01240735openalex-snapshot
A new scaling algorithm for the maximum mean cut problem
inferred← citeshttps://doi.org/10.1007/bf01586040openalex-snapshot
New scaling algorithms for the assignment and minimum mean cycle problems
inferred← citeshttps://doi.org/10.1007/bfb0028271openalex-snapshot
Parametric search and locating supply centers in trees
inferred← citeshttps://doi.org/10.1016/0166-218x(93)00094-gopenalex-snapshot
An algorithm for fractional assignment problems
inferred← citeshttps://doi.org/10.1016/0167-6377(91)90082-zopenalex-snapshot
A linear-time algorithm for solving continuous maximin knapsack problems
inferred← citeshttps://doi.org/10.1016/0167-6377(93)90022-9openalex-snapshot
Approximate binary search algorithms for mean cuts and cycles
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.031openalex-snapshot
Approximating the minimum cycle mean
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00115-xopenalex-snapshot
An approximate binary search algorithm for the multiple-choice knapsack problem
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.15807/torsj.53.1openalex-snapshot
A MAXIMUM DENSITY SUBSET PROBLEM AND ITS ALGORITHM WITH APPROXIMATE BINARY SEARCH
inferred← citeshttps://doi.org/10.4204/eptcs.119.13openalex-snapshot
Approximating the minimum cycle mean
inferred← citeshttps://doi.org/10.5555/127787.127822openalex-snapshot
Optimal algorithms for tree partitioning
inferred← citeshttps://doi.org/10.5703/1288284314305openalex-snapshot
Trade-off Analysis Methodology for Asset Management
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.