| Zero-suppressed BDDs for set manipulation in combinatorial problems S Minato Proceedings of the 30th International Design Automation Conference, 272-277, 1993 | 1221 | 1993 |
| Shared binary decision diagram with attributed edges for efficient Boolean function manipulation S Minato, N Ishiura, S Yajima Proceedings of the 27th ACM/IEEE design automation conference, 52-57, 1991 | 681 | 1991 |
| Binary decision diagrams and applications for VLSI CAD S Minato Springer Science & Business Media, 1995 | 363 | 1995 |
| Zero-suppressed BDDs and their applications S Minato International Journal on Software Tools for Technology Transfer 3 (2), 156-170, 2001 | 207 | 2001 |
| Frontier-based search for enumerating all constrained subgraphs with compressed representation J Kawahara, T Inoue, H Iwashita, S Minato IEICE Transactions on Fundamentals of Electronics, Communications and …, 2017 | 105 | 2017 |
| Decision diagrams and pass transistor logic synthesis V Bertacco, S Minato, P Verplaetse, L Benini, G De Micheli Int'l Workshop on Logic Synth 168, 1997 | 102 | 1997 |
| Distribution loss minimization with guaranteed error bound T Inoue, K Takano, T Watanabe, J Kawahara, R Yoshinaka, A Kishimoto, ... IEEE Transactions on Smart Grid 5 (1), 102-111, 2014 | 97 | 2014 |
| Graphillion: software library for very large sets of labeled graphs T Inoue, H Iwashita, J Kawahara, S Minato International Journal on Software Tools for Technology Transfer 18, 57-66, 2016 | 76 | 2016 |
| System and method for processing logic function and fault diagnosis using binary tree representation S Minato US Patent 5,493,504, 1996 | 76 | 1996 |
| Fast generation of irredundant sum-of-products forms from binary decision diagrams S Minato Proc. SASIMI'92, 64-73, 1992 | 72 | 1992 |
| Fast generation of prime-irredundant covers from binary decision diagrams S Minato IEICE transactions on fundamentals of electronics, communications and …, 1993 | 64 | 1993 |
| BDDs vs. Zero-Suppressed BDDs: for CTL symbolic model checking of petri nets T Yoneda, H Hatori, A Takahara, S Minato International Conference on Formal Methods in Computer-Aided Design, 435-449, 1996 | 58 | 1996 |
| A fast method of statistical assessment for combinatorial hypotheses based on frequent itemset enumeration S Minato, T Uno, K Tsuda, A Terada, J Sese Machine Learning and Knowledge Discovery in Databases: European Conference …, 2014 | 57 | 2014 |
| LCM over ZBDDs: Fast generation of very large-scale frequent itemsets using a compact graph-based representation S Minato, T Uno, H Arimura Advances in Knowledge Discovery and Data Mining: 12th Pacific-Asia …, 2008 | 57 | 2008 |
| Finding all solutions and instances of numberlink and slitherlink by ZDDs R Yoshinaka, T Saitoh, J Kawahara, K Tsuruma, H Iwashita, S Minato Algorithms 5 (20), 176-213, 2012 | 55 | 2012 |
| Propositionalizing the EM algorithm by BDDs M Ishihata, Y Kameya, T Sato, S Minato Transactions of the Japanese Society for Artificial Intelligence 25 (3), 475-484, 2010 | 54 | 2010 |
| Finding all simple disjunctive decompositions using irredundant sum-of-products forms S Minato, G De Micheli Proceedings of the 1998 IEEE/ACM international conference on Computer-aided …, 1998 | 54 | 1998 |
| Efficient top-down ZDD construction techniques using recursive specifications H Iwashita, S Minato Hokkaido University Division of Computer Science TCS Technical Report TCS-TR …, 2013 | 51 | 2013 |
| Graph-based representations of discrete functions S Minato Representations of Discrete Functions, 1-28, 1996 | 51 | 1996 |
| Evaluation of annual energy loss reduction based on reconfiguration scheduling Y Takenobu, N Yasuda, S Kawano, SI Minato, Y Hayashi IEEE Transactions on Smart Grid 9 (3), 1986-1996, 2016 | 47 | 2016 |
Jun KawaharaKyoto UniversityVerified email at i.kyoto-u.ac.jp