What the small Rubik’s cube taught me about data structures, information theory, and randomisation
Author:
- 16 February 2006
- journal article
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 8 (3) , 180-194
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Nearly Memory-Optimal Data Structure for Sets and Mappings2003
- Ranking and unranking permutations in linear timeInformation Processing Letters, 2001
- Techniques for Smaller Intermediary BDDs2001
- The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functionsIEEE Transactions on Computers, 1994
- On the OBDD-representation of general Boolean functionsIEEE Transactions on Computers, 1992
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- The Art of Computer Programming, Vol. 3: Sorting and SearchingMathematics of Computation, 1974