On the public citation graph

On selecting the largest element in spite of erroneous information

0 signed · 38 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.1016/0022-0000(80)90014-8openalex-snapshot
Coping with errors in binary search procedures
inferredcites →https://doi.org/10.1016/0304-3975(84)90104-xopenalex-snapshot
Coping with known patterns of lies in a search game
inferredcites →https://doi.org/10.1016/0315-0860(77)90131-8openalex-snapshot
Adventures of a mathematician
inferredcites →https://doi.org/10.1016/0378-4754(84)90118-6openalex-snapshot
Information, uncertainty, complexity
inferredcites →https://doi.org/10.1016/b978-0-7204-2262-7.50028-4openalex-snapshot
Combinatorial Search Problems
inferredcites →https://doi.org/10.1109/isit.1991.695153openalex-snapshot
Combinatorial Search Problems
inferredcites →https://doi.org/10.1137/0214009openalex-snapshot
On Fault-Tolerant Networks for Sorting
inferredcites →https://doi.org/10.1145/356707.356711openalex-snapshot
A Survey of Analysis Techniques for Discrete Algorithms
inferredcites →https://doi.org/10.1201/9781351074315-24openalex-snapshot
Adventures of a Mathematician
inferredcites →https://doi.org/10.2307/2344967openalex-snapshot
A Survey of Combinatorial Theory.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-22177-9_18openalex-snapshot
Recurring Comparison Faults: Sorting and Finding the Minimum
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_5openalex-snapshot
Sorting and Selection with Imprecise Comparisons
inferred← citeshttps://doi.org/10.1007/978-3-642-04414-4_22openalex-snapshot
Error-Correcting Tournaments
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_14openalex-snapshot
Minimum and Maximum against k Lies
inferred← citeshttps://doi.org/10.1007/s00453-021-00880-1openalex-snapshot
Approximate Minimum Selection with Unreliable Comparisons
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90203-8openalex-snapshot
On sorting in the presence of erroneous information
inferred← citeshttps://doi.org/10.1016/j.dam.2005.02.015openalex-snapshot
Searching for a counterfeit coin with two unreliable weighings
inferred← citeshttps://doi.org/10.1016/j.dam.2010.01.010openalex-snapshot
Finding the maximum and minimum elements with one lie
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103699openalex-snapshot
Approximate selection with unreliable comparisons in sublinear time
inferred← citeshttps://doi.org/10.1016/s0020-0255(96)00155-7openalex-snapshot
Group testing with unreliable tests
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00012-1openalex-snapshot
Finding the maximum and minimum
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00303-6openalex-snapshot
Searching games with errors—fifty years of coping with liars
inferred← citeshttps://doi.org/10.1038/s41598-017-14876-xopenalex-snapshot
Microscopy as a statistical, Rényi-Ulam, half-lie game: a new heuristic search strategy to accelerate imaging
inferred← citeshttps://doi.org/10.1109/12.83656openalex-snapshot
Coping with erroneous information while sorting
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195346openalex-snapshot
Robust Max Selection
inferred← citeshttps://doi.org/10.1137/s0097539791195877openalex-snapshot
Computing with Noisy Information
inferred← citeshttps://doi.org/10.1145/100216.100230openalex-snapshot
Computing with unreliable information
inferred← citeshttps://doi.org/10.1145/103418.103469openalex-snapshot
Searching in the presence of linearly bounded errors
inferred← citeshttps://doi.org/10.1145/167088.167129openalex-snapshot
Comparison-based search in the presence of errors
inferred← citeshttps://doi.org/10.1145/2187836.2187969openalex-snapshot
Max algorithms in crowdsourcing environments
inferred← citeshttps://doi.org/10.1145/2701427openalex-snapshot
Sorting and Selection with Imprecise Comparisons
inferred← citeshttps://doi.org/10.1145/2723372.2723722openalex-snapshot
The Importance of Being Expert
inferred← citeshttps://doi.org/10.4086/cjtcs.2012.002openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.0902.3176openalex-snapshot
Error-Correcting Tournaments
inferred← citeshttps://doi.org/10.48550/arxiv.1111.3288openalex-snapshot
Lower bounds for finding the maximum and minimum elements with k lies
inferred← citeshttps://doi.org/10.48550/arxiv.1501.02911openalex-snapshot
Sorting and Selection with Imprecise Comparisons
inferred← citeshttps://doi.org/10.48550/arxiv.1805.02033openalex-snapshot
Approximate Minimum Selection with Unreliable Comparisons in Optimal Expected Time
inferred← citeshttps://doi.org/10.5555/314464.314672openalex-snapshot
On optimal strategies for searching in presence of errors
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.