| Sorting Balls and Water: Equivalence and Computational Complexity. | 0 | 0.34 | 2022 |
| Space and Power Reduction in BDD-based Optical Logic Circuits Exploiting Dual Ports | 0 | 0.34 | 2022 |
| Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams. | 0 | 0.34 | 2020 |
| Implicit Enumeration Of Topological-Minor-Embeddings And Its Application To Planar Subgraph Enumeration | 0 | 0.34 | 2020 |
| Designing Survivable Networks With Zero-Suppressed Binary Decision Diagrams | 0 | 0.34 | 2020 |
| Decomposing a Graph into Unigraphs. | 0 | 0.34 | 2019 |
| FPGA-Based QBoost with Large-Scale Annealing Processor and Accelerated Hyperparameter Search | 0 | 0.34 | 2018 |
| Fast packet classification algorithm for network-wide forwarding behaviors. | 1 | 0.36 | 2018 |
| Fast Enumeration Of All Pareto-Optimal Solutions For 0-1 Multi-Objective Knapsack Problems Using Zdds | 0 | 0.34 | 2018 |
| Frontier-Based Search For Enumerating All Constrained Subgraphs With Compressed Representation | 5 | 0.56 | 2017 |
| Dancing with Decision Diagrams: A Combined Approach to Exact Cover. | 0 | 0.34 | 2017 |
| Generating All Patterns Of Graph Partitions Within A Disparity Bound | 1 | 0.36 | 2017 |
| Bdd-Constrained A* Search: A Fast Method For Solving Constrained Shortest-Path Problems | 0 | 0.34 | 2017 |
| Verifying Scenarios Of Proximity-Based Federations Among Smart Objects Through Model Checking And Its Advantages | 0 | 0.34 | 2017 |
| Power Of Enumeration - Recent Topics On Bdd/Zdd-Based Techniques For Discrete Structure Manipulation | 0 | 0.34 | 2017 |
| Efficient Scenario Verification Of Proximity-Based Federations Among Smart Objects Through Symbolic Model Checking | 0 | 0.34 | 2017 |
| Compiling Graph Substructures into Sentential Decision Diagrams. | 3 | 0.41 | 2017 |
| Practical Adversarial Combinatorial Bandit Algorithm via Compression of Decision Sets. | 0 | 0.34 | 2017 |
| Statistical Emerging Pattern Mining with Multiple Testing Correction | 4 | 0.40 | 2017 |
| Using Pi Dds For Nearest Neighbor Optimization Of Quantum Circuits | 1 | 0.37 | 2016 |
| Power of Enumeration - BDD/ZDD-Based Techniques for Discrete Structure Manipulation. | 0 | 0.34 | 2016 |
| Zero-Suppressed Sentential Decision Diagrams. | 1 | 0.36 | 2016 |
| Graphillion: software library for very large sets of labeled graphs. | 7 | 0.51 | 2016 |
| A Dynamic Programming Algorithm for Tree Trimming-based Text Summarization. | 2 | 0.36 | 2015 |
| Bdd-Constrained Search: A Unified Approach To Constrained Shortest Path Problems | 2 | 0.40 | 2015 |
| Improved Algorithms For Debugging Problems On Erroneous Reversible Circuits | 0 | 0.34 | 2015 |
| Superset Generation on Decision Diagrams. | 0 | 0.34 | 2015 |
| Enumerating Eulerian Trails via Hamiltonian Path Enumeration. | 0 | 0.34 | 2015 |
| On the Size of the Zero-Suppressed Binary Decision Diagram that Represents All the Subtrees in a Tree. | 1 | 0.36 | 2014 |
| A Fast Method of Statistical Assessment for Combinatorial Hypotheses Based on Frequent Itemset Enumeration. | 12 | 0.83 | 2014 |
| Implicit Generation Of Pattern-Avoiding Permutations By Using Permutation Decision Diagrams | 0 | 0.34 | 2014 |
| DenseZDD: A Compact and Fast Index for Families of Sets | 1 | 0.36 | 2014 |
| Accelerating Graph Adjacency Matrix Multiplications with Adjacency Forest. | 1 | 0.37 | 2014 |
| Fast Regular Expression Matching Based On Dual Glushkov NFA. | 0 | 0.34 | 2014 |
| An Efficient Method for Indexing All Topological Orders of a Directed Graph. | 2 | 0.38 | 2014 |
| Three-way Indexing ZDDs for Large-Scale Sparse Datasets. | 0 | 0.34 | 2014 |
| A General Framework for Parallel Unary Operations on ZDDs. | 0 | 0.34 | 2014 |
| Shared-Memory Parallel Frontier-Based Search. | 0 | 0.34 | 2013 |
| Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets. | 0 | 0.34 | 2013 |
| Techniques Of Bdd/Zdd: Brief History And Recent Activity | 11 | 0.67 | 2013 |
| Techniques Of Bdd/Zdd: Brief History And Recent Activity | 11 | 0.67 | 2013 |
| Using πDDs in the Design of Reversible Circuits. | 1 | 0.35 | 2012 |
| A Dynamically Reconfigurable Fpga-Based Pattern Matching Hardware For Subclasses Of Regular Expressions | 1 | 0.35 | 2012 |
| On Tackling Flash Crowds With Url Shorteners And Examining User Behavior After Great East Japan Earthquake | 0 | 0.34 | 2012 |
| Synthesis of Semi-Classical Quantum Circuits. | 2 | 0.41 | 2012 |
| Incremental set recommendation based on class differences | 2 | 0.40 | 2012 |
| BDD-Based Combinatorial Keyword Query Processing under a Taxonomy Model. | 0 | 0.34 | 2012 |
| Finding All Solutions And Instances Of Numberlink And Slitherlink By Zdds | 11 | 0.67 | 2012 |
| Counterexamples to the long-standing conjecture on the complexity of BDD binary operations | 8 | 0.52 | 2012 |
| Compiling bayesian networks for parameter learning based on shared BDDs | 0 | 0.34 | 2011 |
