Search results for "OBDDs"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
129	Jawahar Jain, Ingo Wegener, Masahiro Fujita	A Note on Complexity of OBDD Composition and Efficiency of Partitioned-OBDDs over OBDDs.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	Partitioned-OBDDs, composition, OBDDs
110	Daniel Král	Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization.	MFCS	2000	DBLP DOI BibTeX RDF
91	Beate Bollig, Ingo Wegener	Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems.	ICALP	2000	DBLP DOI BibTeX RDF
91	Martin Sauerhoff	On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions.	STACS	1999	DBLP DOI BibTeX RDF
83	Beate Bollig, Ingo Wegener	Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams.	Theory Comput. Syst.	1999	DBLP DOI BibTeX RDF
83	Beate Bollig, Ingo Wegener	Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams.	MFCS	1997	DBLP DOI BibTeX RDF
78	Detlef Sieling	Minimization Problems for Parity OBDDs.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Parity OBDD, Nonapproximability
78	Detlef Sieling	Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract).	FSTTCS	1999	DBLP DOI BibTeX RDF
78	Jan Behrens, Stephan Waack	Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering.	STACS	1998	DBLP DOI BibTeX RDF
69	Don E. Ross, Kenneth M. Butler, M. Ray Mercer	Exact ordered binary decision diagram size when representing classes of symmetric functions.	J. Electron. Test.	1991	DBLP DOI BibTeX RDF	Boolean function representation, Binary decision diagram, symbolic simulation, symmetric functions, ordered binary decision diagram
64	André Gronemeier	Approximating Boolean Functions by OBDDs.	MFCS	2004	DBLP DOI BibTeX RDF
64	Martin Sauerhoff	On the size of randomized OBDDs and read-once branching programs for k-stable functions.	Comput. Complex.	2001	DBLP DOI BibTeX RDF	read-once branching program, zero error, lower bounds, randomness, communication complexity, OBDD
64	Jochen Bern, Christoph Meinel, Anna Slobodová	Global rebuilding of OBDDs Avoiding Memory Requirement Maxima.	CAV	1995	DBLP DOI BibTeX RDF
64	Bernd Becker 0001, Rolf Drechsler, Michael Theobald	OKFDDs versus OBDDs and OFDDs.	ICALP	1995	DBLP DOI BibTeX RDF
55	Daniel Sawitzki	On Symbolic Scheduling Independent Tasks with Restricted Execution Times.	WEA	2005	DBLP DOI BibTeX RDF
55	Juraj Hromkovic, Martin Sauerhoff	The Power of Nondeterminism and Randomness for Oblivious Branching Programs.	Theory Comput. Syst.	2003	DBLP DOI BibTeX RDF
55	Wolfgang Günther 0001, Rolf Drechsler	Implementation of Read- k-times BDDs on Top of Standard BDD Packages.	VLSI Design	2001	DBLP DOI BibTeX RDF
50	Pietro Torasso, Gianluca Torta	Computing Minimum-Cardinality Diagnoses Using OBDDs.	KI	2003	DBLP DOI BibTeX RDF
50	Laura Heinrich-Litan, Paul Molitor	Least Upper Bounds for the Size of OBDDs Using Symmetry Properties.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	upper worst case bounds, partial symmetric Boolean functions, Binary decision diagrams, variable ordering
50	Anna Slobodová	On the Composition Problem for OBDDs with Multiple Variable Orders.	MFCS	1998	DBLP DOI BibTeX RDF
50	Anna Slobodová, Christoph Meinel	Sample Method for Minimization of OBDDs.	SOFSEM	1998	DBLP DOI BibTeX RDF
50	Kazuyoshi Hayase, Hiroshi Imai	OBDDs of a Monotone Function and of Its Prime Implicants.	ISAAC	1996	DBLP DOI BibTeX RDF
45	Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz	Very narrow quantum OBDDs and width hierarchies for classical OBDDs.	CoRR	2014	DBLP BibTeX RDF
45	Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz	Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs.	DCFS	2014	DBLP DOI BibTeX RDF
41	Beate Bollig, Jochen Klump	New Results on the Most Significant Bit of Integer Multiplication.	ISAAC	2008	DBLP DOI BibTeX RDF
41	Changxing Dong, Paul Molitor	What Graphs can be Efficiently Represented by BDDs?	ICCTA	2007	DBLP DOI BibTeX RDF
41	Lijun Wu, Jinshu Su	Symbolic Model Checking Temporal Logics of Knowledge in Multi-Agent System Via Extended Mu-Calculus.	LSMS (1)	2007	DBLP DOI BibTeX RDF
41	Daniel Sawitzki	Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms.	LATIN	2006	DBLP DOI BibTeX RDF
41	Guoqiang Pan, Moshe Y. Vardi	Symbolic Decision Procedures for QBF.	CP	2004	DBLP DOI BibTeX RDF
41	Daniel Sawitzki	Implicit Flow Maximization by Iterative Squaring.	SOFSEM	2004	DBLP DOI BibTeX RDF
41	Takashi Horiyama, Toshihide Ibaraki	Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams.	ISAAC	2001	DBLP DOI BibTeX RDF
41	Yu-Liang Wu, Hongbing Fan, Malgorzata Marek-Sadowska, C. K. Wong	OBDD Minimization Based on Two-Level Representation of Boolean Functions.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	optimum variable ordering, formal verification, CAD, Binary Decision Diagram
41	Jaehong Park, Carl Pixley, Michael Burns, Hyunwoo Cho	An Efficient Logic Equivalence Checker for Industrial Circuits.	J. Electron. Test.	2000	DBLP DOI BibTeX RDF	logic checking, ATPG, BDD, formal, combinational, functional verification, equivalence, MET
41	Stefan Droste, Dominic Heutelbeck, Ingo Wegener	Distributed Hybrid Genetic Programming for Learning Boolean Functions.	PPSN	2000	DBLP DOI BibTeX RDF
41	Harry Preuß, Anand Srivastav	Blockwise Variable Orderings for Shared BDDs.	MFCS	1998	DBLP DOI BibTeX RDF
41	Randal E. Bryant	Binary decision diagrams and beyond: enabling technologies for formal verification.	ICCAD	1995	DBLP DOI BibTeX RDF
41	C. Leonard Berman	Circuit width, register allocation, and ordered binary decision diagrams.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1991	DBLP DOI BibTeX RDF
36	Dana Ron, Gilad Tsur	Testing Computability by Width Two OBDDs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
36	Robin Nunkesser, Philipp Woelfel	Representation of Graphs by OBDDs.	ISAAC	2005	DBLP DOI BibTeX RDF
36	Beate Bollig, Martin Sauerhoff, Ingo Wegener	On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs.	CCC	2001	DBLP DOI BibTeX RDF	Computational complexity, lower bounds, approximations, binary decision diagrams, branching programs
36	Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, Mahesh Viswanathan 0001	Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract).	STACS	1998	DBLP DOI BibTeX RDF
36	Ingo Wegener	The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions.	WG	1993	DBLP DOI BibTeX RDF
28	Gerard J. Holzmann, Anuj Puri	A Minimized Automaton Representation of Reachable States.	Int. J. Softw. Tools Technol. Transf.	1999	DBLP DOI BibTeX RDF	Model checking, Verification, Data compression, Finite automata, Spin, OBDDs, Sharing trees
28	Dinos Moundanos, Jacob A. Abraham	On Design Validation Using Verification Technology.	J. Electron. Test.	1999	DBLP DOI BibTeX RDF	extracted control flow machine, verification, abstraction, test generation, coverage analysis, OBDDs
28	Jawahar Jain, James R. Bitner, Magdy S. Abadir, Jacob A. Abraham, Donald S. Fussell	Indexed BDDs: Algorithmic Advances in Techniques to Represent and Verify Boolean Functions.	IEEE Trans. Computers	1997	DBLP DOI BibTeX RDF	free BDDs, IBDDs, verification, Boolean functions, satisfiability, BDDs, graph representations, OBDDs, canonical representations
28	Beate Bollig	On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem.	SOFSEM	2009	DBLP DOI BibTeX RDF	variable ordering problem, Computational complexity, ordered binary decision diagrams, threshold functions
28	Tianlong Gu, Huadong Liu	The symbolic OBDD scheme for generating mechanical assembly sequences.	Formal Methods Syst. Des.	2008	DBLP DOI BibTeX RDF	Assemble sequence planning, Assembly liaison graph, Assembly sequences generation, Ordered binary decision diagram
28	Randal E. Bryant	A View from the Engine Room: Computational Support for Symbolic Model Checking.	25 Years of Model Checking	2008	DBLP DOI BibTeX RDF
28	Robert Mateescu, Rina Dechter	AND/OR Multi-valued Decision Diagrams for Constraint Networks.	Concurrency, Graphs and Models	2008	DBLP DOI BibTeX RDF
28	Nathan Segerlind	On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs.	CCC	2008	DBLP DOI BibTeX RDF	lower bounds, resolution, ordered binary decision diagrams, propositional proof complexity
28	Louis Kruger, Somesh Jha, Eu-Jin Goh, Dan Boneh	Secure function evaluation with ordered binary decision diagrams.	CCS	2006	DBLP DOI BibTeX RDF	binary decision diagrams, secure function evaluation
28	Farid M. Ablayev, Aida Gainutdinova	Complexity of Quantum Uniform and Nonuniform Automata.	Developments in Language Theory	2005	DBLP DOI BibTeX RDF
28	Will Marrero	Using BDDs to Decide CTL.	TACAS	2005	DBLP DOI BibTeX RDF	validity, satisfiability, BDDs, CTL, tableau
28	Weibo Mao, Jinzhao Wu	Application of Wu's method to symbolic model checking.	ISSAC	2005	DBLP DOI BibTeX RDF	Wu's method, symbolic model checking, characteristic set
28	Jinbo Huang, Adnan Darwiche	Using DPLL for Efficient OBDD Construction.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
28	Christian Stangier, Thomas Sidle	Invariant Checking Combining Forward and Backward Traversal.	FMCAD	2004	DBLP DOI BibTeX RDF
28	Tatsuhiro Tsuchiya, Shin'ichi Nagano, Rohayu Bt Paidi, Tohru Kikuno	Symbolic Model Checking for Self-Stabilizing Algorithms.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	distributed algorithms, Self-stabilization, symbolic model checking, automatic verification
28	Adnan Darwiche	Decomposable negation normal form.	J. ACM	2001	DBLP DOI BibTeX RDF	Boolean functions, satisfiability, propositional logic, model-based diagnosis, knowledge compilation
28	Shin-ichi Minato	Zero-suppressed BDDs and their applications.	Int. J. Softw. Tools Technol. Transf.	2001	DBLP DOI BibTeX RDF	Boolean function, BDD, Combinatorial problem, VLSI CAD, ZBDD
28	Christoph Meinel, Christian Stangier	Data Structures for Boolean Functions.	Computational Discrete Mathematics	2001	DBLP DOI BibTeX RDF
28	Philipp Woelfel	New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing.	STACS	2001	DBLP DOI BibTeX RDF
28	Christoph Meinel, Christian Stangier	Speeding up symbolic model checking by accelerating dynamic variable reordering.	ACM Great Lakes Symposium on VLSI	2000	DBLP DOI BibTeX RDF
28	Rune Møller Jensen, Manuela M. Veloso	OBDD-based Universal Planning: Specifying and Solving Planning Problems for Synchronized Agents in Non-deterministic Domains.	Artificial Intelligence Today	1999	DBLP DOI BibTeX RDF
28	Takashi Horiyama, Toshihide Ibaraki	Ordered Binary Decision Diagrams as Knowledge-Bases.	ISAAC	1999	DBLP DOI BibTeX RDF
28	Wolfgang Günther 0001, Rolf Drechsler	Minimization of Free BDDs.	ASP-DAC	1999	DBLP DOI BibTeX RDF
28	Martin Sauerhoff	Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables.	FSTTCS	1999	DBLP DOI BibTeX RDF
28	Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav	Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract).	STACS	1998	DBLP DOI BibTeX RDF
28	Christoph Meinel, Thorsten Theobald	On the Influence of the State Encoding on OBDD-Representations of Finite State Machines.	MFCS	1997	DBLP DOI BibTeX RDF
28	Stephan Waack	On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams.	STACS	1997	DBLP DOI BibTeX RDF
28	Christoph Meinel, Anna Slobodová	A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams.	STACS	1997	DBLP DOI BibTeX RDF
28	Rolf Drechsler, Nicole Göckel, Bernd Becker 0001	Learning Heuristics for OBDD Minimization by Evolutionary Algorithms.	PPSN	1996	DBLP DOI BibTeX RDF
28	Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara	On the Hardness of Approximating the Minimum Consistent OBDD Problem.	SWAT	1996	DBLP DOI BibTeX RDF
28	Rolf Drechsler, Bernd Becker 0001	Dynamic minimization of OKFDDs.	ICCD	1995	DBLP DOI BibTeX RDF	dynamic minimization, OKFDDs, small Ordered Kronecker Functional Decision Diagrams, Ordered Functional Decision Diagrams, dynamic variable ordering, decomposition type choice, OKFDD package, Boolean functions, logic design, directed graphs, decision theory, diagrams, minimisation, Ordered Binary Decision Diagrams, PUMA
23	Rishat Ibrahimov, Kamil Khadiev, Krisjanis Prusis, Abuzer Yakaryilmaz	Error-Free Affine, Unitary, and Probabilistic OBDDs.	Int. J. Found. Comput. Sci.	2021	DBLP DOI BibTeX RDF
23	Milos Chromý, Ondrej Cepek	Compiling SL representations of Boolean functions into OBDDs.	ISAIM	2020	DBLP BibTeX RDF
23	Rishat Ibrahimov, Kamil Khadiev, Krisjanis Prusis, Abuzer Yakaryilmaz	Error-Free Affine, Unitary, and Probabilistic OBDDs.	DCFS	2018	DBLP DOI BibTeX RDF
23	Yong Lai, Dayou Liu, Minghao Yin	New Canonical Representations by Augmenting OBDDs with Conjunctive Decomposition.	J. Artif. Intell. Res.	2017	DBLP DOI BibTeX RDF
23	Simone Bova, Friedrich Slivovsky	On Compiling Structured CNFs to OBDDs.	Theory Comput. Syst.	2017	DBLP DOI BibTeX RDF
23	Rishat Ibrahimov, Kamil Khadiev, Abuzer Yakaryilmaz	Exact Affine OBDDs.	CoRR	2017	DBLP BibTeX RDF
23	Aida Gainutdinova, Abuzer Yakaryilmaz	Nondeterministic Unitary OBDDs.	CSR	2017	DBLP DOI BibTeX RDF
23	Yong Lai, Dayou Liu, Minghao Yin	New Canonical Representations by Augmenting OBDDs with Conjunctive Decomposition (Extended Abstract).	IJCAI	2017	DBLP DOI BibTeX RDF
23	Simone Bova	SDDs are Exponentially More Succinct than OBDDs.	CoRR	2016	DBLP BibTeX RDF
23	Aida Gainutdinova, Abuzer Yakaryilmaz	Nondeterministic unitary OBDDs.	CoRR	2016	DBLP BibTeX RDF
23	Simone Bova	SDDs Are Exponentially More Succinct than OBDDs.	AAAI	2016	DBLP DOI BibTeX RDF
23	Marc Bury	OBDDs and (Almost) $k$-wise Independent Random Variables.	CoRR	2015	DBLP BibTeX RDF
23	Simone Bova, Friedrich Slivovsky	On Compiling Structured CNFs to OBDDs.	CSR	2015	DBLP DOI BibTeX RDF
23	Simone Bova, Friedrich Slivovsky	On Compiling Structured CNFs to OBDDs.	CoRR	2014	DBLP BibTeX RDF
23	Igor Razgon	On OBDDs for CNFs of Bounded Treewidth.	KR	2014	DBLP BibTeX RDF
23	Igor Razgon	On OBDDs for CNFs of bounded treewidth.	CoRR	2013	DBLP BibTeX RDF
23	Anna Bernasconi 0001, Valentina Ciriani, Lorenzo Lago	Error resilient OBDDs.	DDECS	2013	DBLP DOI BibTeX RDF
23	Dana Ron, Gilad Tsur	Testing computability by width-two OBDDs.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
23	Yanyan Xu 0001, Wei Chen 0018, Kaile Su, Wenhui Zhang	Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition.	FAW-AAIM	2012	DBLP DOI BibTeX RDF
23	Liu Yang, Pratyusa K. Manadhata, William G. Horne, Prasad Rao, Vinod Ganapathy	Fast submatch extraction using OBDDs.	ANCS	2012	DBLP DOI BibTeX RDF
23	Beate Bollig, Marc Gillé	Randomized OBDDs for the most significant bit of multiplication need exponential space.	Inf. Process. Lett.	2011	DBLP DOI BibTeX RDF
23	Liu Yang, Rezwana Karim, Vinod Ganapathy, Randy Smith	Fast, memory-efficient regular expression matching with NFA-OBDDs.	Comput. Networks	2011	DBLP DOI BibTeX RDF
23	Dana Ron, Gilad Tsur	Testing Computability by Width-Two OBDDs.	Electron. Colloquium Comput. Complex.	2011	DBLP BibTeX RDF
23	Joshua Brody, Kevin Matulef, Chenggang Wu	Lower Bounds for Testing Computability by Small Width OBDDs.	TAMC	2011	DBLP DOI BibTeX RDF
23	Matti Järvisalo	On the Relative Efficiency of DPLL and OBDDs with Axiom and Join.	CP	2011	DBLP DOI BibTeX RDF
23	Beate Bollig, Marc Gillé	Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size.	SOFSEM	2011	DBLP DOI BibTeX RDF
23	Oded Goldreich 0001	On Testing Computability by Small Width OBDDs.	Electron. Colloquium Comput. Complex.	2010	DBLP BibTeX RDF