Binary Decision Diagram Mapping is a formal method that transforms Boolean functions into equivalent, compact representations using directed acyclic graphs structured as binary decision diagrams, enabling efficient manipulation and analysis of logic functions in digital design and verification.
45
Publications
1.8K
Citations
118
Authors
50
Institutions
Publications per year
2017–2026
7
Parents
Publications
45
Algorithms for discrete function manipulation
A. Srinivasan, T. Ham, Sharad Malik et al. · 2002 · 269 citations
Symbolic pointer analysis revisited
Jianwen Zhu, Silvian Calman · 2004 · 101 citations
1–5 of 45
Authors
118
- RD
7
h-index
- RW
3
h-index
- KD
3
h-index
- IS
3
h-index
- GF
3
h-index
1–5 of 118
Institutions
50
University of Bremen
Bremen, Germany
6 h-index
19 publications
493 citations
German Research Centre for Artificial Intelligence
Kaiserslautern, Germany
4 h-index
8 publications
177 citations
Indian Institute of Technology Kharagpur
Kharagpur, India
4 h-index
5 publications
171 citations
National Institute of Technology Meghalaya
Shillong, India
3 h-index
3 publications
94 citations
Portland State University
Portland, United States
3 h-index
7 publications
123 citations
Indian Institute of Engineering Science and Technology, Shibpur
Howrah, India
2 h-index
2 publications
75 citations
TU Dortmund University
Dortmund, Germany
2 h-index
2 publications
139 citations
National Tsing Hua University
Hsinchu, Taiwan
2 h-index
3 publications
144 citations
1–8 of 50
Venues
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
6 publications · 409 citations
6
h-index
- Integration
2 publications · 29 citations
2
h-index
- IEEE Transactions on Very Large Scale Integration (VLSI) Systems
2 publications · 62 citations
2
h-index
- Reliability Engineering & System Safety
2 publications · 74 citations
2
h-index
- International Journal of Approximate Reasoning
1 publications · 25 citations
1
h-index
1–5