On the public citation graph

March_dl: Adding Adaptive Heuristics and a New Branching Strategy

https://doi.org/10.3233/sat190016

0 signed · 20 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/978-3-319-40970-2_7openalex-snapshot

Extreme Cases in SAT Problems

inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_49openalex-snapshot

Hierarchical Hardness Models for SAT

inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_50openalex-snapshot

SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT

inferred← citeshttps://doi.org/10.1007/978-3-540-78566-8_18openalex-snapshot

Prototypes for Automated Architectural 3D-Layout

inferred← citeshttps://doi.org/10.1007/978-3-642-01818-3_5openalex-snapshot

Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism

inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_3openalex-snapshot

Efficiently Calculating Evolutionary Tree Measures Using SAT

inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_26openalex-snapshot

iSat: Structure Visualization for SAT Problems

inferred← citeshttps://doi.org/10.1007/978-3-642-41482-4_3openalex-snapshot

Parallel Tree Search for Satisfiability

inferred← citeshttps://doi.org/10.1007/978-3-662-46706-0_24openalex-snapshot

Branching Heuristics in Differential Collision Search with Applications to SHA-512

inferred← citeshttps://doi.org/10.1007/s10601-025-09383-0openalex-snapshot

Preimage attacks on round-reduced MD5, SHA-1, and SHA-256 using parameterized SAT solver

inferred← citeshttps://doi.org/10.1109/ictai.2009.16openalex-snapshot

Local Autarkies Searching for the Dynamic Partition of CNF Formulae

inferred← citeshttps://doi.org/10.1109/ictai.2009.63openalex-snapshot

Toward Easy Parallel SAT Solving

inferred← citeshttps://doi.org/10.1109/securware.2010.42openalex-snapshot

Applications of SAT Solvers to AES Key Recovery from Decayed Key Schedule Images

inferred← citeshttps://doi.org/10.1109/tac.2013.2275892openalex-snapshot

Diagnosis of Discrete Event Systems Using Satisfiability Algorithms: A Theoretical and Empirical Study

inferred← citeshttps://doi.org/10.1137/090777268openalex-snapshot

The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem

inferred← citeshttps://doi.org/10.29007/gzzfopenalex-snapshot

Lookahead-Based SMT Solving

inferred← citeshttps://doi.org/10.3166/ria.24.757-786openalex-snapshot

Diagnostic de systèmes à événements discrets à base de cohérence par SAT

inferred← citeshttps://doi.org/10.3233/sat190041openalex-snapshot

Whose side are you on?1

inferred← citeshttps://doi.org/10.3233/sat190070openalex-snapshot

ManySAT: a Parallel SAT Solver

inferred← citeshttps://doi.org/10.70675/d79e1ec2zb3ffz45b6z9d97za60d60da54f1openalex-snapshot

SAT en Parallèle

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.