New methods for using Cayley graphs in interconnection networks
Discrete Applied Mathematics - Special double volume: interconnection networks
Symbolic manipulation of Boolean functions using a graphical representation
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
Symbolic Model Checking
Twenty-six moves suffice for Rubik's cube
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
External perfect hashing for very large key sets
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Flash-Efficient LTL Model Checking with Minimal Counterexamples
SEFM '08 Proceedings of the 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods
Minimizing disk I/O in two-bit breadth-first search
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Simple and space-efficient minimal perfect hash functions
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Flash memory efficient LTL model checking
Science of Computer Programming
| Hi-index | 0.00 |
In this paper we design minimum perfect hash functions on the basis of BDDs that represent all reachable states S ⊆ {0, 1}n. These functions are one-to-one on S and can be evaluated quite efficiently. Such hash functions are useful to perform search in a bitvector representation of the state space. The time to compute the hash value with standard operations on the BDD G is (n|G|), the time to compute the inverse is O(n2|G|). When investing O(n) bits per node, we arrive at O(|G|) preprocessing time and optimal time O(n) for ranking and unranking.