Skip header Section
Skip Bibliometrics Section
Algorithms and Data Structures in VLSI DesignOctober 1998
- Authors:
- Christoph Meinel,
- Thorsten Theobald
Skip Abstract Section
Abstract
From the Publisher:
This book provides an introduction to the foundations of this interdisciplinary research area, emphasizing its applications in computer aided circuit design.
Cited By
- Bochkarev A and Smith J (2023). On Aligning Non-Order-Associated Binary Decision Diagrams, INFORMS Journal on Computing, 35:5, (910-928), Online publication date: 1-Sep-2023.
- Ahishakiye F, Requeno Jarabo J, Kristensen L and Stolz V MC/DC Test Cases Generation Based on BDDs Dependable Software Engineering. Theories, Tools, and Applications, (178-197)
Buss S, Itsykson D, Knop A, Riazanov A and Sokolov D (2021). Lower Bounds on OBDD Proofs with Several Orders, ACM Transactions on Computational Logic, 22:4, (1-30), Online publication date: 31-Oct-2021.- Kutsak N and Podymov V (2020). Formal Verification of Three-Valued Digital Waveforms, Automatic Control and Computer Sciences, 54:7, (630-644), Online publication date: 1-Dec-2020.
- Thuijsman S, Hendriks D, Theunissen R, Reniers M and Schiffelers R Computational Effort of BDD-based Supervisor Synthesis of Extended Finite Automata 2019 IEEE 15th International Conference on Automation Science and Engineering (CASE), (486-493)
- Heradio R, Fernandez-Amoros D, Mayr-Dorn C and Egyed A Supporting the statistical analysis of variability models Proceedings of the 41st International Conference on Software Engineering, (843-853)
- Shih A, Choi A and Darwiche A A symbolic approach to explaining Bayesian network classifiers Proceedings of the 27th International Joint Conference on Artificial Intelligence, (5103-5111)
- Dathathri S and Murray R Decomposing GR(1) games with singleton liveness guarantees for efficient synthesis 2017 IEEE 56th Annual Conference on Decision and Control (CDC), (911-917)
- Lohrey M and Schmidt-Schauβ M (2017). Processing Succinct Matrices and Vectors, Theory of Computing Systems, 61:2, (322-351), Online publication date: 1-Aug-2017.
- Haus U and Michini C (2017). Compact representations of all members of an independence system, Annals of Mathematics and Artificial Intelligence, 79:1-3, (145-162), Online publication date: 1-Mar-2017.
- Niveau A and Zanuttini B Efficient representations for the modal logic S5 Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, (1223-1229)
- Kroer C, Svendsen M, Jensen R, Kiniry J and Leknes E (2016). Symbolic Configuration for Interactive Container Ship Stowage Planning, Computational Intelligence, 32:2, (259-283), Online publication date: 1-May-2016.
- Semenov A and Otpuschennikov I (2016). On one class of decision diagrams, Automation and Remote Control, 77:4, (617-628), Online publication date: 1-Apr-2016.
- Heyse K, Al Farisi B, Bruneel K and Stroobandt D (2015). TCONMAP, ACM Transactions on Design Automation of Electronic Systems, 20:4, (1-27), Online publication date: 28-Sep-2015.
- Choi A, Van Den Broeck G and Darwiche A Tractable learning for structured probability spaces Proceedings of the 24th International Conference on Artificial Intelligence, (2861-2868)
- Fazzinga B, Flesca S and Parisi F (2015). On the Complexity of Probabilistic Abstract Argumentation Frameworks, ACM Transactions on Computational Logic, 16:3, (1-39), Online publication date: 8-Jul-2015.
- Lohrey M, Maneth S and Noeth E XML compression via DAGs Proceedings of the 16th International Conference on Database Theory, (69-80)
- Ciriani V, De Capitani di Vimercati S, Foresti S, Livraga G and Samarati P (2012). An OBDD approach to enforce confidentiality and visibility constraints in data publishing, Journal of Computer Security, 20:5, (463-508), Online publication date: 1-Sep-2012.
- Niveau A, Fargier H and Pralet C Representing CSPs with set-labeled diagrams Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning, (137-171)
- Ciriani V, De Capitani Di Vimercati S, Foresti S, Livraga G and Samarati P Enforcing confidentiality and data visibility constraints Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy, (44-59)
- Chorowski J and Zurada J Top-down induction of reduced ordered decision diagrams from neural networks Proceedings of the 21st international conference on Artificial neural networks - Volume Part II, (309-316)
- Fink R and Olteanu D On the optimal approximation of queries using tractable propositional languages Proceedings of the 14th International Conference on Database Theory, (174-185)
- Gil Y, Kremer-Davidson S and Maman I Sans constraints? feature diagrams vs. feature models Proceedings of the 14th international conference on Software product lines: going beyond, (271-285)
- Tang Y, Norman T and Parsons S Computing argumentation in polynomial number of BDD operations Proceedings of the 7th international conference on Argumentation in Multi-Agent Systems, (268-285)
- Olteanu D and Huang J Secondary-storage confidence computation for conjunctive queries with inequalities Proceedings of the 2009 ACM SIGMOD International Conference on Management of data, (389-402)
- Mendonca M, Wasowski A, Czarnecki K and Cowan D Efficient compilation techniques for large scale feature models Proceedings of the 7th international conference on Generative programming and component engineering, (13-22)
- Ciesinski F, Baier C, Größer M and Parker D Generating Compact MTBDD-Representations from Probmela Specifications Proceedings of the 15th international workshop on Model Checking Software, (60-76)
- Koch C and Olteanu D (2008). Conditioning probabilistic databases, Proceedings of the VLDB Endowment, 1:1, (313-325), Online publication date: 1-Aug-2008.
- Hadzic T, Lesaint D, Mehta D, O'Sullivan B, Quesada L and Wilson N A BDD Approach to the Feature Subscription Problem Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence, (698-702)
- Janota M and Botterweck G Formal approach to integrating feature and architecture models Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering, (31-45)
- Jensen R, Veloso M and Bryant R (2008). State-set branching, Artificial Intelligence, 172:2-3, (103-139), Online publication date: 1-Feb-2008.
- Zhang M, Zhang X, Zhang X and Prabhakar S Tracing lineage beyond relational operators Proceedings of the 33rd international conference on Very large data bases, (1116-1127)
- Behle M On threshold BDDs and the optimal variable ordering problem Proceedings of the 1st international conference on Combinatorial optimization and applications, (124-135)
- Amano K and Maruoka A (2007). Better upper bounds on the QOBDD size of integer multiplication, Discrete Applied Mathematics, 155:10, (1224-1232), Online publication date: 21-May-2007.
- Huang J and Darwiche A (2007). The language of search, Journal of Artificial Intelligence Research, 29:1, (191-219), Online publication date: 1-May-2007.
- Hadžic T, Wasowski A and Andersen H Techniques for efficient interactive configuration of distribution networks Proceedings of the 20th international joint conference on Artifical intelligence, (100-105)
- Collette S, Raskin J and Servais F On the symbolic computation of the hardest configurations of the RUSH HOUR game Proceedings of the 5th international conference on Computers and games, (220-233)
- Ossowski J and Baier C (2006). Symbolic Reasoning with Weighted and Normalized Decision Diagrams, Electronic Notes in Theoretical Computer Science (ENTCS), 151:1, (39-56), Online publication date: 1-Mar-2006.
- Torasso P and Torta G Model-Based diagnosis through OBDD compilation Reasoning, Action and Interaction in AI Theories and Systems, (287-305)
- Yoon S, Nardini C, Benini L and De Micheli G (2005). Discovering Coherent Biclusters from Gene Expression Data Using Zero-Suppressed Binary Decision Diagrams, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2:4, (339-354), Online publication date: 1-Oct-2005.
- Hao X and Brewer F Wirelength optimization by optimal block orientation Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, (64-70)
- Lenders W and Baier C Genetic algorithms for the variable ordering problem of binary decision diagrams Proceedings of the 8th international conference on Foundations of Genetic Algorithms, (1-20)
- GhasemZadeh M, Klotz V and Meinel C Embedding memoization to the semantic tree search for deciding QBFs Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence, (681-693)
- Zhang X, Gupta R and Zhang Y Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams Proceedings of the 26th International Conference on Software Engineering, (502-511)
- Bounded model checking of infinite state systems Proceedings of the Second ACM/IEEE International Conference on Formal Methods and Models for Co-Design, (17-26)
- Berndl M, Lhoták O, Qian F, Hendren L and Umanee N Points-to analysis using BDDs Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation, (103-114)
- Berndl M, Lhoták O, Qian F, Hendren L and Umanee N (2003). Points-to analysis using BDDs, ACM SIGPLAN Notices, 38:5, (103-114), Online publication date: 9-May-2003.
- Gentilini R, Piazza C and Policriti A Computing strongly connected components in a linear number of symbolic steps Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (573-582)
- Meinel C, Sack H and Wagner A WWW.BDD-Portal.ORG Experimental algorithmics, (127-138)
- Meinel C and Theobald T (2001). Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines, Formal Methods in System Design, 18:3, (285-301), Online publication date: 1-May-2001.
- Meinel C and Stangier C Data structures for Boolean functions Computational Discrete Mathematics, (61-78)
- Groote J and van de Pol J Equational binary decision diagrams Proceedings of the 7th international conference on Logic for programming and automated reasoning, (161-178)
- Meinel C and Stangier C Increasing efficiency of symbolic model checking by accelerating dynamic variable reordering Proceedings of the conference on Design, automation and test in Europe, (16-es)
- Nassar A and Kurdahi F Lattice-based Boolean diagrams 2016 21st Asia and South Pacific Design Automation Conference (ASP-DAC), (468-473)
Recommendations
Data structures and algorithms for simplifying reversible circuits
Reversible logic is motivated by low-power design, quantum circuits, and nanotechnology. We develop a compact representation of small reversible circuits to generate and store optimal circuits for all 40,320 three-input reversible functions, and ...
A VLSI Modulo m Multiplier
A novel method to compute the exact digits of the modulo m product of integers is proposed, and a modulo m multiply structure is defined. Such a structure can be implemented by means of a few fast VLSI binary multipliers, and a response time of about ...