On the public citation graph

coldcore: a GPU framework for exhaustive-coverage combinatorial optimization

0 signed · 6 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.1006/jcph.1999.6413openalex-snapshot
Record Breaking Optimization Results Using the Ruin and Recreate Principle
inferredcites →https://doi.org/10.1007/s10623-004-3804-8openalex-snapshot
Bounds for Covering Codes over Large Alphabets
inferredcites →https://doi.org/10.1016/j.ejor.2016.07.012openalex-snapshot
The late acceptance Hill-Climbing heuristic
inferredcites →https://doi.org/10.1038/s41586-020-2649-2openalex-snapshot
Array programming with NumPy
inferredcites →https://doi.org/10.1109/cgo.2004.1281665openalex-snapshot
LLVM: a compilation framework for lifelong program analysis & transformation
inferredcites →https://doi.org/10.1137/0118025openalex-snapshot
Perfect Codes in the Lee Metric and the Packing of Polyominoes
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.