On the public citation graph

Smoothed Analysis of Algorithms and Heuristics

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 this work says

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

inferredcites →https://doi.org/10.1007/11533719_3openalex-snapshot
Smoothed Analysis of Algorithms and Heuristics
inferredcites →https://doi.org/10.1007/11809678_34openalex-snapshot
Improved On-Line Broadcast Scheduling with Deadlines
inferredcites →https://doi.org/10.1007/s10107-003-0448-9openalex-snapshot
Smoothed analysis of termination of linear programming algorithms
inferredcites →https://doi.org/10.1109/sfcs.2003.1238219openalex-snapshot
Average case and smoothed competitive analysis of the multi-level feedback algorithm
inferredcites →https://doi.org/10.1137/s0097539705447268openalex-snapshot
Typical Properties of Winners and Losers [0.2ex] in Discrete Optimization
inferredcites →https://doi.org/10.1137/s0895479803436202openalex-snapshot
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
inferredcites →https://doi.org/10.1145/1007352.1007409openalex-snapshot
Typical properties of winners and losers in discrete optimization
inferredcites →https://doi.org/10.1145/990308.990310openalex-snapshot
Smoothed analysis of algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1016/j.jco.2009.12.005openalex-snapshot
Adversarial smoothed analysis
inferred← citeshttps://doi.org/10.1017/cbo9781139107068.002openalex-snapshot
Smoothed Analysis of Condition Numbers
inferred← citeshttps://doi.org/10.1090/s0025-5718-08-02060-7openalex-snapshot
The probability that a slightly perturbed numerical analysis problem is difficult
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00034openalex-snapshot
Smoothed Complexity of 2-player Nash Equilibria
inferred← citeshttps://doi.org/10.1137/100782954openalex-snapshot
Smoothed Analysis of Moore–Penrose Inversion
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2021.40openalex-snapshot
Smoothed Analysis of the Condition Number Under Low-Rank Perturbations
inferred← citeshttps://doi.org/10.48550/arxiv.1002.4690openalex-snapshot
Smoothed Analysis of Moore-Penrose Inversion
inferred← citeshttps://doi.org/10.48550/arxiv.1302.6004openalex-snapshot
Smoothed analysis of componentwise condition numbers for sparse matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1503.06572openalex-snapshot
A Machine Learning Approach to Predicting the Smoothed Complexity of Sorting Algorithms
showing the first 9 of 10 · page through all 10
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.