• Minato S, Kawahara J, Banbara M, Horiyama T, Takigawa I and Yamaguchi Y. (2025). Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs. Discrete Applied Mathematics. 10.1016/j.dam.2024.10.003. 360. (467-486). Online publication date: 1-Jan-2025.

    https://linkinghub.elsevier.com/retrieve/pii/S0166218X2400427X

  • Shindo H, Pfanschilling V, Dhami D and Kersting K. (2024). Learning differentiable logic programs for abstract visual reasoning. Machine Learning. 10.1007/s10994-024-06610-2.

    https://link.springer.com/10.1007/s10994-024-06610-2

  • Sundermann C, Kuiter E, Heß T, Raab H, Krieter S and Thüm T. (2023). On the benefits of knowledge compilation for feature-model analyses. Annals of Mathematics and Artificial Intelligence. 10.1007/s10472-023-09906-6. 92:5. (1013-1050). Online publication date: 1-Oct-2024.

    https://link.springer.com/10.1007/s10472-023-09906-6

  • NAGAYAMA S, SASAO T and BUTLER J. (2024). Functional Decomposition of Symmetric Multiple-Valued Functions and Their Compact Representation in Decision Diagrams. IEICE Transactions on Information and Systems. 10.1587/transinf.2023LOP0010. E107.D:8. (922-929). Online publication date: 1-Aug-2024.

    https://www.jstage.jst.go.jp/article/transinf/E107.D/8/E107.D_2023LOP0010/_article

  • Sander A, Florea I, Burgholzer L and Wille R. (2024). Stripping Quantum Decision Diagrams of their Identity 2024 IEEE International Conference on Quantum Software (QSW). 10.1109/QSW62656.2024.00032. 979-8-3503-6847-5. (168-174).

    https://ieeexplore.ieee.org/document/10646550/

  • Husung N, Dubslaff C, Hermanns H and Köhl M. OxiDD. Tools and Algorithms for the Construction and Analysis of Systems. (255-275).

    https://doi.org/10.1007/978-3-031-57256-2_13

  • Maekawa Y, Minakawa T and Adachi S. (2024). Enumeration-based Crew Rescheduling Support System for Railway Disruption Management列挙アルゴリズムを用いた適応型乗務員運用整理支援システムの開発とその評価. IEEJ Transactions on Electronics, Information and Systems. 10.1541/ieejeiss.144.103. 144:2. (103-109). Online publication date: 1-Feb-2024.

    https://www.jstage.jst.go.jp/article/ieejeiss/144/2/144_103/_article/-char/ja/

  • Zhong D, Fang L and Guan Q. (2024). Dictionary Encoding Based on Tagged Sentential Decision Diagrams. Algorithms. 10.3390/a17010042. 17:1. (42).

    https://www.mdpi.com/1999-4893/17/1/42

  • Lim B, Tan R, Kawahara J, Minato S and Ikeda K. A Recursive Framework for Evaluating Moments Using Zero-Suppressed Binary Decision Diagrams. IEEE Access. 10.1109/ACCESS.2024.3421676. 12. (91886-91895).

    https://ieeexplore.ieee.org/document/10579738/

  • Minato S. (2024). Recent Research Activities on Algorithmic Foundations for Social Advancement. WALCOM: Algorithms and Computation. 10.1007/978-981-97-0566-5_1. (1-8).

    https://link.springer.com/10.1007/978-981-97-0566-5_1

  • Bjørner N and Nachmanson L. (2024). Arithmetic Solving in Z3. Computer Aided Verification. 10.1007/978-3-031-65627-9_2. (26-41).

    https://link.springer.com/10.1007/978-3-031-65627-9_2

  • van Dijk T, van Abbema F and Tomov N. (2024). Knor: reactive synthesis using Oink. Tools and Algorithms for the Construction and Analysis of Systems. 10.1007/978-3-031-57246-3_7. (103-122).

    https://link.springer.com/10.1007/978-3-031-57246-3_7

  • Ishihata M. (2024). The Bag-Based Search: A Meta-Algorithm to Construct Tractable Logical Circuits for Graphs Based on Tree Decomposition. Combinatorial Optimization and Applications. 10.1007/978-3-031-49614-1_25. (337-350).

    https://link.springer.com/10.1007/978-3-031-49614-1_25

  • Kurokawa Y, Mitsuboshi R, Hamasaki H, Hatano K, Takimoto E and Rahmanian H. (2024). Extended Formulations via Decision Diagrams. Computing and Combinatorics. 10.1007/978-3-031-49193-1_2. (17-28).

    https://link.springer.com/10.1007/978-3-031-49193-1_2

  • Li X, Imagawa T and Ochi H. (2023). Finding All Solutions of Multi-terminal Numberlink Problem Utilizing Top-down ZDD Construction 2023 IEEE 15th International Conference on ASIC (ASICON). 10.1109/ASICON58565.2023.10396442. 979-8-3503-1298-0. (1-4).

    https://ieeexplore.ieee.org/document/10396442/

  • Sander A, Burgholzer L and Wille R. (2023). Towards Hamiltonian Simulation with Decision Diagrams 2023 IEEE International Conference on Quantum Computing and Engineering (QCE). 10.1109/QCE57702.2023.00039. 979-8-3503-4323-6. (283-294).

    https://ieeexplore.ieee.org/document/10313740/

  • Serru T, Nguyen N, Batteux M and Rauzy A. (2023). Minimal Critical Sequences in Model-based Safety and Security Analyses: Commonalities and Differences. ACM Transactions on Cyber-Physical Systems. 7:3. (1-20). Online publication date: 31-Jul-2023.

    https://doi.org/10.1145/3593811

  • Miedema D and Gattinger M. (2023). Exploiting Asymmetry in Logic Puzzles: Using ZDDs for Symbolic Model Checking Dynamic Epistemic Logic. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.379.32. 379. (407-420).

    http://arxiv.org/abs/2307.05067v1

  • Horn M, Demirović E and Yorke-Smith N. Parallel batch processing for the coating problem. Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling. (171-179).

    https://doi.org/10.1609/icaps.v33i1.27192

  • Kondratiev V, Otpuschennikov I and Semenov A. (2023). Speeding up the Solving of Logical Equivalence Checking Problems with Disjunctive Diagrams 2023 46th MIPRO ICT and Electronics Convention (MIPRO). 10.23919/MIPRO57284.2023.10159845. 978-953-233-104-2. (1021-1026).

    https://ieeexplore.ieee.org/document/10159845/

  • Nagayama S, Sasao T and Butler J. (2023). Decomposition-Based Representation of Symmetric Multiple-Valued Functions 2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL). 10.1109/ISMVL57333.2023.00025. 978-1-6654-6416-1. (76-81).

    https://ieeexplore.ieee.org/document/10153843/

  • Gehringer D, Friák M and Holec D. (2023). Models of configurationally-complex alloys made simple. Computer Physics Communications. 10.1016/j.cpc.2023.108664. 286. (108664). Online publication date: 1-May-2023.

    https://linkinghub.elsevier.com/retrieve/pii/S0010465523000097

  • Fuchimoto K, Minato S and Ueno M. Automated Parallel Test Forms Assembly using Zero-suppressed Binary Decision Diagrams. IEEE Access. 10.1109/ACCESS.2023.3322720. 11. (112804-112813).

    https://ieeexplore.ieee.org/document/10273990/

  • Sølvsten S and van de Pol J. (2023). Predicting Memory Demands of BDD Operations Using Maximum Graph Cuts. Automated Technology for Verification and Analysis. 10.1007/978-3-031-45332-8_4. (72-92).

    https://link.springer.com/10.1007/978-3-031-45332-8_4

  • Zulehner A and Wille R. (2023). Entwurfsautomatisierungsmethoden für konventionelle Systeme. Einführung in die Entwurfsautomatisierung für Quantencomputer. 10.1007/978-3-031-36751-9_3. (23-28).

    https://link.springer.com/10.1007/978-3-031-36751-9_3

  • Ito T, Kawahara J, Nakahata Y, Soh T, Suzuki A, Teruyama J and Toda T. (2023). ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. Integration of Constraint Programming, Artificial Intelligence, and Operations Research. 10.1007/978-3-031-33271-5_12. (167-183).

    https://link.springer.com/10.1007/978-3-031-33271-5_12

  • Vinkhuijzen L, Grurl T, Hillmich S, Brand S, Wille R and Laarman A. (2023). Efficient Implementation of LIMDDs for Quantum Circuit Simulation. Model Checking Software. 10.1007/978-3-031-32157-3_1. (3-21).

    https://link.springer.com/10.1007/978-3-031-32157-3_1

  • Wille R, Hillmich S and Burgholzer L. (2023). Decision Diagrams for Quantum Computing. Design Automation of Quantum Computers. 10.1007/978-3-031-15699-1_1. (1-23).

    https://link.springer.com/10.1007/978-3-031-15699-1_1

  • Fawzi H, Gouveia J, Parrilo P, Saunderson J and Thomas R. (2022). Lifting for Simplicity: Concise Descriptions of Convex Sets. SIAM Review. 10.1137/20M1324417. 64:4. (866-918). Online publication date: 1-Nov-2022.

    https://epubs.siam.org/doi/10.1137/20M1324417

  • Mayuzumi F, Hayakawa K and Hato E. A Dynamic Scheduling Algorithm based on Marginal Contribution in Mixed Passenger-and-Freight Delivery Networks. 2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC). (3556-3563).

    https://doi.org/10.1109/ITSC55140.2022.9922410

  • Kumar A and Wagatsuma H. (2022). A Kamm’s Circle-Based Potential Risk Estimation Scheme in the Local Dynamic Map Computation Enhanced by Binary Decision Diagrams. Sensors. 10.3390/s22197253. 22:19. (7253).

    https://www.mdpi.com/1424-8220/22/19/7253

  • Fuchimoto K, Minato S and Ueno M. (2022). Automated Test Assmbly using Zero-suppressed Binary Decision DiagramsZero-suppressed Binary Decision Diagramsを用いた自動テスト構成. Transactions of the Japanese Society for Artificial Intelligence. 10.1527/tjsai.37-5_A-M23. 37:5. (A-M23_1-11). Online publication date: 1-Sep-2022.

    https://www.jstage.jst.go.jp/article/tjsai/37/5/37_37-5_A-M23/_article/-char/ja/

  • Vinkhuijzen L and Laarman A. The Power of Disjoint Support Decompositions in Decision Diagrams. NASA Formal Methods. (790-799).

    https://doi.org/10.1007/978-3-031-06773-0_42

  • Kondratiev V. (2022). Using Disjunctive Diagrams for Preprocessing of Conjunctive Normal Forms 2022 45th Jubilee International Convention on Information, Communication and Electronic Technology (MIPRO). 10.23919/MIPRO55190.2022.9803639. 978-953-233-103-5. (883-887).

    https://ieeexplore.ieee.org/document/9803639/

  • Katoh T and Goto K. (2022). In-place initializable arrays. Theoretical Computer Science. 916:C. (62-69). Online publication date: 19-May-2022.

    https://doi.org/10.1016/j.tcs.2022.03.004

  • Nagayama S, Sasao T and Butler J. (2022). On Decision Diagrams for Maximally Asymmetric Functions 2022 IEEE 52nd International Symposium on Multiple-Valued Logic (ISMVL). 10.1109/ISMVL52857.2022.00032. 978-1-6654-2395-3. (164-169).

    https://ieeexplore.ieee.org/document/9797453/

  • Sato R. Enumerating Fair Packages for Group Recommendations. Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining. (870-878).

    https://doi.org/10.1145/3488560.3498432

  • Beidas R and Anderson J. (2022). CGRA Mapping Using Zero-Suppressed Binary Decision Diagrams 2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC). 10.1109/ASP-DAC52403.2022.9712571. 978-1-6654-2135-5. (616-622).

    https://ieeexplore.ieee.org/document/9712571/

  • Lin Y, Tabajara L and Vardi M. (2022). ZDD Boolean Synthesis. Tools and Algorithms for the Construction and Analysis of Systems. 10.1007/978-3-030-99524-9_4. (64-83).

    https://link.springer.com/10.1007/978-3-030-99524-9_4

  • Kusper G, Biró C and Nagy B. (2021). Resolvable Networks—A Graphical Tool for Representing and Solving SAT. Mathematics. 10.3390/math9202597. 9:20. (2597).

    https://www.mdpi.com/2227-7390/9/20/2597

  • Heß T, Sundermann C and Thüm T. On the scalability of building binary decision diagrams for current feature models. Proceedings of the 25th ACM International Systems and Software Product Line Conference - Volume A. (131-135).

    https://doi.org/10.1145/3461001.3474452

  • ITO A, UENO R and HOMMA N. (2021). An Algebraic Approach to Verifying Galois-Field Arithmetic Circuits with Multiple-Valued Characteristics. IEICE Transactions on Information and Systems. 10.1587/transinf.2020LOP0004. E104.D:8. (1083-1091). Online publication date: 1-Aug-2021.

    https://www.jstage.jst.go.jp/article/transinf/E104.D/8/E104.D_2020LOP0004/_article

  • Brandner F and Noûs C. (2021). Precise, efficient, and context-sensitive cache analysis. Real-Time Systems. 10.1007/s11241-021-09372-5.

    https://link.springer.com/10.1007/s11241-021-09372-5

  • Hirano Y, He F, Sato T and Oki E. Preventive Start-Time Optimization to Determine Link Weights Against Probabilistic Link Failures. IEEE Transactions on Network and Service Management. 10.1109/TNSM.2020.3045145. 18:2. (2275-2293).

    https://ieeexplore.ieee.org/document/9296257/

  • Matsuda K, Denzumi S and Sadakane K. (2021). Storing Set Families More Compactly with Top ZDDs. Algorithms. 10.3390/a14060172. 14:6. (172).

    https://www.mdpi.com/1999-4893/14/6/172

  • Ito A, Ueno R and Homma N. (2021). A Formal Approach to Identifying Hardware Trojans in Cryptographic Hardware 2021 IEEE 51st International Symposium on Multiple-Valued Logic (ISMVL). 10.1109/ISMVL51352.2021.00034. 978-1-7281-9224-6. (154-159).

    https://ieeexplore.ieee.org/document/9459655/

  • Nagayama S, Sasao T and Butler J. (2021). Improvement in the Quality of Solutions of a Heuristic Linear Decomposer for Index Generation Functions 2021 IEEE 51st International Symposium on Multiple-Valued Logic (ISMVL). 10.1109/ISMVL51352.2021.00012. 978-1-7281-9224-6. (13-18).

    https://ieeexplore.ieee.org/document/9459659/

  • Borboudakis G and Tsamardinos I. (2021). Extending greedy feature selection algorithms to multiple solutions. Data Mining and Knowledge Discovery. 10.1007/s10618-020-00731-7.

    https://link.springer.com/10.1007/s10618-020-00731-7

  • Wille R, Burgholzer L and Artner M. (2021). Visualizing Decision Diagrams for Quantum Computing (Special Session Summary) 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE). 10.23919/DATE51398.2021.9474236. 978-3-9819263-5-4. (768-773).

    https://ieeexplore.ieee.org/document/9474236/

  • Abolhassani A and Prates M. An up-to-date review of scan statistics. Statistics Surveys. 10.1214/21-SS132. 15:none.

    https://projecteuclid.org/journals/statistics-surveys/volume-15/issue-none/An-up-to-date-review-of-scan-statistics/10.1214/21-SS132.full

  • Tan R, Sikora F, Ikeda K and See K. (2021). Arc Routing Based on the Zero-Suppressed Binary Decision Diagram. Transactions on Engineering Technologies. 10.1007/978-981-15-8273-8_9. (105-120).

    http://link.springer.com/10.1007/978-981-15-8273-8_9

  • Kubica M, Opara A and Kania D. (2021). Binary Decision Diagrams. Technology Mapping for LUT-Based FPGA. 10.1007/978-3-030-60488-2_3. (25-37).

    http://link.springer.com/10.1007/978-3-030-60488-2_3

  • Kusper G and Biró C. (2020). Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT Problem by the Balatonboglár Model. Algorithms. 10.3390/a13120321. 13:12. (321).

    https://www.mdpi.com/1999-4893/13/12/321

  • Nagayama S, Sasao T and Butler J. (2020). On Optimum Linear Decomposition of Symmetric Index Generation Functions 2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL). 10.1109/ISMVL49045.2020.00-17. 978-1-7281-5406-0. (130-136).

    https://ieeexplore.ieee.org/document/9308117/

  • Fukuyama S. (2020). Dynamic game-based approach for optimizing merging vehicle trajectories using time-expanded decision diagram. Transportation Research Part C: Emerging Technologies. 10.1016/j.trc.2020.102766. 120. (102766). Online publication date: 1-Nov-2020.

    https://linkinghub.elsevier.com/retrieve/pii/S0968090X2030677X

  • Kondratiev V, Otpuschennikov I and Semenov A. (2020). Using Decision Diagrams of Special Kind for Compactification of Conflict Data Bases Generated by CDCL SAT Solvers 2020 43rd International Convention on Information, Communication and Electronic Technology (MIPRO). 10.23919/MIPRO48935.2020.9245180. 978-953-233-099-1. (1046-1051).

    https://ieeexplore.ieee.org/document/9245180/

  • Maekawa Y, Minakawa T and Tomiyama T. (2020). An Enumeration-Based Approach for Flexible Railway Crew Rescheduling in Disruption Management 2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC). 10.1109/ITSC45102.2020.9294205. 978-1-7281-4149-7. (1-6).

    https://ieeexplore.ieee.org/document/9294205/

  • Kusper G, Balla T, Biro C, Tajti T, Yang Z and Bajak I. (2020). Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs 2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). 10.1109/SYNASC51798.2020.00024. 978-1-7281-7628-4. (84-92).

    https://ieeexplore.ieee.org/document/9357107/

  • Viktoros S, Michael M and Polycarpou M. (2020). Compact Fault Dictionaries for Efficient Sensor Fault Diagnosis in IoT-enabled CPSs 2020 IEEE International Conference on Smart Internet of Things (SmartIoT). 10.1109/SmartIoT49966.2020.00042. 978-1-7281-6514-1. (236-243).

    https://ieeexplore.ieee.org/document/9192014/

  • Bryant R. (2020). Chain Reduction for Binary and Zero-Suppressed Decision Diagrams. Journal of Automated Reasoning. 10.1007/s10817-020-09569-6.

    http://link.springer.com/10.1007/s10817-020-09569-6

  • Brandner F and Noûs C. Precise and Efficient Analysis of Context-Sensitive Cache Conflict Sets. Proceedings of the 28th International Conference on Real-Time Networks and Systems. (44-55).

    https://doi.org/10.1145/3394810.3394811

  • Smith K, Soeken M, Schmitt B, De Micheli G and Thornton M. (2020). Using ZDDs in the Mapping of Quantum Circuits. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.318.7. 318. (106-118).

    http://arxiv.org/abs/1901.02406v3

  • Kusper G, Biro C and Balla T. (2020). Investigation of the Efficiency of Conversion of Directed Graphs to 3-SAT Problems 2020 IEEE 14th International Symposium on Applied Computational Intelligence and Informatics (SACI). 10.1109/SACI49304.2020.9118786. 978-1-7281-7377-1. (000227-000234).

    https://ieeexplore.ieee.org/document/9118786/

  • Israr A, Kaleem M, Nazir S, Mirza H and Huss S. (2020). Nested genetic algorithm for highly reliable and efficient embedded system design. Design Automation for Embedded Systems. 10.1007/s10617-020-09234-6.

    http://link.springer.com/10.1007/s10617-020-09234-6

  • HARADA T, TANAKA K and MIKAWA K. (2020). Simulated Annealing Method for Relaxed Optimal Rule Ordering. IEICE Transactions on Information and Systems. 10.1587/transinf.2019FCP0006. E103.D:3. (509-515). Online publication date: 1-Mar-2020.

    https://www.jstage.jst.go.jp/article/transinf/E103.D/3/E103.D_2019FCP0006/_article

  • Niemann P, Zulehner A, Drechsler R and Wille R. Overcoming the Trade-off between Accuracy and Compactness in Decision Diagrams for Quantum Computation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 10.1109/TCAD.2020.2977603. (1-1).

    https://ieeexplore.ieee.org/document/9023381/

  • Zhang Y, Li J, Kimura S, Zhao W and Das S. Atomic Predicates Based Data Plane Properties Verification in Software Defined Networking Using Spark. IEEE Journal on Selected Areas in Communications. 10.1109/JSAC.2020.2986956. (1-1).

    https://ieeexplore.ieee.org/document/9086447/

  • Mo Y, Liao J, Xing L and Liu X. Efficient Mincuts Identification for Phased-Mission Systems. IEEE Access. 10.1109/ACCESS.2020.3045283. 8. (223652-223660).

    https://ieeexplore.ieee.org/document/9296288/

  • Fifield B, Imai K, Kawahara J and Kenny C. (2020). The Essential Role of Empirical Validation in Legislative Redistricting Simulation. Statistics and Public Policy. 10.1080/2330443X.2020.1791773. 7:1. (52-68). Online publication date: 1-Jan-2020.

    https://www.tandfonline.com/doi/full/10.1080/2330443X.2020.1791773

  • Bjørner N and Nachmanson L. (2020). Navigating the Universe of Z3 Theory Solvers. Formal Methods: Foundations and Applications. 10.1007/978-3-030-63882-5_2. (8-24).

    http://link.springer.com/10.1007/978-3-030-63882-5_2

  • Vinkhuijzen L and Laarman A. (2020). Symbolic Model Checking with Sentential Decision Diagrams. Dependable Software Engineering. Theories, Tools, and Applications. 10.1007/978-3-030-62822-2_8. (124-142).

    http://link.springer.com/10.1007/978-3-030-62822-2_8

  • Havelund K and Peled D. (2020). BDDs for Representing Data in Runtime Verification. Runtime Verification. 10.1007/978-3-030-60508-7_6. (107-128).

    http://link.springer.com/10.1007/978-3-030-60508-7_6

  • Schwieger R, Bender M, Siebert H and Haase C. (2020). Classifier Construction in Boolean Networks Using Algebraic Methods. Computational Methods in Systems Biology. 10.1007/978-3-030-60327-4_12. (210-233).

    http://link.springer.com/10.1007/978-3-030-60327-4_12

  • Akasaka M and Miwa H. (2020). Efficient Method for Link Protection Under Multiple Constraints Using ZDD. Web, Artificial Intelligence and Network Applications. 10.1007/978-3-030-44038-1_24. (255-264).

    https://link.springer.com/10.1007/978-3-030-44038-1_24

  • Suzuki H, Ishihata M and Minato S. (2020). Designing Survivable Networks with Zero-Suppressed Binary Decision Diagrams. WALCOM: Algorithms and Computation. 10.1007/978-3-030-39881-1_23. (273-285).

    http://link.springer.com/10.1007/978-3-030-39881-1_23

  • Nakahata Y, Kawahara J, Horiyama T and Minato S. (2020). Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration. WALCOM: Algorithms and Computation. 10.1007/978-3-030-39881-1_18. (211-222).

    http://link.springer.com/10.1007/978-3-030-39881-1_18

  • Chatterjee S, Ramana V and Vishwakarma G. (2019). Analysis of two-terminal network reliability based on efficient data structure. International Journal of System Assurance Engineering and Management. 10.1007/s13198-019-00921-7.

    http://link.springer.com/10.1007/s13198-019-00921-7

  • Rauzy A and Yang L. (2019). Decision Diagram Algorithms to Extract Minimal Cutsets of Finite Degradation Models. Information. 10.3390/info10120368. 10:12. (368).

    https://www.mdpi.com/2078-2489/10/12/368

  • Amii K, Nishino M and Yamamoto A. (2019). On Representing the Set of All Parse Trees with a Decision Diagram. Transactions of the Japanese Society for Artificial Intelligence. 10.1527/tjsai.A-I34. 34:6. (A-I34_1-12). Online publication date: 1-Nov-2019.

    https://www.jstage.jst.go.jp/article/tjsai/34/6/34_A-I34/_article

  • Fang L, Fang B, Wan H, Zheng Z, Chang L and Yu Q. (2019). Tagged Sentential Decision Diagrams: Combining Standard and Zero-suppressed Compression and Trimming Rules 2019 IEEE/ACM International Conference on Computer-Aided Design (ICCAD). 10.1109/ICCAD45719.2019.8942114. 978-1-7281-2350-9. (1-8).

    https://ieeexplore.ieee.org/document/8942114/

  • Huang Z, Sun Y and Lin D. (2019). On the efficiency of solving boolean polynomial systems with the characteristic set method. Journal of Symbolic Computation. 10.1016/j.jsc.2019.11.001. Online publication date: 1-Nov-2019.

    https://linkinghub.elsevier.com/retrieve/pii/S0747717119301373

  • OLIVEIRA F, HIRAISHI H and IMAI H. (2019). Revisiting the Top-Down Computation of BDD of Spanning Trees of a Graph and Its Tutte Polynomial. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 10.1587/transfun.E102.A.1022. E102.A:9. (1022-1027). Online publication date: 1-Sep-2019.

    https://www.jstage.jst.go.jp/article/transfun/E102.A/9/E102.A_1022/_article

  • Inoue T. Reliability Analysis for Disjoint Paths. IEEE Transactions on Reliability. 10.1109/TR.2018.2877775. 68:3. (985-998).

    https://ieeexplore.ieee.org/document/8534344/

  • Sharma S, Roy S, Soos M and Meel K. GANAK. Proceedings of the 28th International Joint Conference on Artificial Intelligence. (1169-1176).

    /doi/10.5555/3367032.3367198

  • MIYAMOTO T. (2019). Reachability Analysis of Petri Netsペトリネットの可達解析. IEICE ESS Fundamentals Review. 10.1587/essfr.13.1_20. 13:1. (20-27). Online publication date: 1-Jul-2019.

    https://www.jstage.jst.go.jp/article/essfr/13/1/13_20/_article/-char/ja/

  • Takeda K, Sawada K, Yokogawa S and Shin S. (2019). Overlapped Grouping Optimization for Wind-Photovoltaic-Battery Hybrid System by Graph Enumerationグラフ列挙による風力・太陽光・蓄電池複合システムの重複グルーピング最適化. IEEJ Transactions on Electronics, Information and Systems. 10.1541/ieejeiss.139.786. 139:7. (786-795). Online publication date: 1-Jul-2019.

    https://www.jstage.jst.go.jp/article/ieejeiss/139/7/139_786/_article/-char/ja/

  • Stojković S, Stanković R, Moraga C and Stanković M. (2019). Reversible Circuits Synthesis from Functional Decision Diagrams by using Node Dependency Matrices. Journal of Circuits, Systems and Computers. 10.1142/S0218126620500796. (2050079).

    https://www.worldscientific.com/doi/abs/10.1142/S0218126620500796

  • Yang L and Rauzy A. (2019). Model synthesis using boolean expression diagrams. Reliability Engineering & System Safety. 10.1016/j.ress.2019.02.019. 186. (78-87). Online publication date: 1-Jun-2019.

    https://linkinghub.elsevier.com/retrieve/pii/S0951832018310135

  • Ishioka F, Kawahara J, Mizuta M, Minato S and Kurihara K. (2019). Evaluation of hotspot cluster detection using spatial scan statistic based on exact counting. Japanese Journal of Statistics and Data Science. 10.1007/s42081-018-0030-6. 2:1. (241-262). Online publication date: 1-Jun-2019.

    http://link.springer.com/10.1007/s42081-018-0030-6

  • Nagayama S, Sasao T and Butler J. (2019). A Dynamic Programming Based Method for Optimum Linear Decomposition of Index Generation Functions 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL). 10.1109/ISMVL.2019.00033. 978-1-7281-0092-0. (144-149).

    https://ieeexplore.ieee.org/document/8758778/

  • Yadohisa H and Sakamoto W. (2019). Special feature: computational statistics and machine learning. Japanese Journal of Statistics and Data Science. 10.1007/s42081-019-00042-2.

    http://link.springer.com/10.1007/s42081-019-00042-2

  • Tjandraatmadja C and van Hoeve W. (2019). Target Cuts from Relaxed Decision Diagrams. INFORMS Journal on Computing. 31:2. (285-301). Online publication date: 1-Apr-2019.

    https://doi.org/10.1287/ijoc.2018.0830

  • Gupta U, Kalla P and Rao V. Boolean Gröbner Basis Reductions on Finite Field Datapath Circuits Using the Unate Cube Set Algebra. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 10.1109/TCAD.2018.2818726. 38:3. (576-588).

    https://ieeexplore.ieee.org/document/8323221/

  • Takenobu Y, Yasuda N, Minato S and Hayashi Y. (2019). Scalable enumeration approach for maximizing hosting capacity of distributed generation. International Journal of Electrical Power & Energy Systems. 10.1016/j.ijepes.2018.09.010. 105. (867-876). Online publication date: 1-Feb-2019.

    https://linkinghub.elsevier.com/retrieve/pii/S0142061518309347

  • Newton J and Verna D. (2019). A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams. ACM Transactions on Computational Logic. 20:1. (1-36). Online publication date: 31-Jan-2019.

    https://doi.org/10.1145/3274279

  • Maehara T and Inoue Y. Group decision diagram (GDD). Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence. (2986-2994).

    https://doi.org/10.1609/aaai.v33i01.33012986

  • NAGATANI Y, SAWADA K and SHIN S. (2019). Self-Triggered Optimal Control Based on Path Search Algorithm. SICE Journal of Control, Measurement, and System Integration. 10.9746/jcmsi.12.85. 12:3. (85-93).

    https://www.jstage.jst.go.jp/article/jcmsi/12/3/12_85/_article

  • Kawahara J, Saitoh T, Suzuki H and Yoshinaka R. (2019). Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs. Analysis of Experimental Algorithms. 10.1007/978-3-030-34029-2_9. (125-141).

    http://link.springer.com/10.1007/978-3-030-34029-2_9

  • Matsuda K, Denzumi S, Nakamura K, Nishino M and Yasuda N. (2019). Approximated ZDD Construction Considering Inclusion Relations of Models. Analysis of Experimental Algorithms. 10.1007/978-3-030-34029-2_18. (265-282).

    http://link.springer.com/10.1007/978-3-030-34029-2_18

  • Yang L and Rauzy A. (2019). FDS-ML: A New Modeling Formalism for Probabilistic Risk and Safety Analyses. Model-Based Safety and Assessment. 10.1007/978-3-030-32872-6_6. (78-92).

    http://link.springer.com/10.1007/978-3-030-32872-6_6

  • Miyake F, Takimoto E and Hatano K. (2019). Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling Under Precedence Constraints. Combinatorial Algorithms. 10.1007/978-3-030-25005-8_30. (365-377).

    https://link.springer.com/10.1007/978-3-030-25005-8_30

  • Denzumi S. (2019). New Algorithms for Manipulating Sequence BDDs. Implementation and Application of Automata. 10.1007/978-3-030-23679-3_9. (108-120).

    http://link.springer.com/10.1007/978-3-030-23679-3_9

  • Neophytou S and Michael M. (2018). Path Representation in Circuit Netlists Using Linear-Sized ZDDs with Optimal Variable Ordering. Journal of Electronic Testing: Theory and Applications. 34:6. (667-683). Online publication date: 1-Dec-2018.

    https://doi.org/10.1007/s10836-018-5761-6

  • Song G, Kowalczyk D and Leus R. (2018). The robust machine availability problem – bin packing under uncertainty. IISE Transactions. 10.1080/24725854.2018.1468122. 50:11. (997-1012). Online publication date: 2-Nov-2018.

    https://www.tandfonline.com/doi/full/10.1080/24725854.2018.1468122

  • Kowalczyk D and Leus R. (2018). A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching. INFORMS Journal on Computing. 10.1287/ijoc.2018.0809. 30:4. (768-782). Online publication date: 1-Nov-2018.

    http://pubsonline.informs.org/doi/10.1287/ijoc.2018.0809

  • Hatano K. (2018). Combinatorial Online Prediction 2018 International Symposium on Information Theory and Its Applications (ISITA). 10.23919/ISITA.2018.8664224. 978-4-88552-318-2. (40-44).

    https://ieeexplore.ieee.org/document/8664224/

  • Rao V, Gupta U, Ilioaea I, Srinath A, Kalla P and Enescu F. (2018). Post-Verification Debugging and Rectification of Finite Field Arithmetic Circuits using Computer Algebra Techniques 2018 Formal Methods in Computer Aided Design (FMCAD). 10.23919/FMCAD.2018.8603018. 978-0-9835678-8-2. (1-9).

    https://ieeexplore.ieee.org/document/8603018/

  • Lasota S. (2018). Symbolic analysis of electric networks with higher order summative cofactors and parameter decision diagrams. International Journal of Circuit Theory and Applications. 10.1002/cta.2495. 46:10. (1796-1826). Online publication date: 1-Oct-2018.

    https://onlinelibrary.wiley.com/doi/10.1002/cta.2495

  • SUZUKI H and MINATO S. (2018). Fast Enumeration of All Pareto-Optimal Solutions for 0-1 Multi-Objective Knapsack Problems Using ZDDs. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 10.1587/transfun.E101.A.1375. E101.A:9. (1375-1382). Online publication date: 1-Sep-2018.

    https://www.jstage.jst.go.jp/article/transfun/E101.A/9/E101.A_1375/_article

  • NAKAHATA Y, KAWAHARA J, HORIYAMA T and KASAHARA S. (2018). Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 10.1587/transfun.E101.A.1363. E101.A:9. (1363-1374). Online publication date: 1-Sep-2018.

    https://www.jstage.jst.go.jp/article/transfun/E101.A/9/E101.A_1363/_article

  • Sugaya T, Nishino M, Yasuda N and Minato S. (2018). Fast compilation of graph substructures for counting and enumeration. Behaviormetrika. 10.1007/s41237-018-0056-x.

    http://link.springer.com/10.1007/s41237-018-0056-x

  • Mishchenko A, Brayton R, Petkovska A, Soeken M, Amarú L and Domic A. Canonical computation without canonical representation. Proceedings of the 55th Annual Design Automation Conference. (1-6).

    https://doi.org/10.1145/3195970.3196006

  • Takenobu Y, Yasuda N, Kawano S, Minato S and Hayashi Y. Evaluation of Annual Energy Loss Reduction Based on Reconfiguration Scheduling. IEEE Transactions on Smart Grid. 10.1109/TSG.2016.2604922. 9:3. (1986-1996).

    https://ieeexplore.ieee.org/document/7559803/

  • Nagayama S, Sasao T and Butler J. (2018). An Exact Optimization Method Using ZDDs for Linear Decomposition of Index Generation Functions 2018 IEEE 48th International Symposium on Multiple-Valued Logic (ISMVL). 10.1109/ISMVL.2018.00033. 978-1-5386-4464-5. (144-149).

    https://ieeexplore.ieee.org/document/8416936/

  • Tsubaki T, Ishizuka M and Yasukawa S. (2018). A new algorithm of route design against large-scale disasters NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium. 10.1109/NOMS.2018.8406209. 978-1-5386-3416-5. (1-5).

    https://ieeexplore.ieee.org/document/8406209/

  • Rauzy A. (2018). Notes on Computational Uncertainties in Probabilistic Risk/Safety Assessment. Entropy. 10.3390/e20030162. 20:3. (162).

    https://www.mdpi.com/1099-4300/20/3/162

  • Fang L, Wan H, Liu X, Fang B and Lai Z. Dependence in propositional logic. Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence. (1835-1844).

    /doi/10.5555/3504035.3504259

  • Sakaue S, Nishino M and Yasuda N. Submodular function maximization over graphs via zero-suppressed binary decision diagrams. Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence. (1422-1430).

    /doi/10.5555/3504035.3504209

  • Bandyopadhyay C, Das R, Wille R, Drechsler R and Rahaman H. (2018). Synthesis of circuits based on all-optical Mach-Zehnder Interferometers using Binary Decision Diagrams. Microelectronics Journal. 71:C. (19-29). Online publication date: 1-Jan-2018.

    https://doi.org/10.1016/j.mejo.2017.11.008

  • Morizumi H. (2018). Zero-Suppression and Computation Models. Combinatorial Algorithms. 10.1007/978-3-319-94667-2_22. (263-272).

    http://link.springer.com/10.1007/978-3-319-94667-2_22

  • Bryant R. (2018). Chain Reduction for Binary and Zero-Suppressed Decision Diagrams. Tools and Algorithms for the Construction and Analysis of Systems. 10.1007/978-3-319-89960-2_5. (81-98).

    http://link.springer.com/10.1007/978-3-319-89960-2_5

  • Fujita T, Hatano K and Takimoto E. (2018). Boosting over Non-deterministic ZDDs. WALCOM: Algorithms and Computation. 10.1007/978-3-319-75172-6_17. (195-206).

    https://link.springer.com/10.1007/978-3-319-75172-6_17

  • Bryant R. (2018). Binary Decision Diagrams. Handbook of Model Checking. 10.1007/978-3-319-10575-8_7. (191-217).

    http://link.springer.com/10.1007/978-3-319-10575-8_7

  • Sakurai Y, Kawahara J and Oyama S. (2018). Aggregating Crowd Opinions Using Shapley Value Regression. Multi-disciplinary Trends in Artificial Intelligence. 10.1007/978-3-030-03014-8_13. (151-160).

    http://link.springer.com/10.1007/978-3-030-03014-8_13

  • van Dijk T, Wille R and Meolic R. Tagged BDDs. Proceedings of the 17th Conference on Formal Methods in Computer-Aided Design. (108-115).

    /doi/10.5555/3168451.3168478

  • van Dijk T, Wille R and Meolic R. (2017). Tagged BDDs: Combining reduction rules from different decision diagram types 2017 Formal Methods in Computer Aided Design (FMCAD). 10.23919/FMCAD.2017.8102248. 978-0-9835678-7-5. (108-115).

    http://ieeexplore.ieee.org/document/8102248/

  • Toulas T and Tragoudas S. (2017). Diagnosis with transition faults on embedded segments 2017 IEEE 23rd International Symposium on On-Line Testing and Robust System Design (IOLTS). 10.1109/IOLTS.2017.8046173. 978-1-5386-0352-9. (25-27).

    http://ieeexplore.ieee.org/document/8046173/

  • Toda T. (2017). Dualization of boolean functions using ternary decision diagrams. Annals of Mathematics and Artificial Intelligence. 79:1-3. (229-244). Online publication date: 1-Mar-2017.

    https://doi.org/10.1007/s10472-016-9520-z

  • Nishino M, Yasuda N, Minato S and Nagata M. Compiling graph substructures into sentential decision diagrams. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence. (1213-1221).

    /doi/10.5555/3298239.3298417

  • Nishino M, Yasuda N, Minato S and Nagata M. Dancing with decision diagrams. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence. (868-874).

    /doi/10.5555/3298239.3298366

  • Eguchi R, Ono N, Horai H, Amin M, Morita Hirai A, Kawahara J, Kasahara S, Endo T and Kanaya S. (2017). [Dedicated to Prof. T. Okada and Prof. T. Nishioka: data science in chemistry]Classification of Alkaloid Compounds Based on Subring Skeleton (SRS) Profiling: On Finding Relationship of Compounds with Metabolic Pathways. Journal of Computer Aided Chemistry. 10.2751/jcac.18.58. 18:0. (58-75).

    https://www.jstage.jst.go.jp/article/jcac/18/0/18_58/_article

  • MINATO S. (2017). Power of Enumeration — Recent Topics on BDD/ZDD-Based Techniques for Discrete Structure Manipulation. IEICE Transactions on Information and Systems. 10.1587/transinf.2016LOI0002. E100.D:8. (1556-1562).

    https://www.jstage.jst.go.jp/article/transinf/E100.D/8/E100.D_2016LOI0002/_article

  • KAWAHARA J, INOUE T, IWASHITA H and MINATO S. (2017). Frontier-Based Search for Enumerating All Constrained Subgraphs with Compressed Representation. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 10.1587/transfun.E100.A.1773. E100.A:9. (1773-1784).

    https://www.jstage.jst.go.jp/article/transfun/E100.A/9/E100.A_1773/_article

  • Ohashi T and Tsuchiya T. (2017). Generating High Strength Test Suites for Combinatorial Interaction Testing Using ZDD-Based Graph Algorithms 2017 IEEE 22nd Pacific Rim International Symposium on Dependable Computing (PRDC). 10.1109/PRDC.2017.19. 978-1-5090-5652-1. (78-85).

    http://ieeexplore.ieee.org/document/7920599/

  • Naka T and Hara S. (2017). Route selection algorithms utilizing the property of the ZDD for compressed sensing-based transmissive network tomography. Procedia Computer Science. 10.1016/j.procs.2017.05.303. 109. (124-131).

    https://linkinghub.elsevier.com/retrieve/pii/S1877050917309638

  • Kawahara J, Horiyama T, Hotta K and Minato S. (2017). Generating All Patterns of Graph Partitions Within a Disparity Bound. WALCOM: Algorithms and Computation. 10.1007/978-3-319-53925-6_10. (119-131).

    http://link.springer.com/10.1007/978-3-319-53925-6_10

  • Kawahara J, Saitoh T, Suzuki H and Yoshinaka R. (2017). Solving the Longest Oneway-Ticket Problem and Enumerating Letter Graphs by Augmenting the Two Representative Approaches with ZDDs. Computational Intelligence in Information Systems. 10.1007/978-3-319-48517-1_26. (294-305).

    http://link.springer.com/10.1007/978-3-319-48517-1_26

  • Amaru L. (2017). Biconditional Logic. New Data Structures and Algorithms for Logic Synthesis and Verification. 10.1007/978-3-319-43174-1_2. (15-55).

    http://link.springer.com/10.1007/978-3-319-43174-1_2

  • Somashekar A, Tragoudas S, Jayabharathi R and Gangadhar S. (2016). Non-enumerative Generation of Path Delay Distributions and Its Application to Critical Path Selection. ACM Transactions on Design Automation of Electronic Systems. 22:1. (1-21). Online publication date: 28-Dec-2016.

    https://doi.org/10.1145/2940327

  • Bernasconi A and Ciriani V. (2016). Index-Resilient Zero-Suppressed BDDs. ACM Transactions on Design Automation of Electronic Systems. 21:4. (1-27). Online publication date: 22-Sep-2016.

    https://doi.org/10.1145/2905363

  • Lee T, Denzumi S and Sadakane K. Engineering Hybrid DenseZDDs. Proceedings of the 15th International Symposium on Experimental Algorithms - Volume 9685. (201-216).

    https://doi.org/10.1007/978-3-319-38851-9_14

  • 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.

    https://doi.org/10.1111/coin.12051

  • 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.

    https://doi.org/10.1134/S000511791604007X

  • Morrison D, Sewell E and Jacobson S. (2016). Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams. INFORMS Journal on Computing. 10.1287/ijoc.2015.0667. 28:1. (67-82). Online publication date: 1-Feb-2016.

    http://pubsonline.informs.org/doi/10.1287/ijoc.2015.0667

  • Bergman D, Cire A, van Hoeve W and Hooker J. (2016). Discrete Optimization with Decision Diagrams. INFORMS Journal on Computing. 10.1287/ijoc.2015.0648. 28:1. (47-66). Online publication date: 1-Feb-2016.

    http://pubsonline.informs.org/doi/10.1287/ijoc.2015.0648

  • Inoue T, Iwashita H, Kawahara J and Minato S. (2016). Graphillion. International Journal on Software Tools for Technology Transfer (STTT). 18:1. (57-66). Online publication date: 1-Feb-2016.

    https://doi.org/10.1007/s10009-014-0352-z

  • YOSHINO D and HATO E. (2016). FAST ENUMERATION METHOD OF TRAVEL ROUTE OF DRT USING ZERO-SUPPRESSED BINARY DECISION DIAGRAM. Journal of Japan Society of Civil Engineers, Ser. D3 (Infrastructure Planning and Management). 10.2208/jscejipm.72.I_1229. 72:5. (I_1229-I_1239).

    https://www.jstage.jst.go.jp/article/jscejipm/72/5/72_I_1229/_article/-char/ja/

  • Nassar A and Kurdahi F. (2016). Lattice-based Boolean diagrams 2016 21st Asia and South Pacific Design Automation Conference (ASP-DAC). 10.1109/ASPDAC.2016.7428056. 978-1-4673-9569-4. (468-473).

    http://ieeexplore.ieee.org/document/7428056/

  • Lasota S. (2016). Models of Modern Active Devices for Effective and Always Cancelation-free Symbolic Analysis**This research was supported by statutory funds (BK-220/RAu-3/2016) of the Institute of Electronics, Silesian University of Technology granted by Polish Ministry of Science and Higher Eructation No. 8686/E-367/S/2016.. IFAC-PapersOnLine. 10.1016/j.ifacol.2016.12.014. 49:25. (80-85).

    https://linkinghub.elsevier.com/retrieve/pii/S2405896316326507

  • Triska M. (2016). The Boolean Constraint Solver of SWI-Prolog (System Description). Functional and Logic Programming. 10.1007/978-3-319-29604-3_4. (45-61).

    http://link.springer.com/10.1007/978-3-319-29604-3_4

  • Minato S. (2016). Counting by ZDD. Encyclopedia of Algorithms. 10.1007/978-1-4939-2864-4_734. (454-458).

    http://link.springer.com/10.1007/978-1-4939-2864-4_734

  • Matuzas V and Contini S. (2015). Dynamic labelling of BDD and ZBDD for efficient non-coherent fault tree analysis. Reliability Engineering & System Safety. 10.1016/j.ress.2015.07.012. 144. (183-192). Online publication date: 1-Dec-2015.

    https://linkinghub.elsevier.com/retrieve/pii/S0951832015002021

  • Rahwan T, Michalak T, Wooldridge M and Jennings N. (2015). Coalition structure generation. Artificial Intelligence. 229:C. (139-174). Online publication date: 1-Dec-2015.

    https://doi.org/10.1016/j.artint.2015.08.004

  • Biedermann A, Huss S and Israr A. (2015). Safe Dynamic Reshaping of Reconfigurable MPSoC Embedded Systems for Self-Healing and Self-Adaption Purposes. ACM Transactions on Reconfigurable Technology and Systems. 8:4. (1-22). Online publication date: 1-Oct-2015.

    https://doi.org/10.1145/2700416

  • Rauzy A and Blériot-Fabre C. (2015). Towards a sound semantics for dynamic fault trees. Reliability Engineering & System Safety. 10.1016/j.ress.2015.04.017. 142. (184-191). Online publication date: 1-Oct-2015.

    https://linkinghub.elsevier.com/retrieve/pii/S0951832015001295

  • Bernasconi A, Ciriani V and Lago L. (2015). On the error resilience of ordered binary decision diagrams. Theoretical Computer Science. 595:C. (11-33). Online publication date: 30-Aug-2015.

    https://doi.org/10.1016/j.tcs.2015.05.050

  • Takahashi K, Onosato M and Tanaka F. (2015). A comprehensive approach for managing feasible solutions in production planning by an interacting network of Zero-Suppressed Binary Decision Diagrams. Journal of Computational Design and Engineering. 10.1016/j.jcde.2014.12.005. 2:2. (105-112). Online publication date: 1-Apr-2015.

    https://linkinghub.elsevier.com/retrieve/pii/S228843001400013X

  • Takizawa A, Miyata Y and Katoh N. (2015). Enumeration of Floor Plans Based on a Zero-Suppressed Binary Decision Diagram. International Journal of Architectural Computing. 10.1260/1478-0771.13.1.25. 13:1. (25-44). Online publication date: 1-Mar-2015.

    https://journals.sagepub.com/doi/10.1260/1478-0771.13.1.25

  • Inoue T, Yasuda N, Kawano S, Takenobu Y, Minato S and Hayashitakeru Y. Distribution Network Verification for Secure Restoration by Enumerating All Critical Failures. IEEE Transactions on Smart Grid. 10.1109/TSG.2014.2359114. 6:2. (843-852).

    http://ieeexplore.ieee.org/document/6915711/

  • Takahashi K, Onosato M and Tanaka F. (2015). A Solution Method for Comprehensive Solution Candidates in Dynamic Production Planning by Zero-Suppressed Binary Decision Diagrams. Transactions of the Institute of Systems, Control and Information Engineers. 10.5687/iscie.28.107. 28:3. (107-115).

    https://www.jstage.jst.go.jp/article/iscie/28/3/28_107/_article/-char/ja/

  • Cheung S, Nakamoto M and Hamuro Y. (2015). NYSOL: A User-Centric Framework for Knowledge Discovery in Big Data. International Journal of Knowledge Engineering. 10.18178/ijke.2015.1.3.037. 1:3. (214-218).

    http://www.ijke.org//show-39-75-1.html

  • Xu D, Horiyama T, Shirakawa T and Uehara R. (2015). Common Developments of Three Incongruent Boxes of Area 30. Theory and Applications of Models of Computation. 10.1007/978-3-319-17142-5_21. (236-247).

    https://link.springer.com/10.1007/978-3-319-17142-5_21

  • Nagayama S. (2015). Regular Expression Matching Using Zero-Suppressed Decision Diagrams. Applications of Zero-Suppressed Decision Diagrams. 10.1007/978-3-031-79870-2_4. (63-61).

    https://link.springer.com/10.1007/978-3-031-79870-2_4

  • Minato S. (2015). The Power of Enumeration–BDD/ZDD-Based Algorithms for Tackling Combinatorial Explosion. Applications of Zero-Suppressed Decision Diagrams. 10.1007/978-3-031-79870-2_3. (49-61).

    https://link.springer.com/10.1007/978-3-031-79870-2_3

  • Mishchenko A. (2015). Introduction to Zero-Suppressed Decision Diagrams. Applications of Zero-Suppressed Decision Diagrams. 10.1007/978-3-031-79870-2_1. (1-33).

    https://link.springer.com/10.1007/978-3-031-79870-2_1

  • Amaru L, Gaillardon P and De Micheli G. Biconditional Binary Decision Diagrams: A Novel Canonical Logic Representation Form. IEEE Journal on Emerging and Selected Topics in Circuits and Systems. 10.1109/JETCAS.2014.2361058. 4:4. (487-500).

    http://ieeexplore.ieee.org/document/6924810/

  • García-Borroto M, Martínez-Trinidad J and Carrasco-Ochoa J. (2014). A survey of emerging patterns for supervised classification. Artificial Intelligence Review. 42:4. (705-721). Online publication date: 1-Dec-2014.

    https://doi.org/10.1007/s10462-012-9355-x

  • Sasao T and Butler J. (2014). Applications of Zero-Suppressed Decision Diagrams. Synthesis Lectures on Digital Circuits and Systems. 10.2200/S00612ED1V01Y201411DCS045. 9:2. (1-123). Online publication date: 10-Nov-2014.

    http://www.morganclaypool.com/doi/abs/10.2200/S00612ED1V01Y201411DCS045

  • Alhakami H, Ciardo G and Chrobak M. Sequence Decision Diagrams. Proceedings of the 21st International Symposium on String Processing and Information Retrieval - Volume 8799. (149-160).

    https://doi.org/10.1007/978-3-319-11918-2_15

  • Neophytou S and Michael M. (2014). Optimal variable ordering in ZBDD-based path representations for directed acyclic graphs 2014 32nd IEEE International Conference on Computer Design (ICCD). 10.1109/ICCD.2014.6974724. 978-1-4799-6492-5. (489-492).

    http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6974724

  • Andrews J. (2014). Fault Tree Analysis for Large Systems. Wiley StatsRef: Statistics Reference Online. 10.1002/9781118445112.stat03934.

    https://onlinelibrary.wiley.com/doi/10.1002/9781118445112.stat03934

  • Tarau P. Bijective Collection Encodings and Boolean Operations with Hereditarily Binary Natural Numbers. Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming. (31-42).

    https://doi.org/10.1145/2643135.2643139

  • Morrison D, Sewell E and Jacobson S. (2014). Characteristics of the maximal independent set ZDD. Journal of Combinatorial Optimization. 28:1. (121-139). Online publication date: 1-Jul-2014.

    https://doi.org/10.1007/s10878-014-9722-4

  • Denzumi S, Kawahara J, Tsuda K, Arimura H, Minato S and Sadakane K. DenseZDD. Proceedings of the 13th International Symposium on Experimental Algorithms - Volume 8504. (187-198).

    https://doi.org/10.1007/978-3-319-07959-2_16

  • (2014). Optimization Bounds from Binary Decision Diagrams. INFORMS Journal on Computing. 26:2. (253-268). Online publication date: 1-May-2014.

    https://doi.org/10.1287/ijoc.2013.0561

  • Amarú L, Gaillardon P and De Micheli G. An efficient manipulation package for biconditional binary decision diagrams. Proceedings of the conference on Design, Automation & Test in Europe. (1-6).

    /doi/10.5555/2616606.2617036

  • Lampka K and Siegle M. A Symbolic Approach to the Analysis of Multi-Formalism Markov Reward Models. Theory and Application of Multi-Formalism Modeling. 10.4018/978-1-4666-4659-9.ch009. (170-195).

    http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-4666-4659-9.ch009

  • INOUE Y, TODA T and MINATO S. (2014). Implicit Generation of Pattern-Avoiding Permutations by Using Permutation Decision Diagrams. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 10.1587/transfun.E97.A.1171. E97.A:6. (1171-1179).

    http://jlc.jst.go.jp/DN/JST.JSTAGE/transfun/E97.A.1171?lang=en&from=CrossRef&type=abstract

  • TAKAHASHI K, ONOSATO M and TANAKA F. (2014). Comprehensive representation of feasible combinations of alternatives for dynamic production planning using Zero-Suppressed Binary Decision Diagram. Journal of Advanced Mechanical Design, Systems, and Manufacturing. 10.1299/jamdsm.2014jamdsm0061. 8:4. (JAMDSM0061-JAMDSM0061).

    http://jlc.jst.go.jp/DN/JST.JSTAGE/jamdsm/2014jamdsm0061?lang=en&from=CrossRef&type=abstract

  • Inoue T, Takano K, Watanabe T, Kawahara J, Yoshinaka R, Kishimoto A, Tsuda K, Minato S and Hayashi Y. Distribution Loss Minimization With Guaranteed Error Bound. IEEE Transactions on Smart Grid. 10.1109/TSG.2013.2288976. 5:1. (102-111).

    http://ieeexplore.ieee.org/document/6693788/

  • Israr A and Huss S. (2014). Reliable system design using decision diagrams in presence of hard and soft errors 2014 11th International Bhurban Conference on Applied Sciences and Technology (IBCAST). 10.1109/IBCAST.2014.6778136. 978-1-4799-2319-9. (1-9).

    http://ieeexplore.ieee.org/document/6778136/

  • Ribeiro T, Inoue K and Sakama C. (2014). A BDD-Based Algorithm for Learning from Interpretation Transition. Inductive Logic Programming. 10.1007/978-3-662-44923-3_4. (47-63).

    https://link.springer.com/10.1007/978-3-662-44923-3_4

  • Bernasconi A and Ciriani V. (2014). Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults. Advanced Information Systems Engineering. 10.1007/978-3-662-44602-7_1. (1-12).

    http://link.springer.com/10.1007/978-3-662-44602-7_1

  • Minato S. (2014). Counting by ZDD. Encyclopedia of Algorithms. 10.1007/978-3-642-27848-8_734-1. (1-6).

    https://link.springer.com/10.1007/978-3-642-27848-8_734-1

  • Takeuchi S, Toda T and Minato S. (2014). A General Framework for Parallel Unary Operations on ZDDs. Trends and Applications in Knowledge Discovery and Data Mining. 10.1007/978-3-319-13186-3_44. (494-503).

    http://link.springer.com/10.1007/978-3-319-13186-3_44

  • Aoki H, Toda T and Minato S. (2014). Three-way Indexing ZDDs for Large-Scale Sparse Datasets. Trends and Applications in Knowledge Discovery and Data Mining. 10.1007/978-3-319-13186-3_41. (457-469).

    https://link.springer.com/10.1007/978-3-319-13186-3_41

  • Terao T and Kobayashi N. (2014). A ZDD-Based Efficient Higher-Order Model Checking Algorithm. Programming Languages and Systems. 10.1007/978-3-319-12736-1_19. (354-371).

    http://link.springer.com/10.1007/978-3-319-12736-1_19

  • Lovato A, Macedonio D and Spoto F. (2014). A Thread-Safe Library for Binary Decision Diagrams. Software Engineering and Formal Methods. 10.1007/978-3-319-10431-7_4. (35-49).

    http://link.springer.com/10.1007/978-3-319-10431-7_4

  • Bugaychenko D and Zubarevich D. (2014). Fast Pattern Recognition and Deep Learning Using Multi-Rooted Binary Decision Diagrams. Machine Learning and Data Mining in Pattern Recognition. 10.1007/978-3-319-08979-9_6. (73-77).

    http://link.springer.com/10.1007/978-3-319-08979-9_6

  • Ostanin S. (2013). Testable combinational circuit design based on free ZDD-implementation of irredundant SOPof Boolean function 2013 11th East-West Design and Test Symposium (EWDTS). 10.1109/EWDTS.2013.6673109. 978-1-4799-2096-9. (1-4).

    http://ieeexplore.ieee.org/document/6673109/

  • Nusbaumer O and Rauzy A. (2013). Fault tree linking versus event tree linking approaches: a reasoned comparison. Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability. 10.1177/1748006X13490260. 227:3. (315-326). Online publication date: 1-Jun-2013.

    https://journals.sagepub.com/doi/10.1177/1748006X13490260

  • Tague L, Soeken M, Minato S and Drechsler R. Debugging of Reversible Circuits Using pDDs. Proceedings of the 2013 IEEE 43rd International Symposium on Multiple-Valued Logic. (316-321).

    https://doi.org/10.1109/ISMVL.2013.22

  • Mahdi I and Nadji B. (2013). Application of the binary decision diagram (BDD) in the analysis of the reliability of the inverters 2013 IV International Conference on Power Engineering, Energy and Electrical Drives (POWERENG). 10.1109/PowerEng.2013.6635794. 978-1-4673-6392-1. (1265-1271).

    http://ieeexplore.ieee.org/document/6635794/

  • Bjorkman K. (2013). Solving dynamic flowgraph methodology models using binary decision diagrams. Reliability Engineering & System Safety. 10.1016/j.ress.2012.11.009. 111. (206-216). Online publication date: 1-Mar-2013.

    https://linkinghub.elsevier.com/retrieve/pii/S0951832012002384

  • Shi G. (2013). Graph-Pair Decision Diagram Construction for Topological Symbolic Circuit Analysis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 32:2. (275-288). Online publication date: 1-Feb-2013.

    https://doi.org/10.1109/TCAD.2012.2217963

  • Watanabe T, Fujimoto Y and Hayashi Y. (2013). Verification of loss reduction effect on loss minimum configuration of distribution system by zero-suppressed binary decision diagram for large penetration of residential PV 2013 IEEE PES Innovative Smart Grid Technologies Conference (ISGT 2013). 10.1109/ISGT.2013.6497872. 978-1-4673-4896-6. (1-6).

    http://ieeexplore.ieee.org/document/6497872/

  • Shi G. (2013). A survey on binary decision diagram approaches to symbolic analysis of analog integrated circuits. Analog Integrated Circuits and Signal Processing. 74:2. (331-343). Online publication date: 1-Feb-2013.

    https://doi.org/10.1007/s10470-011-9773-8

  • MINATO S. (2013). Techniques of BDD/ZDD: Brief History and Recent Activity. IEICE Transactions on Information and Systems. 10.1587/transinf.E96.D.1419. E96.D:7. (1419-1429).

    http://jlc.jst.go.jp/DN/JST.JSTAGE/transinf/E96.D.1419?lang=en&from=CrossRef&type=abstract

  • Toda T. (2013). Fast Compression of Large-Scale Hypergraphs for Solving Combinatorial Problems. Discovery Science. 10.1007/978-3-642-40897-7_19. (281-293).

    http://link.springer.com/10.1007/978-3-642-40897-7_19

  • Chakraborty S, Meel K and Vardi M. (2013). A Scalable Approximate Model Counter. Principles and Practice of Constraint Programming. 10.1007/978-3-642-40627-0_18. (200-216).

    http://link.springer.com/10.1007/978-3-642-40627-0_18

  • Minato S. (2013). Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets. Algorithms – ESA 2013. 10.1007/978-3-642-40450-4_62. (731-742).

    http://link.springer.com/10.1007/978-3-642-40450-4_62

  • Toda T. (2013). Hypergraph Transversal Computation with Binary Decision Diagrams. Experimental Algorithms. 10.1007/978-3-642-38527-8_10. (91-102).

    http://link.springer.com/10.1007/978-3-642-38527-8_10

  • Shirai Y, Takashima H, Tsuruma K and Oyama S. (2013). Similarity Joins on Item Set Collections Using Zero-Suppressed Binary Decision Diagrams. Database Systems for Advanced Applications. 10.1007/978-3-642-37487-6_7. (56-70).

    http://link.springer.com/10.1007/978-3-642-37487-6_7

  • Soeken M, Wille R, Minato S and Drechsler R. (2013). Using πDDs in the Design of Reversible Circuits. Reversible Computation. 10.1007/978-3-642-36315-3_16. (197-203).

    http://link.springer.com/10.1007/978-3-642-36315-3_16

  • Takeuchi S, Kawahara J, Kishimoto A and Minato S. (2013). Shared-Memory Parallel Frontier-Based Search. WALCOM: Algorithms and Computation. 10.1007/978-3-642-36065-7_17. (170-181).

    http://link.springer.com/10.1007/978-3-642-36065-7_17

  • Huang Z and Lin D. (2013). A New Method for Solving Polynomial Systems with Noise over $\mathbb{F}_2$ and Its Applications in Cold Boot Key Recovery. Selected Areas in Cryptography. 10.1007/978-3-642-35999-6_2. (16-33).

    http://link.springer.com/10.1007/978-3-642-35999-6_2

  • Matuzas V and Contini S. (2012). On the efficiency of functional decomposition in fault tree analysis. Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability. 10.1177/1748006X12458995. 226:6. (635-645). Online publication date: 1-Dec-2012.

    http://journals.sagepub.com/doi/10.1177/1748006X12458995

  • Neophytou S, Christou K and Michael M. (2012). A Non-Enumerative Technique for Measuring Path Correlation in Digital Circuits. Journal of Electronic Testing: Theory and Applications. 28:6. (843-856). Online publication date: 1-Dec-2012.

    https://doi.org/10.1007/s10836-012-5333-0

  • Papadopoulos A and O'Sullivan B. Compiling Domain Consequences. Proceedings of the 2012 IEEE 24th International Conference on Tools with Artificial Intelligence - Volume 01. (618-625).

    https://doi.org/10.1109/ICTAI.2012.89

  • (2012). Bibliography. Contrast Data Mining. 10.1201/b12986-34. Online publication date: 14-Sep-2012.

    http://www.crcnetbase.com/doi/abs/10.1201/b12986-34

  • Yoshinaka R, Kawahara J, Denzumi S, Arimura H and Minato S. (2012). Counterexamples to the long-standing conjecture on the complexity of BDD binary operations. Information Processing Letters. 112:16. (636-640). Online publication date: 1-Aug-2012.

    https://doi.org/10.1016/j.ipl.2012.05.007

  • Pina Ros S, Lischka M and Gómez Mármol F. Graph-based XACML evaluation. Proceedings of the 17th ACM symposium on Access Control Models and Technologies. (83-92).

    https://doi.org/10.1145/2295136.2295153

  • Kiyomi M, Okamoto Y and Saitoh T. Efficient enumeration of the directed binary perfect phylogenies from incomplete data. Proceedings of the 11th international conference on Experimental Algorithms. (248-259).

    https://doi.org/10.1007/978-3-642-30850-5_22

  • Gao X and Huang Z. (2012). Characteristic set algorithms for equation solving in finite fields. Journal of Symbolic Computation. 47:6. (655-679). Online publication date: 1-Jun-2012.

    https://doi.org/10.1016/j.jsc.2011.12.025

  • Shirai Y, Tsuruma K, Sakurai Y, Oyama S and Minato S. Incremental set recommendation based on class differences. Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I. (183-194).

    https://doi.org/10.1007/978-3-642-30217-6_16

  • Stankovic S, Stankovic R and Astola J. Remarks on Shapes of Decision Diagrams and Classes of Multiple-Valued Functions. Proceedings of the 2012 IEEE 42nd International Symposium on Multiple-Valued Logic. (134-141).

    https://doi.org/10.1109/ISMVL.2012.37

  • Yoshinaka R, Saitoh T, Kawahara J, Tsuruma K, Iwashita H and Minato S. (2012). Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs. Algorithms. 10.3390/a5020176. 5:2. (176-213).

    https://www.mdpi.com/1999-4893/5/2/176

  • Nishino M, Yasud N and Kobayashi T. (2012). An Efficient Calculation of Set Expansion using Zero-Suppressed Binary Decision Diagrams. Transactions of the Japanese Society for Artificial Intelligence. 10.1527/tjsai.27.22. 27:2. (22-27).

    http://joi.jlc.jst.go.jp/JST.JSTAGE/tjsai/27.22?from=CrossRef

  • Kordon F, Linard A, Buchs D, Colange M, Evangelista S, Lampka K, Lohmann N, Paviot-Adet E, Thierry-Mieg Y and Wimmel H. (2012). Report on the Model Checking Contest at Petri Nets 2011. Transactions on Petri Nets and Other Models of Concurrency VI. 10.1007/978-3-642-35179-2_8. (169-196).

    http://link.springer.com/10.1007/978-3-642-35179-2_8

  • Sakurai Y, Ueda S, Iwasaki A, Minato S and Yokoo M. A compact representation scheme of coalitional games based on multi-terminal zero-suppressed binary decision diagrams. Proceedings of the 14th international conference on Agents in Principle, Agents in Practice. (4-18).

    https://doi.org/10.1007/978-3-642-25044-6_4

  • Kitakoshi D, Wakasaki S and Suzuki M. (2011). A probabilistic reasoning algorithm for Bayesian networks by simplifying their structures 2011 IEEE International Conference on Granular Computing (GrC-2011). 10.1109/GRC.2011.6122618. 978-1-4577-0371-3. (336-341).

    http://ieeexplore.ieee.org/document/6122618/

  • Aoki H, Yamashita S and Minato S. (2011). An efficient algorithm for constructing a Sequence Binary Decision Diagram representing a set of reversed sequences 2011 IEEE International Conference on Granular Computing (GrC-2011). 10.1109/GRC.2011.6122567. 978-1-4577-0371-3. (54-59).

    http://ieeexplore.ieee.org/document/6122567/

  • Yedidia J. (2011). Message-Passing Algorithms for Inference and Optimization. Journal of Statistical Physics. 10.1007/s10955-011-0384-7. 145:4. (860-890). Online publication date: 1-Nov-2011.

    http://link.springer.com/10.1007/s10955-011-0384-7

  • Huang Z and Lin D. Attacking Bivium and Trivium with the characteristic set method. Proceedings of the 4th international conference on Progress in cryptology in Africa. (77-91).

    /doi/10.5555/2026469.2026476

  • (2011). Verification of Finite‐State Systems. Models and Analysis in Distributed Systems. 10.1002/9781118602638.ch7. (155-220). Online publication date: 5-Jul-2011.

    https://onlinelibrary.wiley.com/doi/10.1002/9781118602638.ch7

  • Rauzy A. (2011). Sequence Algebra, Sequence Decision Diagrams and Dynamic Fault Trees. Reliability Engineering & System Safety. 10.1016/j.ress.2011.02.005. 96:7. (785-792). Online publication date: 1-Jul-2011.

    https://linkinghub.elsevier.com/retrieve/pii/S0951832011000135

  • Minato S. πDD. Proceedings of the 14th international conference on Theory and application of satisfiability testing. (90-104).

    /doi/10.5555/2023474.2023486

  • Neophytou S, Christou K and Michael M. An Approach for Quantifying Path Correlation in Digital Circuits without any Path or Segment Enumeration. Proceedings of the 2011 Sixteenth IEEE European Test Symposium. (141-146).

    https://doi.org/10.1109/ETS.2011.44

  • Minato S. (2011). Overview of ERATO Minato Project: The Art of Discrete Structure Manipulation between Science and Engineering. New Generation Computing. 10.1007/s00354-011-0105-4. 29:2. (223-238). Online publication date: 1-Apr-2011.

    http://link.springer.com/10.1007/s00354-011-0105-4

  • Pock M, Malass'e O and Walter M. (2011). Combining different binary decision diagram techniques for solving models with multiple failure states. Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability. 10.1177/1748006XJRR284. 225:1. (18-27). Online publication date: 1-Mar-2011.

    https://journals.sagepub.com/doi/10.1177/1748006XJRR284

  • Contini S and Matuzas V. (2011). Analysis of large fault trees based on functional decomposition. Reliability Engineering & System Safety. 10.1016/j.ress.2010.11.002. 96:3. (383-390). Online publication date: 1-Mar-2011.

    https://linkinghub.elsevier.com/retrieve/pii/S0951832010002395

  • Guo Y and Zeng J. (2011). Dynamic Performance Analysis for Collaborative Design Model of Machinery Products Based on Invariant Analysis. Advanced Materials Research. 10.4028/www.scientific.net/AMR.211-212.340. 211-212. (340-346).

    https://www.scientific.net/AMR.211-212.340

  • MINATO S. (2011). Recent Topics on Discrete Structures and Algebraic Operations Based on BDDs/ZDDs. IEICE ESS FUNDAMENTALS REVIEW. 10.1587/essfr.4.224. 4:3. (224-230).

    http://joi.jlc.jst.go.jp/JST.JSTAGE/essfr/4.224?from=CrossRef

  • Minato S. (2011). Discrete Structure Manipulation for Discovery Science Problems. Computer and Information Sciences. 10.1007/978-90-481-9794-1_67. (359-364).

    https://link.springer.com/10.1007/978-90-481-9794-1_67

  • Huang Z and Lin D. (2011). Attacking Bivium and Trivium with the Characteristic Set Method. Progress in Cryptology – AFRICACRYPT 2011. 10.1007/978-3-642-21969-6_5. (77-91).

    http://link.springer.com/10.1007/978-3-642-21969-6_5

  • Minato S. (2011). πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space. Theory and Applications of Satisfiability Testing - SAT 2011. 10.1007/978-3-642-21581-0_9. (90-104).

    http://link.springer.com/10.1007/978-3-642-21581-0_9

  • Mukherjee B and Dandapat A. Design of Combinational Circuits by Cyclic Combinational Method for Low Power VLSI. Proceedings of the 2010 International Symposium on Electronic System Design. (107-112).

    https://doi.org/10.1109/ISED.2010.29

  • Shi G. A simple implementation of determinant decision diagram. Proceedings of the International Conference on Computer-Aided Design. (70-76).

    /doi/10.5555/2133429.2133442

  • Shi G. (2010). A simple implementation of determinant decision diagram 2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD). 10.1109/ICCAD.2010.5654333. 978-1-4244-8193-4. (70-76).

    http://ieeexplore.ieee.org/document/5654333/

  • Shi G. (2010). Computational complexity analysis of determinant decision diagram. IEEE Transactions on Circuits and Systems II: Express Briefs. 57:10. (828-832). Online publication date: 1-Oct-2010.

    https://doi.org/10.1109/TCSII.2010.2067791

  • Geeraerts G, Kalyon G, Le Gall T, Maquet N and Raskin J. Lattice-valued binary decision diagrams. Proceedings of the 8th international conference on Automated technology for verification and analysis. (158-172).

    /doi/10.5555/1927331.1927346

  • Ostanin S and Muchamedov R. (2010). Testable combinational circuit design based on ZDD-implementation of ISOP Boolean function Test Symposium (EWDTS). 10.1109/EWDTS.2010.5742153. 978-1-4244-9555-9. (171-174).

    http://ieeexplore.ieee.org/document/5742153/

  • Lampka K, Siegle M, Ossowski J and Baier C. (2010). Partially-shared zero-suppressed multi-terminal BDDs. Formal Methods in System Design. 36:3. (198-222). Online publication date: 1-Sep-2010.

    https://doi.org/10.1007/s10703-010-0095-8

  • Loekito E, Bailey J and Pei J. (2009). A binary decision diagram based approach for mining frequent subsequences. Knowledge and Information Systems. 10.1007/s10115-009-0252-9. 24:2. (235-268). Online publication date: 1-Aug-2010.

    http://link.springer.com/10.1007/s10115-009-0252-9

  • Linard A, Paviot-Adet E, Kordon F, Buchs D and Charron S. polyDD. Proceedings of the 2010 10th International Conference on Application of Concurrency to System Design. (124-133).

    https://doi.org/10.1109/ACSD.2010.17

  • Flanigan E and Tragoudas S. (2010). Identification of delay measurable PDFs using linear dependency relationships. IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 18:6. (1011-1015). Online publication date: 1-Jun-2010.

    https://doi.org/10.1109/TVLSI.2009.2017541

  • Adapa R and Tragoudas S. (2010). Techniques to prioritize paths for diagnosis. IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 18:4. (658-661). Online publication date: 1-Apr-2010.

    https://doi.org/10.1109/TVLSI.2009.2013469

  • Terlecki P. On the relation between jumping emerging patterns and rough set theory with application to data classification. Transactions on rough sets XII. (236-338).

    /doi/10.5555/1880429.1880442

  • Malasse O, Buchheit G, Pock M and Walter M. (2010). Dependability evaluation of complex embedded systems and microsystems 2010 Annual Reliability and Maintainability Symposium (RAMS 2010). The International Symposium on Product Quality and Integrity. 10.1109/RAMS.2010.5447976. 978-1-4244-5102-9. (1-6).

    http://ieeexplore.ieee.org/document/5447976/

  • Minato S. (2010). Data Mining Using Binary Decision Diagrams. Progress in Applications of Boolean Functions. 10.1007/978-3-031-79812-2_5. (97-110).

    https://link.springer.com/10.1007/978-3-031-79812-2_5

  • Andrews J. (2009). System reliability modelling: The current capability and potential future developments. Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science. 10.1243/09544062JMES1538. 223:12. (2881-2897). Online publication date: 1-Dec-2009.

    http://journals.sagepub.com/doi/10.1243/09544062JMES1538

  • Fiser P and Toman D. A Fast SOP Minimizer for Logic Funcions Described by Many Product Terms. Proceedings of the 2009 12th Euromicro Conference on Digital System Design, Architectures, Methods and Tools. (757-764).

    https://doi.org/10.1109/DSD.2009.157

  • Heiner M, Schwarick M and Tovchigrechko A. DSSZ-MC --- A Tool for Symbolic Analysis of Extended Petri Nets. Proceedings of the 30th International Conference on Applications and Theory of Petri Nets. (323-332).

    https://doi.org/10.1007/978-3-642-02424-5_20

  • Kocan F, Li L and Saab D. (2009). Exact Path Delay Fault Coverage Calculation of Partitioned Circuits. IEEE Transactions on Computers. 58:6. (858-864). Online publication date: 1-Jun-2009.

    https://doi.org/10.1109/TC.2008.205

  • Israr A, Shoufan A and Huss S. (2009). A compact error model for reliable system design Simulation (HPCS). 10.1109/HPCSIM.2009.5191574. 978-1-4244-4906-4. (60-66).

    http://ieeexplore.ieee.org/document/5191574/

  • Rimsa A, Zárate L and Song M. Evaluation of Different BDD Libraries to Extract Concepts in FCA --- Perspectives and Limitations. Proceedings of the 9th International Conference on Computational Science: Part I. (367-376).

    https://doi.org/10.1007/978-3-642-01970-8_36

  • Rimsa A, Zárate L and Song M. Handling Large Formal Context Using BDD --- Perspectives and Limitations. Proceedings of the 7th International Conference on Formal Concept Analysis. (194-209).

    https://doi.org/10.1007/978-3-642-01815-2_15

  • Flanigan E, Tragoudas S and Abdulrahman A. Scalable Compact Test Pattern Generation for Path Delay Faults Based on Functions. Proceedings of the 2009 27th IEEE VLSI Test Symposium. (140-145).

    https://doi.org/10.1109/VTS.2009.22

  • Israr A, Shoufan A and Huss S. An efficient reliability evaluation approach for system-level design of embedded systems. Proceedings of the 2009 10th International Symposium on Quality of Electronic Design. (339-344).

    https://doi.org/10.1109/ISQED.2009.4810317

  • Remenyte‐Prescott R and Andrews J. (2008). An efficient real‐time method of analysis for non‐coherent fault trees. Quality and Reliability Engineering International. 10.1002/qre.955. 25:2. (129-150). Online publication date: 1-Mar-2009.

    https://onlinelibrary.wiley.com/doi/10.1002/qre.955

  • Lhoták O, Curial S and Amaral J. (2008). Using XBDDs and ZBDDs in points‐to analysis. Software: Practice and Experience. 10.1002/spe.895. 39:2. (163-188). Online publication date: 1-Feb-2009.

    https://onlinelibrary.wiley.com/doi/10.1002/spe.895

  • Sasao T and Butler J. (2009). Progress in Applications of Boolean Functions. Synthesis Lectures on Digital Circuits and Systems. 10.2200/S00243ED1V01Y200912DCS026. 4:1. (1-153). Online publication date: 1-Jan-2009.

    http://www.morganclaypool.com/doi/abs/10.2200/S00243ED1V01Y200912DCS026

  • Trias E, Navas J, Ackley E, Forrest S and Hermenegildo M. Negative Ternary Set-Sharing. Proceedings of the 24th International Conference on Logic Programming. (301-316).

    https://doi.org/10.1007/978-3-540-89982-2_30

  • Song C and Tragoudas S. (2008). Identification of Critical Executable Paths at the Architectural Level. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 27:12. (2291-2302). Online publication date: 1-Dec-2008.

    https://doi.org/10.1109/TCAD.2008.2008912

  • Méndez-Lojo M, Lhoták O and Hermenegildo M. Efficient Set Sharing Using ZBDDs. Languages and Compilers for Parallel Computing. (47-63).

    https://doi.org/10.1007/978-3-540-89740-8_4

  • Hansen E. Encoding CSPs with Zero-Suppressed Decision Diagrams. Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence - Volume 01. (477-485).

    https://doi.org/10.1109/ICTAI.2008.132

  • Ossowski J and Baier C. (2008). A uniform framework for weighted decision diagrams and its implementation. International Journal on Software Tools for Technology Transfer (STTT). 10:5. (425-441). Online publication date: 1-Oct-2008.

    /doi/10.5555/3220905.3221151

  • Bonzini P and Pozzi L. (2008). Recurrence-aware instruction set selection for extensible embedded processors. IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 16:10. (1259-1267). Online publication date: 1-Oct-2008.

    https://doi.org/10.1109/TVLSI.2008.2001863

  • Jayaraman D, Flanigan E and Tragoudas S. (2008). Implicit Identification of Non-Robustly Unsensitizable Paths using Bounded Delay Model 2008 IEEE International Test Conference. 10.1109/TEST.2008.4700626. 978-1-4244-2402-3. (1-10).

    http://ieeexplore.ieee.org/document/4700626/

  • Neiroukh O, Edwards S and Song X. (2008). Transforming Cyclic Circuits Into Acyclic Equivalents. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 27:10. (1775-1787). Online publication date: 1-Oct-2008.

    https://doi.org/10.1109/TCAD.2008.2003305

  • Adapa R and Tragoudas S. Prioritization of Paths for Diagnosis. Proceedings of the 2008 IEEE International Symposium on Defect and Fault Tolerance of VLSI Systems. (474-481).

    https://doi.org/10.1109/DFT.2008.46

  • Ossowski J and Baier C. (2008). A uniform framework for weighted decision diagrams and its implementation. International Journal on Software Tools for Technology Transfer. 10.1007/s10009-008-0069-y. 10:5. (425-441). Online publication date: 1-Oct-2008.

    http://link.springer.com/10.1007/s10009-008-0069-y

  • Thon I, Landwehr N and De Raedt L. A simple model for sequences of relational state descriptions. Proceedings of the 2008th European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II. (506-521).

    /doi/10.5555/3121525.3121559

  • Lasota S. (2008). Parameter decision diagram in the structural synthesis of analog networks 2008 International Conference on Signals and Electronic Systems. 10.1109/ICSES.2008.4673420. 978-83-88309-47-2. (301-304).

    http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4673420

  • Gangadhar S, Skoufis M and Tragoudas S. Propagation of Transients Along Sensitizable Paths. Proceedings of the 2008 14th IEEE International On-Line Testing Symposium. (129-134).

    https://doi.org/10.1109/IOLTS.2008.46

  • Bernasconi A, Ciriani V, Drechsler R and Villa T. Logic Minimization and Testability of 2-SPP Networks. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 10.1109/TCAD.2008.923072. 27:7. (1190-1202).

    http://ieeexplore.ieee.org/document/4544853/

  • Shin-ichi Minato . (2008). A fast algorithm for cofactor implication checking and its application for knowledge discovery 2008 8th IEEE International Conference on Computer and Information Technology (CIT). 10.1109/CIT.2008.4594649. 978-1-4244-2357-6. (53-58).

    http://ieeexplore.ieee.org/document/4594649/

  • Walter M, Siegle M and Bode A. (2008). OpenSESAME—the simple but extensive, structured availability modeling environment. Reliability Engineering & System Safety. 10.1016/j.ress.2007.03.034. 93:6. (857-873). Online publication date: 1-Jun-2008.

    https://linkinghub.elsevier.com/retrieve/pii/S0951832007001226

  • Minato S, Uno T and Arimura H. LCM over ZBDDS. Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining. (234-246).

    /doi/10.5555/1786574.1786599

  • Kettle N and King A. An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 10.1109/TCAD.2008.917592. 27:4. (764-777).

    http://ieeexplore.ieee.org/document/4475251/

  • Assaf T and Dugan J. (2008). Diagnosis based on reliability analysis using monitors and sensors. Reliability Engineering & System Safety. 10.1016/j.ress.2006.10.024. 93:4. (509-521). Online publication date: 1-Apr-2008.

    http://linkinghub.elsevier.com/retrieve/pii/S0951832007000518

  • Ibáñez-Llano C, Meléndez E and F N. (2008). Variable ordering schemes to apply to the binary decision diagram methodology for event tree sequences assessment. Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability. 10.1243/1748006XJRR67. 222:1. (7-16). Online publication date: 1-Mar-2008.

    https://journals.sagepub.com/doi/10.1243/1748006XJRR67

  • Ling A, Zhu J and Brown S. (2008). Scalable Synthesis and Clustering Techniques Using Decision Diagrams. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 27:3. (423-435). Online publication date: 1-Mar-2008.

    https://doi.org/10.1109/TCAD.2008.915545

  • CHAI F, GAO X and YUAN C. (2008). A characteristic set method for solving boolean equations and applications in cryptanalysis of stream ciphers*. Journal of Systems Science and Complexity. 10.1007/s11424-008-9103-0. 21:2. (191-208). Online publication date: 1-Feb-2008.

    http://link.springer.com/10.1007/s11424-008-9103-0

  • Lotfi-Kamran P, Massoumi M, Mirzaei M and Navabi Z. Enhanced TED. Proceedings of the 21st International Conference on VLSI Design. (481-486).

    https://doi.org/10.1109/VLSI.2008.108

  • Samoladas V. Improved BDD Algorithms for the Simulation of Quantum Circuits. Algorithms - ESA 2008. 10.1007/978-3-540-87744-8_60. (720-731).

    http://link.springer.com/10.1007/978-3-540-87744-8_60

  • Thon I, Landwehr N and De Raedt L. (2008). A Simple Model for Sequences of Relational State Descriptions. Machine Learning and Knowledge Discovery in Databases. 10.1007/978-3-540-87481-2_33. (506-521).

    http://link.springer.com/10.1007/978-3-540-87481-2_33

  • Minato S, Uno T and Arimura H. LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation. Advances in Knowledge Discovery and Data Mining. 10.1007/978-3-540-68125-0_22. (234-246).

    http://link.springer.com/10.1007/978-3-540-68125-0_22

  • Andrews J. (2007). Fault Tree Analysis for Large Systems. Encyclopedia of Statistics in Quality and Reliability. 10.1002/9780470061572.eqr454. Online publication date: 14-Dec-2007.

    https://onlinelibrary.wiley.com/doi/10.1002/9780470061572.eqr454

  • Loekito E and Bailey J. Are zero-suppressed binary decision diagrams good for mining frequent patterns in high dimensional datasets?. Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70. (139-150).

    /doi/10.5555/1378245.1378264

  • Lampka K, Harwarth S and Siegle M. Can matrix-layout-independent numerical solvers be efficient?. Proceedings of the 2nd international conference on Performance evaluation methodologies and tools. (1-9).

    /doi/10.5555/1345263.1345364

  • Minato S. A theoretical study on variable ordering of zero-suppressed BDDs for representing frequent itemsets. Proceedings of the 10th international conference on Discovery science. (139-150).

    /doi/10.5555/1778942.1778958

  • Lhoták O, Curial S and Amaral J. Using ZBDDs in Points-to Analysis. Languages and Compilers for Parallel Computing. (338-352).

    https://doi.org/10.1007/978-3-540-85261-2_23

  • Jabir A, Pradhan D, Rajaprabhu T and Singh A. (2007). A Technique for Representing Multiple Output Binary Functions with Applications to Verification and Simulation. IEEE Transactions on Computers. 56:8. (1133-1145). Online publication date: 1-Aug-2007.

    https://doi.org/10.1109/TC.2007.1056

  • Kumar M and Tragoudas S. (2007). High-Quality Transition Fault ATPG for Small Delay Defects. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 26:5. (983-989). Online publication date: 1-May-2007.

    https://doi.org/10.1109/TCAD.2006.884863

  • Iwasaki H, Minato S and Zeugmann T. A Method of Variable Ordering for Zero-suppressed Binary Decision Diagrams in Data Mining Applications. Proceedings of the 2007 IEEE International Workshop on Databases for Next Generation Researchers. (85-90).

    https://doi.org/10.1109/SWOD.2007.353203

  • Dong C and Molitor P. What Graphs can be Efficiently Represented by BDDs?. Proceedings of the International Conference on Computing: Theory and Applications. (128-134).

    https://doi.org/10.1109/ICCTA.2007.133

  • Minato S, Satoh K and Sato T. Compiling Bayesian networks by symbolic probability calculation based on zero-suppressed BDDs. Proceedings of the 20th international joint conference on Artifical intelligence. (2550-2555).

    /doi/10.5555/1625275.1625686

  • Minato S and Arimura H. (2007). Frequent Closed Item Set Mining Based on Zero-suppressed BDDs. Transactions of the Japanese Society for Artificial Intelligence. 10.1527/tjsai.22.165. 22. (165-172).

    http://joi.jlc.jst.go.jp/JST.JSTAGE/tjsai/22.165?from=CrossRef

  • Minato S and Ito K. (2007). Symmetric Item Set Mining Method Using Zero-suppressed BDDs and Application to Biological Data. Transactions of the Japanese Society for Artificial Intelligence. 10.1527/tjsai.22.156. 22. (156-164).

    http://joi.jlc.jst.go.jp/JST.JSTAGE/tjsai/22.156?from=CrossRef

  • Minato S and Arimura H. Frequent Pattern Mining and Knowledge Indexing Based on Zero-Suppressed BDDs. Knowledge Discovery in Inductive Databases. 10.1007/978-3-540-75549-4_10. (152-169).

    http://link.springer.com/10.1007/978-3-540-75549-4_10

  • Minato S. A Theoretical Study on Variable Ordering of Zero-Suppressed BDDs for Representing Frequent Itemsets. Discovery Science. 10.1007/978-3-540-75488-6_14. (139-150).

    http://link.springer.com/10.1007/978-3-540-75488-6_14

  • Kurai R, Minato S and Zeugmann T. (2007). N-Gram Analysis Based on Zero-Suppressed BDDs. New Frontiers in Artificial Intelligence. 10.1007/978-3-540-69902-6_25. (289-300).

    https://link.springer.com/10.1007/978-3-540-69902-6_25

  • Binder W, Constantinescu I and Faltings B. Efficient Service Composition Using Zero-Suppressed Reduced Ordered Binary Decision Diagrams. Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence. (587-593).

    https://doi.org/10.1109/WI.2006.68

  • Randal E. Bryant . (1995). Verification of Arithmetic Circuits with Binary Moment Diagrams 32nd Design Automation Conference. 10.1109/DAC.1995.250005. 0-89791-653-0. (535-541).

    http://ieeexplore.ieee.org/document/1586761/

  • Tan S. Symbolic Analysis of Analog Circuits By Boolean Logic Operations. IEEE Transactions on Circuits and Systems II: Express Briefs. 10.1109/TCSII.2006.882356. 53:11. (1313-1317).

    http://ieeexplore.ieee.org/document/4012404/

  • Kocan F and Gunes M. (2006). On the ZBDD-based nonenumerative path delay fault coverage calculation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 24:7. (1137-1143). Online publication date: 1-Nov-2006.

    https://doi.org/10.1109/TCAD.2005.850851

  • Mishchenko A. (2006). Fast computation of symmetries in Boolean functions. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 22:11. (1588-1593). Online publication date: 1-Nov-2006.

    https://doi.org/10.1109/TCAD.2003.818371

  • Padmanaban S and Tragoudas S. (2006). An implicit path-delay fault diagnosis methodology. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 22:10. (1399-1408). Online publication date: 1-Nov-2006.

    https://doi.org/10.1109/TCAD.2003.818132

  • Aloul F, Sierawski B and Sakallah K. (2006). Satometer. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 22:8. (995-1004). Online publication date: 1-Nov-2006.

    https://doi.org/10.1109/TCAD.2003.814960

  • Xu H, Rutenbar R and Sakallah K. (2006). sub-SAT. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 22:6. (814-820). Online publication date: 1-Nov-2006.

    https://doi.org/10.1109/TCAD.2003.811450

  • Padmanaban S, Michael M and Tragoudas S. (2006). Exact path delay fault coverage with fundamental ZBDD operations. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 22:3. (305-316). Online publication date: 1-Nov-2006.

    https://doi.org/10.1109/TCAD.2002.807891

  • Cordone R, Ferrandi F, Sciuto D and Calvo R. (2006). An efficient heuristic approach to solve the unate covering problem. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 20:12. (1377-1388). Online publication date: 1-Nov-2006.

    https://doi.org/10.1109/43.969431

  • Shi C and Tan X. (2006). Compact representation and efficient generation of s-expanded symbolic network functions for computer-aided analog circuit design. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 20:7. (813-827). Online publication date: 1-Nov-2006.

    https://doi.org/10.1109/43.930996

  • Strehl K and Thiele L. (2006). Interval diagrams for efficient symbolic verification of process networks. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 19:8. (939-956). Online publication date: 1-Nov-2006.

    https://doi.org/10.1109/43.856979

  • Meinel C, Somenzi F and Theobald T. (2006). Linear sifting of decision diagrams and its application in synthesis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 19:5. (521-533). Online publication date: 1-Nov-2006.

    https://doi.org/10.1109/43.845077

  • Shi C and Tan X. (2006). Canonical symbolic analysis of large analog circuits with determinant decision diagrams. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 19:1. (1-18). Online publication date: 1-Nov-2006.

    https://doi.org/10.1109/43.822616

  • Macii E, Pedram M and Somenzi F. (2006). High-level power modeling, estimation, and optimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 17:11. (1061-1079). Online publication date: 1-Nov-2006.

    https://doi.org/10.1109/43.736181

  • Drechsler R and Becker B. (2006). Ordered Kronecker functional decision diagrams-a data structure for representation and manipulation of Boolean functions. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 17:10. (965-973). Online publication date: 1-Nov-2006.

    https://doi.org/10.1109/43.728917

  • Kam T, Villa T, Brayton R and Angiovanni-Vincentelli A. (2006). Implicit computation of compatible sets for state minimization of ISFSMs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 16:7. (657-676). Online publication date: 1-Nov-2006.

    https://doi.org/10.1109/43.644029

  • Minato S. (2006). Fast factorization method for implicit cube set representation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 15:4. (377-384). Online publication date: 1-Nov-2006.

    https://doi.org/10.1109/43.494701

  • Radivojevic I and Brewer F. (2006). A new symbolic technique for control-dependent scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 15:1. (45-57). Online publication date: 1-Nov-2006.

    https://doi.org/10.1109/43.486271

  • Lampka K and Siegle M. Analysis of Markov reward models using zero-suppressed multi-terminal BDDs. Proceedings of the 1st international conference on Performance evaluation methodolgies and tools. (35-es).

    https://doi.org/10.1145/1190095.1190139

  • Minato S. Symmetric item set mining based on zero-suppressed BDDs. Proceedings of the 9th international conference on Discovery Science. (321-326).

    https://doi.org/10.1007/11893318_35

  • Christou K, Michael M and Tragoudas S. Implicit Critical PDF Test Generation with Maximal Test Efficiency. Proceedings of the 21st IEEE International Symposium on on Defect and Fault-Tolerance in VLSI Systems. (50-58).

    https://doi.org/10.1109/DFT.2006.34

  • Kumar M, Tragoudas S, Chakravarty S and Jayabharathi R. (2006). Exact At-speed Delay Fault Grading in Sequential Circuits 2006 IEEE International Test Conference. 10.1109/TEST.2006.297685. 1-4244-0291-3. (1-10).

    http://ieeexplore.ieee.org/document/4079363/

  • Minato S and Arimura H. Frequent pattern mining and knowledge indexing based on zero-suppressed BDDs. Proceedings of the 5th international conference on Knowledge discovery in inductive databases. (152-169).

    /doi/10.5555/1777194.1777206

  • Binder W, Constantinescu I and Faltings B. Scalable automated service composition using a compact directory digest. Proceedings of the 17th international conference on Database and Expert Systems Applications. (317-326).

    https://doi.org/10.1007/11827405_31

  • Lampka K, Siegle M and Walter M. An easy-to-use, efficient tool-chain to analyze the availability of telecommunication equipment. Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology. (35-50).

    /doi/10.5555/1757571.1757576

  • Loekito E and Bailey J. Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams. Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. (307-316).

    https://doi.org/10.1145/1150402.1150438

  • Kurai R, Minato S and Zeugmann T. N-gram analysis based on zero-suppressed BDDs. Proceedings of the 20th annual conference on New frontiers in artificial intelligence. (289-300).

    /doi/10.5555/1761528.1761556

  • Zhang J, Chrzanowska-Jeske M, Mishchenko A and Burch J. (2006). Linear cofactor relationships in Boolean functions. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 25:6. (1011-1023). Online publication date: 1-Jun-2006.

    https://doi.org/10.1109/TCAD.2005.855951

  • Assaf T and Dugan J. (2006). On-board Diagnostic Expert System via an Enhanced Fault Tree Model SAE 2006 World Congress & Exhibition. 10.4271/2006-01-1567. .

    http://papers.sae.org/2006-01-1567/

  • Padmanaban S and Tragoudas S. (2006). Implicit grading of multiple path delay faults. ACM Transactions on Design Automation of Electronic Systems. 11:2. (346-361). Online publication date: 1-Apr-2006.

    https://doi.org/10.1145/1142155.1142160

  • Bernasconi A, Ciriani V, Drechsler R and Villa T. Efficient minimization of fully testable 2-SPP networks. Proceedings of the conference on Design, automation and test in Europe: Proceedings. (1300-1305).

    /doi/10.5555/1131481.1131839

  • Minato S. Efficient database analysis using VSOP calculator based on zero-suppressed BDDs. Proceedings of the 2005 international conference on New Frontiers in Artificial Intelligence. (169-181).

    https://doi.org/10.1007/11780496_20

  • Yoon S, Benini L and DeMicheli G. (2006). A Pattern-Mining Method for High-Throughput Lab-on-a-Chip Data Analysis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 25:2. (358-377). Online publication date: 1-Feb-2006.

    https://doi.org/10.1109/TCAD.2005.855960

  • Kettle N and King A. An anytime symmetry detection algorithm for ROBDDs. Proceedings of the 2006 Asia and South Pacific Design Automation Conference. (243-248).

    https://doi.org/10.1145/1118299.1118364

  • Bernasconi A, Ciriani V, Drechsler R and Villa T. (2006). Efficient Minimization of Fully Testable 2-SPP Networks 2006 Design, Automation and Test in Europe. 10.1109/DATE.2006.244121. 3-9810801-1-4. (1-6).

    http://ieeexplore.ieee.org/document/1657095/

  • Kettle N and King A. An anytime symmetry detection algorithm for ROBDDs Asia and South Pacific Conference on Design Automation, 2006.. 10.1109/ASPDAC.2006.1594689. 0-7803-9451-8. (243-248).

    http://ieeexplore.ieee.org/document/1594689/

  • Yoon S, Benini L and De Micheli G. A PATTERN-MINING METHOD FOR HIGH-THROUGHPUT LAB-ON-A-CHIP DATA ANALYSIS. Design Automation Methods and Tools for Microfluidics-Based Biochips. 10.1007/1-4020-5123-9_14. (357-400).

    http://link.springer.com/10.1007/1-4020-5123-9_14

  • Design and Verification of Digital Systems. Scalable Hardware Verification with Symbolic Simulation. 10.1007/0-387-29906-8_2. (7-33).

    http://link.springer.com/10.1007/0-387-29906-8_2

  • Chandrasekar K and Hsiao M. State Set Management for SAT-based Unbounded Model Checking. Proceedings of the 2005 International Conference on Computer Design. (585-590).

    https://doi.org/10.1109/ICCD.2005.99

  • 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.

    https://doi.org/10.1109/TCBB.2005.55

  • Zhang L. On subsumption removal and on-the-fly CNF simplification. Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing. (482-489).

    https://doi.org/10.1007/11499107_42

  • Babić D, Bingham J and Hu A. Efficient SAT solving. Proceedings of the 42nd annual Design Automation Conference. (744-749).

    https://doi.org/10.1145/1065579.1065774

  • Motter D, Roy J and Markov I. (2005). Resolution cannot polynomially simulate compressed-BFS. Annals of Mathematics and Artificial Intelligence. 44:1-2. (121-156). Online publication date: 1-May-2005.

    https://doi.org/10.1007/s10472-004-8427-2

  • Minato S. VSOP (valued-sum-of-products) calculator for knowledge processing based on zero-suppressed BDDs. Proceedings of the 2005 international conference on Federation over the Web. (40-58).

    https://doi.org/10.1007/11605126_3

  • Chandrasekar K and Hsiao M. Forward image computation with backtracing ATPG and incremental state-set construction. Proceedings of the 15th ACM Great Lakes symposium on VLSI. (254-259).

    https://doi.org/10.1145/1057661.1057723

  • Wang K and Chen J. K-disjointness paradigm with application to symmetry detection for incompletely specified functions. Proceedings of the 2005 Asia and South Pacific Design Automation Conference. (994-997).

    https://doi.org/10.1145/1120725.1120775

  • Minato S and Arimura H. Efficient Method of Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs International Workshop on Challenges in Web Information Retrieval and Integration. 10.1109/WIRI.2005.15. 0-7695-2414-1. (4-11).

    http://ieeexplore.ieee.org/document/1552989/

  • Babic D, Bingham J and Hu A. (2005). Efficient SAT solving: beyond supercubes 2005 42nd Design Automation Conference. 10.1109/DAC.2005.193910. 1-59593-058-2. (744-749).

    http://ieeexplore.ieee.org/document/1510430/

  • Zhenyu Qi , Tan S and Pu Liu . Efficient Analog Circuit Modeling By Boolean Logic Operations BMAS 2005. 2005 IEEE International Behavioral Modeling and Simulation Workshop, 2005.. 10.1109/BMAS.2005.1518191. 0-7803-9352-X. (76-81).

    http://ieeexplore.ieee.org/document/1518191/

  • Kuo-Hua Wang and Jia-Hung Chen . K-disjointness paradigm with application to symmetry detection for incompletely specified functions ASP-DAC 2005. Asia and South Pacific Design Automation Conference 2005. 10.1109/ASPDAC.2005.1466507. 0-7803-8736-8. (994-997).

    http://ieeexplore.ieee.org/document/1466507/

  • 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).

    https://doi.org/10.1007/978-3-540-30549-1_59

  • Huang J and Darwiche A. Toward Good Elimination Orders for Symbolic SAT Solving. Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence. (566-573).

    https://doi.org/10.1109/ICTAI.2004.115

  • Gröpl C, Jürgen Prömel H and Srivastav A. (2004). Ordered binary decision diagrams and the Shannon effect. Discrete Applied Mathematics. 10.1016/j.dam.2003.02.003. 142:1-3. (67-85). Online publication date: 1-Aug-2004.

    http://linkinghub.elsevier.com/retrieve/pii/S0166218X0400054X

  • McAllester D, Collins M and Pereira F. Case-factor diagrams for structured probabilistic modeling. Proceedings of the 20th conference on Uncertainty in artificial intelligence. (382-391).

    /doi/10.5555/1036843.1036890

  • Lhoták O and Hendren L. (2004). Jedd. ACM SIGPLAN Notices. 39:6. (158-169). Online publication date: 9-Jun-2004.

    https://doi.org/10.1145/996893.996861

  • Lhoták O and Hendren L. Jedd. Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation. (158-169).

    https://doi.org/10.1145/996841.996861

  • Jin H and Somenzi F. CirCUs. Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing. (211-223).

    https://doi.org/10.1007/11527695_17

  • Zhihua Tang and Dugan J. Minimal cut set/sequence generation for dynamic fault trees Annual Symposium Reliability and Maintainability, 2004 - RAMS. 10.1109/RAMS.2004.1285449. 0-7803-8215-3. (207-213).

    http://ieeexplore.ieee.org/document/1285449/

  • Kocan F, Gunes M and Thornton M. Static variable ordering in ZBDDs for path delay fault coverage calculation The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.. 10.1109/MWSCAS.2004.1354036. 0-7803-8346-X. (1_497-1_500).

    http://ieeexplore.ieee.org/document/1354036/

  • Yoon S and De Micheli G. An application of zero-suppressed binary decision diagrams to clustering analysis of DNA microarray data 26th Annual International Conference of the IEEE Engineering in Medicine and Biology Society. 10.1109/IEMBS.2004.1403831. 0-7803-8439-3. (2925-2928).

    http://ieeexplore.ieee.org/document/1403831/

  • Clarisó R and Cortadella J. (2004). The Octahedron Abstract Domain. Static Analysis. 10.1007/978-3-540-27864-1_23. (312-327).

    http://link.springer.com/10.1007/978-3-540-27864-1_23

  • Cabodi G and Quer S. Advancements in Mixed BDD and SAT Techniques. Advanced Formal Verification. 10.1007/1-4020-2530-0_2. (45-76).

    http://link.springer.com/10.1007/1-4020-2530-0_2

  • Plaisted D, Biere A and Zhu Y. (2003). A satisfiability procedure for quantified boolean formulae. Discrete Applied Mathematics. 130:2. (291-328). Online publication date: 15-Aug-2003.

    https://doi.org/10.1016/S0166-218X(02)00409-2

  • Li C. (2003). Equivalent literal propagation in the DLL procedure. Discrete Applied Mathematics. 130:2. (251-276). Online publication date: 15-Aug-2003.

    https://doi.org/10.1016/S0166-218X(02)00407-9

  • Rauzy A. (2003). Toward an efficient implementation of the MOCUS algorithm. IEEE Transactions on Reliability. 10.1109/TR.2003.813160. 52:2. (175-180). Online publication date: 1-Jun-2003.

    http://ieeexplore.ieee.org/document/1211108/

  • Minato S and Muroga S. (2003). Binary Decision Diagrams. Logic Design. 10.1201/9780203010150.ch4. (4-1-4-14). Online publication date: 19-Mar-2003.

    http://www.crcnetbase.com/doi/10.1201/9780203010150.ch4

  • Padmanaban S and Tragoudas S. Non-Enumerative Path Delay Fault Diagnosis. Proceedings of the conference on Design, Automation and Test in Europe - Volume 1.

    /doi/10.5555/789083.1022745

  • Fey G, Kinder S and Drechsler R. Using games for benchmarking and representing the complete solution space using symbolic techniques 33rd International Symposium on Multiple-Valued Logic, 2003.. 10.1109/ISMVL.2003.1201429. 0-7695-1918-0. (361-366).

    http://ieeexplore.ieee.org/document/1201429/

  • Padmanaban S and Tragoudas S. Non-enumerative path delay fault diagnosis [logic testing] 6th Design Automation and Test in Europe (DATE 03). 10.1109/DATE.2003.1253627. 0-7695-1870-2. (322-327).

    http://ieeexplore.ieee.org/document/1253627/

  • Mishchenko A and Brayton R. Simplification of non-deterministic multi-valued networks. Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design. (557-562).

    https://doi.org/10.1145/774572.774654

  • Aloul F, Sierawski B and Sakallah K. Satometer:. Proceedings of the 39th annual Design Automation Conference. (737-742).

    https://doi.org/10.1145/513918.514103

  • Xu H, Rutenbar R and Sakallah K. sub-SAT. Proceedings of the 2002 international symposium on Physical design. (182-187).

    https://doi.org/10.1145/505388.505432

  • Molinaro P, Delfieu D and Roux O. Improving the calculus of the marking graph of petri net with BDD like structure SMC2002: IEEE International Conference on Systems, Man and Cybernetics. 10.1109/ICSMC.2002.1167945. 0-7803-7437-1. (43-48).

    http://ieeexplore.ieee.org/document/1167945/

  • Mishchenko A and Brayton R. Simplification of non-deterministic multi-valued networks 2002 IEEE/ACM International Conference on Computer Aided Design (ICCAD). 10.1109/ICCAD.2002.1167587. 0-7803-7607-2. (557-562).

    http://ieeexplore.ieee.org/document/1167587/

  • Padmanaban S and Tragoudas S. Exact grading of multiple path delay faults 2002 Design, Automation and Test in Europe Conference and Exhibition. 10.1109/DATE.2002.998253. 0-7695-1471-5. (84-88).

    http://ieeexplore.ieee.org/document/998253/

  • Aloul F, Sierawski B and Sakallah K. (2002). Satometer: how much have we searched? Proceedings of 39th Design Automation Conference. 10.1109/DAC.2002.1012720. 1-58113-461-4. (737-742).

    http://ieeexplore.ieee.org/document/1012720/

  • Zhang L and Malik S. (2002). The Quest for Efficient Boolean Satisfiability Solvers. Computer Aided Verification. 10.1007/3-540-45657-0_2. (17-36).

    http://link.springer.com/10.1007/3-540-45657-0_2

  • Motter D and Markov I. (2002). A Compressed Breadth-First Search for Satisfiability. Algorithm Engineering and Experiments. 10.1007/3-540-45643-0_3. (29-42).

    http://link.springer.com/10.1007/3-540-45643-0_3

  • Zhang L and Malik S. (2002). The Quest for Efficient Boolean Satisfiability Solvers. Automated Deduction—CADE-18. 10.1007/3-540-45620-1_26. (295-313).

    http://link.springer.com/10.1007/3-540-45620-1_26

  • Williams P. (2001). Formal Verification based on Boolean Expression Diagrams. Electronic Notes in Theoretical Computer Science. 10.1016/S1571-0661(04)00331-7. 56. (i-190). Online publication date: 1-Dec-2001.

    http://linkinghub.elsevier.com/retrieve/pii/S1571066104003317

  • Brayton R. The future of logic synthesis and verification. Logic Synthesis and Verification. (403-434).

    /doi/10.5555/566845.566860

  • Bryant R and Meinel C. Ordered binary decision diagrams. Logic Synthesis and Verification. (285-307).

    /doi/10.5555/566845.566856

  • Padmanaban S, Michael M and Tragoudas S. Exact Path Delay Grading with Fundamental BDD Operations. Proceedings of the 2001 IEEE International Test Conference.

    /doi/10.5555/839296.843769

  • Padmanaban S, Michael M and Tragoudas S. Exact path delay grading with fundamental BDD operations International Test Conference. 10.1109/TEST.2001.966684. 0-7803-7169-0. (642-651).

    http://ieeexplore.ieee.org/document/966684/

  • Manthe A and Shi C. Lower bound based DDD minimization for efficient symbolic circuit analysis 2001 International Conference on Computer Design. ICCD 2001. 10.1109/ICCD.2001.955054. 0-7695-1200-3. (374-379).

    http://ieeexplore.ieee.org/document/955054/

  • Geldenhuys J and Valmari A. (2001). Techniques for Smaller Intermediary BDDs. CONCUR 2001 — Concurrency Theory. 10.1007/3-540-44685-0_16. (233-247).

    http://link.springer.com/10.1007/3-540-44685-0_16

  • Ferreira R, Trullemans A, Costa J and Monteiro J. Probabilistic Bottom-Up RTL Power Estimation. Proceedings of the 1st International Symposium on Quality of Electronic Design.

    /doi/10.5555/850998.855863

  • Cordone R, Ferrandi F, Sciuto D and Calvo R. An efficient heuristic approach to solve the unate covering problem. Proceedings of the conference on Design, automation and test in Europe. (364-371).

    https://doi.org/10.1145/343647.343799

  • Chatalic P and Simon L. Multi-resolution on compressed sets of clauses Twelfth Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000. 10.1109/TAI.2000.889839. 0-7695-0909-6. (2-10).

    http://ieeexplore.ieee.org/document/889839/

  • Reis A, Prado A and Lubaszewski M. Testability properties of vertex precedent BDDs 13th Symposium on Integrated Circuits and Systems Design. 10.1109/SBCCI.2000.876002. 0-7695-0843-X. (15-20).

    http://ieeexplore.ieee.org/document/876002/

  • Ferreira R, Trullemans A, Costa J and Monteiro J. Probabilistic bottom-up RTL power estimation IEEE 2000 1st International Symposium on Quality Electronic Design. 10.1109/ISQED.2000.838916. 0-7695-0525-2. (439-446).

    http://ieeexplore.ieee.org/document/838916/

  • Cordone R, Ferrandi F, Sciuto D and Wolfler Calvo R. An efficient heuristic approach to solve the unate covering problem [logic minimisation] Meeting on Design Automation and Test in Europe. 10.1109/DATE.2000.840297. 0-7695-0537-6. (364-371).

    http://ieeexplore.ieee.org/document/840297/

  • Chatalic P and Simon L. (2000). ZRes: The Old Davis–Putnam Procedure Meets ZBDD. Automated Deduction - CADE-17. 10.1007/10721959_35. (449-454).

    http://link.springer.com/10.1007/10721959_35

  • MEINEL C and THEOBALD T. (1999). ORDERED BINARY DECISION DIAGRAMS AND THEIR SIGNIFICANCE IN COMPUTER-AIDED DESIGN OF VLSI CIRCUITS. Journal of Circuits, Systems and Computers. 10.1142/S0218126699000165. 09:03n04. (181-198). Online publication date: 1-Jun-1999.

    http://www.worldscientific.com/doi/abs/10.1142/S0218126699000165

  • Reffel F. (1999). BDD-Nodes Can Be More Expressive. Advances in Computing Science — ASIAN’99. 10.1007/3-540-46674-6_25. (294-307).

    http://link.springer.com/10.1007/3-540-46674-6_25

  • Schröer O and Wegener I. (1998). The Theory of Zero-Suppressed BDDs and the Number of Knight‘s Tours. Formal Methods in System Design. 13:3. (235-253). Online publication date: 1-Nov-1998.

    https://doi.org/10.1023/A:1008681625346

  • Wood R and Rutenbar R. (1998). FPGA routing and routability estimation via Boolean satisfiability. IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 6:2. (222-231). Online publication date: 1-Jun-1998.

    https://doi.org/10.1109/92.678873

  • Shi C and Brzozowski J. (1998). Cluster-cover. ACM Transactions on Design Automation of Electronic Systems. 3:1. (76-107). Online publication date: 1-Jan-1998.

    https://doi.org/10.1145/270580.270584

  • Bilinski K and Dagless E. Efficient approach to symbolic state exploration of complex parallel controllers 1998 International Conference on Application of Concurrency to System Design. 10.1109/CSD.1998.657546. 0-8186-8350-3. (132-142).

    http://ieeexplore.ieee.org/document/657546/

  • Theobald M and Nowick S. An implicit method for hazard-free two-level logic minimization Fourth International Symposium on Advanced Research in Asynchronous Circuits and Systems. 10.1109/ASYNC.1998.666494. 0-8186-8392-9. (58-69).

    http://ieeexplore.ieee.org/document/666494/

  • Stankovic R and Sasao T. Decision diagrams for discrete functions: classification and unified interpretation 1998 Asia and South Pacific Design Automation Conference. 10.1109/ASPDAC.1998.669518. 0-7803-4425-1. (439-446).

    http://ieeexplore.ieee.org/document/669518/

  • Meinel C, Somenzi F and Theobald T. Function decomposition and synthesis using linear sifting 1998 Asia and South Pacific Design Automation Conference. 10.1109/ASPDAC.1998.669410. 0-7803-4425-1. (81-86).

    http://ieeexplore.ieee.org/document/669410/

  • Gröpl C, Prömel H and Srivastav A. (1998). Size and structure of random ordered binary decision diagrams. STACS 98. 10.1007/BFb0028565. (238-248).

    http://link.springer.com/10.1007/BFb0028565

  • Narayan A, Isles A, Jain J, Brayton R and Sangiovanni-Vincentelli A. Reachability analysis using partitioned-ROBDDs. Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design. (388-393).

    /doi/10.5555/266388.266513

  • Shi C and Tan X. Symbolic analysis of large analog circuits with determinant decision diagrams. Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design. (366-373).

    /doi/10.5555/266388.266510

  • Kumthekar B, Moon I and Somenzi F. A symbolic algorithm for low-power sequential synthesis. Proceedings of the 1997 international symposium on Low power electronics and design. (56-61).

    https://doi.org/10.1145/263272.263283

  • Benini L, De Micheli G, Macii E, Poncino M and Quer S. System-level power optimization of special purpose applications. Proceedings of the 1997 international symposium on Low power electronics and design. (24-29).

    https://doi.org/10.1145/263272.263277

  • Becker B, Drechsler R and Theobald M. (1997). On the Expressive Power of OKFDDs. Formal Methods in System Design. 11:1. (5-21). Online publication date: 1-Jul-1997.

    https://doi.org/10.1023/A:1008635324476

  • Macii E, Pedram M and Somenzi F. High-level power modeling, estimation, and optimization. Proceedings of the 34th annual Design Automation Conference. (504-511).

    https://doi.org/10.1145/266021.266268

  • Meinel C, Somenzi F and Theobald T. Linear sifting of decision diagrams. Proceedings of the 34th annual Design Automation Conference. (202-207).

    https://doi.org/10.1145/266021.266066

  • Coudert O. Solving Graph Optimization Problems with ZBDDs. Proceedings of the 1997 European conference on Design and Test.

    /doi/10.5555/787260.787671

  • Wood R and Rutenbar R. FPGA routing and routability estimation via Boolean satisfiability. Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays. (119-125).

    https://doi.org/10.1145/258305.258322

  • Becker B and Drechsler R. Decision Diagrams in Synthesis - Algorithms, Applications and Extensions. Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications.

    /doi/10.5555/523974.834854

  • Narayan A, Jain J, Fujita M and Sangiovanni-Vincentelli A. Partitioned ROBDDs—a compact, canonical and efficiently manipulable representation for Boolean functions. Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design. (547-554).

    /doi/10.5555/244522.244894

  • Hu A. Formal hardware verification with BDDs: an introduction 1997 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM. 10 Years Networking the Pacific Rim, 1987-1997. 10.1109/PACRIM.1997.620351. 0-7803-3905-3. (677-682).

    http://ieeexplore.ieee.org/document/620351/

  • Becker B and Drechsler R. Decision diagrams in synthesis-algorithms, applications and extensions Tenth International Conference on VLSI Design. 10.1109/ICVD.1997.567959. 0-8186-7755-4. (46-50).

    http://ieeexplore.ieee.org/document/567959/

  • Zhongcheng Li , Yuhong Zhao , Yinghua Min and Brayton R. Timed binary decision diagrams International Conference on Computer Design VLSI in Computers and Processors. 10.1109/ICCD.1997.628894. 0-8186-8206-X. (352-357).

    http://ieeexplore.ieee.org/document/628894/

  • Narayan , Isles , Jain , Brayton and Sangiovanni-Vincentelli . (1997). Reachability analysis using partitioned-ROBDDs Proceedings of IEEE International Conference on Computer Aided Design (ICCAD). 10.1109/ICCAD.1997.643565. 0-8186-8200-0. (388-393).

    http://ieeexplore.ieee.org/document/643565/

  • Shi and Xiangdong Tan . (1997). Symbolic analysis of large analog circuits with determinant decision diagrams Proceedings of IEEE International Conference on Computer Aided Design (ICCAD). 10.1109/ICCAD.1997.643562. 0-8186-8200-0. (366-373).

    http://ieeexplore.ieee.org/document/643562/

  • Coudert O. Solving graph optimization problems with ZBDDs European Design and Test Conference. ED & TC 97. 10.1109/EDTC.1997.582363. 0-8186-7786-4. (224-228).

    http://ieeexplore.ieee.org/document/582363/

  • Macii E, Pedram M and Somenzi F. High-level Power Modeling, Estimation, And Optimization 34th Design Automation Conference. 10.1109/DAC.1997.597199. 0-7803-4093-0. (504-511).

    http://ieeexplore.ieee.org/document/597199/

  • Meinel C, Somenzi F and Theobald T. Linear Sifting Of Decision Diagrams 34th Design Automation Conference. 10.1109/DAC.1997.597144. 0-7803-4093-0. (202-207).

    http://ieeexplore.ieee.org/document/597144/

  • Höreth S. (1997). Implementation of a Multiple-Domain Decision Diagram Package. Advances in Hardware Design and Verification. 10.1007/978-0-387-35190-2_12. (185-202).

    http://link.springer.com/10.1007/978-0-387-35190-2_12

  • Drechsler R, Theobald M and Becker B. (1996). Fast OFDD-Based Minimization of Fixed Polarity Reed-Muller Expressions. IEEE Transactions on Computers. 45:11. (1294-1299). Online publication date: 1-Nov-1996.

    https://doi.org/10.1109/12.544485

  • Stornetta T and Brewer F. Implementation of an efficient parallel BDD package. Proceedings of the 33rd annual Design Automation Conference. (641-644).

    https://doi.org/10.1145/240518.240639

  • Hansen J and Sekine M. Synthesis by spectral translation using Boolean decision diagrams. Proceedings of the 33rd annual Design Automation Conference. (248-253).

    https://doi.org/10.1145/240518.240564

  • Coudert O and Shi C. Exact dichotomy-based constrained encoding International Conference on Computer Design. VLSI in Computers and Processors. 10.1109/ICCD.1996.563589. 0-8186-7554-3. (426-431).

    http://ieeexplore.ieee.org/document/563589/

  • Bertacco V and Damiani M. Boolean function representation based on disjoint-support decompositions International Conference on Computer Design. VLSI in Computers and Processors. 10.1109/ICCD.1996.563527. 0-8186-7554-3. (27-32).

    http://ieeexplore.ieee.org/document/563527/

  • Narayan A, Jain J, Fujita M and Sangiovanni-Vincentelli A. Partitioned ROBDDs-a compact, canonical and efficiently manipulable representation for Boolean functions International Conference on Computer Aided Design. 10.1109/ICCAD.1996.569909. 0-8186-7597-7. (547-554).

    http://ieeexplore.ieee.org/document/569909/

  • Stornetta T and Brewer F. Implementation of an efficient parallel BDD package 33rd Design Automation Conference. 10.1109/DAC.1996.545653. 0-89791-779-0. (641-644).

    http://ieeexplore.ieee.org/document/545653/

  • Coudert O and Shi C. Exact multi-layer topological planar routing Custom Integrated Circuits Conference. 10.1109/CICC.1996.510538. 0-7803-3117-6. (179-182).

    http://ieeexplore.ieee.org/document/510538/

  • Yoneda T, Hatori H, Takahara A and Minato S. (1996). BDDs vs. Zero-Suppressed BDDs: for CTL symbolic model checking of Petri nets. Formal Methods in Computer-Aided Design. 10.1007/BFb0031826. (435-449).

    http://link.springer.com/10.1007/BFb0031826

  • Ravi K, Pardo A, Hachtel G and Somenzi F. (1996). Modular verification of multipliers. Formal Methods in Computer-Aided Design. 10.1007/BFb0031799. (49-63).

    http://link.springer.com/10.1007/BFb0031799

  • Hayase K and Imai H. (1996). OBDDs of a monotone function and of its prime implicants. Algorithms and Computation. 10.1007/BFb0009489. (136-145).

    http://link.springer.com/10.1007/BFb0009489

  • Bryant R. Binary decision diagrams and beyond. Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design. (236-243).

    /doi/10.5555/224841.225047

  • Panda S and Somenzi F. Who are the variables in your neighborhood. Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design. (74-77).

    /doi/10.5555/224841.224862

  • Minato S. Implicit manipulation of polynomials using zero-suppressed BDDs. Proceedings of the 1995 European conference on Design and Test.

    /doi/10.5555/787258.787474

  • Corno F, Prinetto P and Sonza Reorda M. Using symbolic techniques to find the maximum clique in very large sparse graphs. Proceedings of the 1995 European conference on Design and Test.

    /doi/10.5555/787258.787456

  • Radivojevic I and Brewer F. On applicability of symbolic techniques to larger scheduling problems. Proceedings of the 1995 European conference on Design and Test.

    /doi/10.5555/787258.787414

  • Coudert O. Doing two-level logic minimization 100 times faster. Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms. (112-121).

    /doi/10.5555/313651.313674

  • Bryant R and Chen Y. Verification of arithmetic circuits with binary moment diagrams. Proceedings of the 32nd annual ACM/IEEE Design Automation Conference. (535-541).

    https://doi.org/10.1145/217474.217583

  • Drechsler R and Becker B. Dynamic minimization of OKFDDs ICCD '95 International Conference on Computer Design. VLSI in Computers and Processors. 10.1109/ICCD.1995.528930. 0-8186-7165-3. (602-607).

    http://ieeexplore.ieee.org/document/528930/

  • Bryant R. Binary decision diagrams and beyond: enabling technologies for formal verification IEEE International Conference on Computer Aided Design (ICCAD). 10.1109/ICCAD.1995.480018. 0-8186-7213-7. (236-243).

    http://ieeexplore.ieee.org/document/480018/

  • Panda S and Somenzi F. Who are the variables in your neighbourhood IEEE International Conference on Computer Aided Design (ICCAD). 10.1109/ICCAD.1995.479994. 0-8186-7213-7. (74-77).

    http://ieeexplore.ieee.org/document/479994/

  • Poirot F, Tarroux G and Roane R. Optimization using implicit techniques for industrial designs Fifth Great Lakes Symposium on VLSI. 10.1109/GLSV.1995.516016. 0-8186-7035-5. (8-13).

    http://ieeexplore.ieee.org/document/516016/

  • Radivojevic I and Brewer F. On applicability of symbolic techniques to larger scheduling problems the European Design and Test Conference. ED&TC 1995. 10.1109/EDTC.1995.470421. 0-8186-7039-8. (48-53).

    http://ieeexplore.ieee.org/document/470421/

  • Corno F, Prinetto P and Sonza Reorda M. Using symbolic techniques to find the maximum clique in very large sparse graphs the European Design and Test Conference. ED&TC 1995. 10.1109/EDTC.1995.470377. 0-8186-7039-8. (320-324).

    http://ieeexplore.ieee.org/document/470377/

  • Minato S. Implicit manipulation of polynomials using zero-suppressed BDDs the European Design and Test Conference. ED&TC 1995. 10.1109/EDTC.1995.470321. 0-8186-7039-8. (449-454).

    http://ieeexplore.ieee.org/document/470321/

  • Ishihara S and Minato S. Manipulation of regular expressions under length constraints using zero-suppressed-BDDs ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair. 10.1109/ASPDAC.1995.486250. 4-930813-67-0. (391-396).

    http://ieeexplore.ieee.org/document/486250/

  • Panda S, Somenzi F and Plessier B. Symmetry detection and dynamic variable ordering of decision diagrams. Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design. (628-631).

    /doi/10.5555/191326.191598

  • Drechsler R, Becker B and Theobald M. Fast OFDD based minimization of fixed polarity Reed-Muller expressions. Proceedings of the conference on European design automation. (2-7).

    /doi/10.5555/198174.198179

  • Wang H and Brayton R. Permissible observability relations in FSM networks. Proceedings of the 31st annual Design Automation Conference. (677-683).

    https://doi.org/10.1145/196244.196613

  • Minato S. Calculation of unate cube set algebra using zero-suppressed BDDs. Proceedings of the 31st annual Design Automation Conference. (420-424).

    https://doi.org/10.1145/196244.196446

  • Becker B and Drechsler R. Efficient graph based representation of multi-valued functions with an application to genetic algorithms 24th International Symposium on Multiple-Valued Logic (ISMVL'94). 10.1109/ISMVL.1994.302218. 0-8186-5650-6. (65-72).

    http://ieeexplore.ieee.org/document/302218/

  • Panda S, Somenzi F and Plessier B. Symmetry Detection And Dynamic Variable IEEE/ACM International Conference on Computer-Aided Design. 10.1109/ICCAD.1994.629887. 0-8186-6417-7. (628-631).

    http://ieeexplore.ieee.org/document/629887/

  • Song G, Kowalczyk D and Leus R. The Robust Machine Availability Problem. SSRN Electronic Journal. 10.2139/ssrn.3052283.

    https://www.ssrn.com/abstract=3052283

  • Kowalczyk D and Leus R. A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching. SSRN Electronic Journal. 10.2139/ssrn.2887850.

    https://www.ssrn.com/abstract=2887850