On the public citation graph

On the descriptive and algorithmic power of parity ordered binary decision diagrams

https://doi.org/10.1007/bfb0023460
0 signed · 44 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/978-1-4613-1385-4_11openalex-snapshot
Complexity Theoretical Aspects of OFDDs
inferredcites →https://doi.org/10.1007/bf00709139openalex-snapshot
Mod-2-OBDDs—A data structure that generalizes EXOR-sum-of-products and ordered binary decision diagrams
inferredcites →https://doi.org/10.1007/bfb0029633openalex-snapshot
Separating ⊕L from L, NL, co-NL and AL (=P) for Oblivious turing machines of linear access time
inferredcites →https://doi.org/10.1007/bfb0030340openalex-snapshot
An exponential lower bound for one-time-only branching programs
inferredcites →https://doi.org/10.1016/0012-365x(95)90790-ropenalex-snapshot
Efficient data structures for Boolean functions
inferredcites →https://doi.org/10.1016/0020-0190(93)90256-9openalex-snapshot
Reduction of OBDDs in linear time
inferredcites →https://doi.org/10.1016/0304-3975(94)00181-hopenalex-snapshot
On the size of binary decision diagrams representing Boolean functions
inferredcites →https://doi.org/10.1016/0890-5401(91)90039-5openalex-snapshot
On oblivious branching programs of linear length
inferredcites →https://doi.org/10.1051/ita/1988220404471openalex-snapshot
Lower bounds on the complexity of real-time branching programs
inferredcites →https://doi.org/10.1109/12.73590openalex-snapshot
On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
inferredcites →https://doi.org/10.1109/edtc.1995.470359openalex-snapshot
How many decomposition types do we need? [decision diagrams]
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/12130.12134openalex-snapshot
Two lower bounds for branching programs
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
inferredcites →https://doi.org/10.5555/787258.787475openalex-snapshot
How many decomposition types do we need? [decision diagrams]

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(200005)16:3<233::aid-rsa1>3.0.co;2-qopenalex-snapshot
On random orderings of variables for parity ordered binary decision diagrams
inferred← citeshttps://doi.org/10.1006/jcss.2001.1818openalex-snapshot
Lower Bounds for Linearly Transformed OBDDs and FBDDs
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_43openalex-snapshot
Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_19openalex-snapshot
Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_16openalex-snapshot
Techniques for Smaller Intermediary BDDs
inferred← citeshttps://doi.org/10.1007/3-540-45506-x_6openalex-snapshot
Data Structures for Boolean Functions BDDs — Foundations and Applications
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_29openalex-snapshot
Lower Bounds for Linear Transformed OBDDs and FBDDs
inferred← citeshttps://doi.org/10.1007/978-1-4615-0817-5_11openalex-snapshot
Ordered Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_49openalex-snapshot
Communication Complexity and BDD Lower Bound Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_7openalex-snapshot
Algebraic Proofs over Noncommutative Formulas
inferred← citeshttps://doi.org/10.1007/bfb0028564openalex-snapshot
Equivalence test and ordering transformation for parity-OBDDs of different variable ordering
inferred← citeshttps://doi.org/10.1007/bfb0029959openalex-snapshot
Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
inferred← citeshttps://doi.org/10.1007/s00037-005-0188-8openalex-snapshot
Deterministic polynomial identity testing in non-commutative models
inferred← citeshttps://doi.org/10.1007/s00224-001-1011-9openalex-snapshot
The Satisfiability Problem for Probabilistic Ordered Branching Programs
inferred← citeshttps://doi.org/10.1007/s002240000128openalex-snapshot
Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1007/s100090100056openalex-snapshot
Binary decision diagrams in theory and practice
inferred← citeshttps://doi.org/10.1016/j.ic.2011.07.004openalex-snapshot
Algebraic proofs over noncommutative formulas
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00113-6openalex-snapshot
Parity OBDDs cannot be handled efficiently enough
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80601-2openalex-snapshot
Probabilistic Symbolic Simulation and Verification with ⊕-OBDDs
inferred← citeshttps://doi.org/10.1023/a:1014702331828openalex-snapshot
On WLCDs and the Complexity of Word-Level Decision Diagrams—A Lower Bound for Division
inferred← citeshttps://doi.org/10.1051/ita:1999108openalex-snapshot
On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
inferred← citeshttps://doi.org/10.1109/43.703943openalex-snapshot
The complexity of the inclusion operation on OFDD's
inferred← citeshttps://doi.org/10.1109/ccc.2004.11openalex-snapshot
Deterministic polynomial identity testing in non commutative models
inferred← citeshttps://doi.org/10.1109/ccc.2004.1313845openalex-snapshot
Deterministic polynomial identity testing in non commutative models
inferred← citeshttps://doi.org/10.1109/iccad.1997.643565openalex-snapshot
Reachability analysis using partitioned-ROBDDs
inferred← citeshttps://doi.org/10.1109/ismvl.2000.848625openalex-snapshot
Mod-p decision diagrams: a data structure for multiple-valued functions
inferred← citeshttps://doi.org/10.1145/288548.289114openalex-snapshot
Word-level decision diagrams, WLCDs and division
inferred← citeshttps://doi.org/10.4236/iim.2010.22012openalex-snapshot
Probabilistic Verification over GF(2m) Using Mod2-OBDDs
inferred← citeshttps://doi.org/10.5555/266388.266513openalex-snapshot
Reachability analysis using partitioned-ROBDDs
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.