Graph-Based Algorithms for Boolean Function Manipulation is a research paper published in IEEE Transactions on Computers (1986). On theSindex it has a DataRank of 1.4. It has been cited 8,901 times.
Scored on demand from live citation data
Linked data & code
DataRank reads this dataset's downstream impact straight off the citation graph — no black box, no proprietary weighting. How is this computed?
FAIR checklist signals are shown for context only and do not affect DataRank scoring.
We only score data papers we can read in full — never from an abstract alone.
Base Score Contribution
1.4
From this paper's citation signal
Citation Network Contribution
0
Citation network not refreshed for this result
This paper's DataRank is currently driven only by its base citation score. Citation network data was not refreshed for this result.
Learn more about DataRank methodology →d-DNNF Modulo Theories: A General Framework for Polytime SMT Queries
Building Relational Circuits (Invited Talk)
Additional file 1 of Exploring attractor bifurcations in Boolean networks
Additional file 1 of Exploring attractor bifurcations in Boolean networks
On the Complexity of Language Membership for Probabilistic Words
Towards a Coq-verified Chain of Esterel Semantics
On Top-Down Pseudo-Boolean Model Counting
Scalable Precise Computation of Shannon Entropy
An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs
Single Family Algebra Operation on BDDs and ZDDs Leads to Exponential Blow-Up
Clausal Congruence Closure
Hierarchical Stochastic SAT and Quality Assessment of Logic Locking
On Limits of Symbolic Approach to SAT Solving
Bounds on BDD-Based Bucket Elimination
A Characterization of Efficiently Compilable Constraint Languages
MDD Archive for Boosting the Pareto Constraint
OBDD(Join) Proofs Cannot Be Balanced
Extending Merge Resolution to a Family of QBF-Proof Systems
Changing Partitions in Rectangle Decision Lists
Variable Shift SDD: A More Succinct Sentential Decision Diagram