On the public citation graph

On an Optimal Search Procedure

0 signed · 18 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/bf00263588openalex-snapshot
Performance bounds on the splitting algorithm for binary testing
inferred← citeshttps://doi.org/10.1007/bf00289521openalex-snapshot
Optimal merging of 2 elements with n elements
inferred← citeshttps://doi.org/10.1007/bf01071410openalex-snapshot
On discrete search problems
inferred← citeshttps://doi.org/10.1007/bf01886104openalex-snapshot
On the optimality of a simple prefix code
inferred← citeshttps://doi.org/10.1007/bf01896963openalex-snapshot
Some remarks on the construction of optimal codes
inferred← citeshttps://doi.org/10.1016/0012-365x(80)90051-5openalex-snapshot
An explicit expression for the cost of a class of Huffman trees
inferred← citeshttps://doi.org/10.1016/b978-0-7204-2262-7.50028-4openalex-snapshot
Combinatorial Search Problems
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)71373-2openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1051/m2an/197206r300231openalex-snapshot
Procédures optimales pour le classement des $t$ meilleurs articles parmi $n$ au moyen de comparaisons binaires
inferred← citeshttps://doi.org/10.1080/03610928708829546openalex-snapshot
Group-testing, halving procedures, and binary search
inferred← citeshttps://doi.org/10.1109/34.476006openalex-snapshot
An active testing model for tracking roads in satellite images
inferred← citeshttps://doi.org/10.1109/isit.1991.695153openalex-snapshot
Combinatorial Search Problems
inferred← citeshttps://doi.org/10.1111/j.1467-842x.1988.tb00476.xopenalex-snapshot
EFFECTS OF ERRORS IN INSPECTION ON A BINARY METHOD FOR ISOLATING NONCONFORMING ITEMS
inferred← citeshttps://doi.org/10.1137/0123019openalex-snapshot
Optimal Binary Identification Procedures
inferred← citeshttps://doi.org/10.1145/1478873.1478936openalex-snapshot
Establishing lower bounds on algorithms
inferred← citeshttps://doi.org/10.1145/321738.321749openalex-snapshot
A Class of Merging Algorithms
inferred← citeshttps://doi.org/10.1287/opre.20.2.335openalex-snapshot
Some Reliability Fault-Testing Models
inferred← citeshttps://doi.org/10.3390/a15010010openalex-snapshot
Searching Monotone Arrays: A Survey
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.