On the public citation graph
Complexity of problems on graphs represented as OBDDs
0 signed · 70 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-51083-4_77openalex-snapshot
Succinct representations of counting problems
inferredcites →https://doi.org/10.1007/3-540-52292-1_20openalex-snapshot
The complexity of graph problems for succinctly represented graphs
inferredcites →https://doi.org/10.1007/3-540-58179-0_53openalex-snapshot
Methodology and system for practical formal verification of reactive hardware
inferredcites →https://doi.org/10.1007/978-1-4615-3422-8_30openalex-snapshot
The Complexity of Algorithmic Problems on Succinct Instances
inferredcites →https://doi.org/10.1007/bf01383968openalex-snapshot
Verification of the Futurebus+ cache coherence protocol
inferredcites →https://doi.org/10.1016/0004-3702(96)00014-8openalex-snapshot
The complexity of searching implicit graphs
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1016/s0019-9958(83)80004-7openalex-snapshot
Succinct representations of graphs
inferredcites →https://doi.org/10.1016/s0019-9958(86)80009-2openalex-snapshot
A note on succinct representations of graphs
inferredcites →https://doi.org/10.1109/ccc.1996.507675openalex-snapshot
Succinct representation, leaf languages, and projection reductions
inferredcites →https://doi.org/10.1109/iccd.1989.63394openalex-snapshot
Ordered binary decision diagrams and circuit structure
inferredcites →https://doi.org/10.1109/sfcs.1981.3openalex-snapshot
A complexity theory based on Boolean algebra
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
inferredcites →https://doi.org/10.1145/225058.225098openalex-snapshot
A lower bound for integer multiplication with read-once branching programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11611257_45openalex-snapshot
The Complexity of Problems on Implicitly Represented Inputs
inferred← citeshttps://doi.org/10.1007/11682462_71openalex-snapshot
Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
inferred← citeshttps://doi.org/10.1007/11847250_7openalex-snapshot
On the OBDD Size for Graphs of Bounded Tree- and Clique-Width
inferred← citeshttps://doi.org/10.1007/3-540-44577-3_12openalex-snapshot
Progress on the State Explosion Problem in Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_10openalex-snapshot
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_48openalex-snapshot
The Complexity of Some Basic Problems for Dynamic Process Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_9openalex-snapshot
Restrictive acceptance suffices for equivalence problems
inferred← citeshttps://doi.org/10.1007/978-3-031-66149-5_6openalex-snapshot
Automated Reasoning in Quantum Circuit Compilation
inferred← citeshttps://doi.org/10.1007/978-3-032-05792-1_20openalex-snapshot
Numerical Errors in Quantitative System Analysis With Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-04921-2_23openalex-snapshot
Succinct Encodings of Graph Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_19openalex-snapshot
Processing Succinct Matrices and Vectors
inferred← citeshttps://doi.org/10.1007/978-3-540-30559-0_13openalex-snapshot
A Symbolic Approach to the All-Pairs Shortest-Paths Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_33openalex-snapshot
Lower Bounds on the OBDD Size of Graphs of Some Popular Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_61openalex-snapshot
Symbolic Topological Sorting with OBDDs
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_9openalex-snapshot
Searching Trees: An Essay
inferred← citeshttps://doi.org/10.1007/978-3-642-11266-9_19openalex-snapshot
Symbolic OBDD-Based Reachability Analysis Needs Exponential Space
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_18openalex-snapshot
Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-15240-5_21openalex-snapshot
On Symbolic Representations of Maximum Matchings and (Un)directed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_2openalex-snapshot
On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_45openalex-snapshot
Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_41openalex-snapshot
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
inferred← citeshttps://doi.org/10.1007/s00224-015-9666-9openalex-snapshot
Processing Succinct Matrices and Vectors
inferred← citeshttps://doi.org/10.1007/s00453-007-9079-5openalex-snapshot
Symbolic Graphs: Linear Solutions to Connectivity Related Problems
inferred← citeshttps://doi.org/10.1016/j.disc.2008.01.022openalex-snapshot
On the OBDD size for graphs of bounded tree- and clique-width
inferred← citeshttps://doi.org/10.1016/j.ic.2016.06.009openalex-snapshot
CNF and DNF succinct graph encodings
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.07.022openalex-snapshot
Exponential space complexity for OBDD-based reachability analysis
inferred← citeshttps://doi.org/10.1016/j.jco.2012.10.001openalex-snapshot
On the complexity of the multivariate resultant
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.11.003openalex-snapshot
A parametric analysis of the state-explosion problem in model checking
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.05.006openalex-snapshot
Model-checking hierarchical structures
inferred← citeshttps://doi.org/10.1016/j.jda.2005.01.008openalex-snapshot
Symbolic topological sorting with OBDDs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.11.029openalex-snapshot
On symbolic OBDD-based algorithms for the minimum spanning tree problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.07.020openalex-snapshot
Implicit computation of maximum bipartite matchings by sublinear functional operations
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00297-xopenalex-snapshot
BDDs—design, analysis, complexity, and applications
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00033-5openalex-snapshot
Symbolic model checking for μ-calculus requires exponential time
inferred← citeshttps://doi.org/10.1109/ccc.1998.694598openalex-snapshot
How to encode a logical structure by an OBDD
inferred← citeshttps://doi.org/10.1109/lics.2000.855756openalex-snapshot
Definability and compression
inferred← citeshttps://doi.org/10.1109/lics.2005.29openalex-snapshot
Model-Checking Hierarchical Structures
inferred← citeshttps://doi.org/10.1112/s146115700000022xopenalex-snapshot
Restrictive Acceptance Suffices for Equivalence Problems
inferred← citeshttps://doi.org/10.1137/s0097539704445950openalex-snapshot
Word Problems and Membership Problems on Compressed Words
inferred← citeshttps://doi.org/10.1145/304181.304202openalex-snapshot
Query optimization for selections using bitmaps
inferred← citeshttps://doi.org/10.1145/3209108.3209203openalex-snapshot
Sequential Relational Decomposition
inferred← citeshttps://doi.org/10.1145/3236024.3236025openalex-snapshot
Data race detection on compressed traces
inferred← citeshttps://doi.org/10.1145/3366018openalex-snapshot
On the Complexity of Cache Analysis for Different Replacement Policies
inferred← citeshttps://doi.org/10.1145/3468264.3468557openalex-snapshot
Checking LTL[F,G,X] on compressed traces in polynomial time
inferred← citeshttps://doi.org/10.1145/876638.876643openalex-snapshot
Counterexample-guided abstraction refinement for symbolic model checking
inferred← citeshttps://doi.org/10.1207/s15327809jls0904_4openalex-snapshot
Participatory Simulations: Building Collaborative Understanding Through Immersive Dynamic Modeling
inferred← citeshttps://doi.org/10.17877/de290r-17161openalex-snapshot
On graph algorithms for large-scale graphs
inferred← citeshttps://doi.org/10.22028/d291-26532openalex-snapshot
A uniform approach to the complexity and analysis of succinct systems
inferred← citeshttps://doi.org/10.46298/lmcs-18(1:37)2022openalex-snapshot
Sequential Relational Decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.1305.2772openalex-snapshot
OBDD-Based Representation of Interval Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1402.3452openalex-snapshot
Processing Succinct Matrices and Vectors
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9907041openalex-snapshot
Restrictive Acceptance Suffices for Equivalence Problems
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.