Using de Bruijn Sequences to Index a 1 in a Computer Word [1 citations — 1 self]
by Charles E. Leiserson, Harald Prokop, Keith H. Randall
ftp://theory.lcs.mit.edu/pub/cilk/debruijn.ps.gz
Add To MetaCart
Abstract:
Some computers provide an instruction to find the index of a 1 in a computer word, but many do not. This paper provides a fast and novel algorithm based on de Bruijn sequences to solve this problem. The algorithm involves little more than an integer multiply and a lookup in a small table. We compare the performance of our algorithm with other popular strategies that use table lookups or floating-point conversion. 1
Citations
| 5825 | Introduction to Algorithms – Cormen, Leiserson, et al. - 1992 |
| 124 | The implementation of the Cilk-5 multithreaded language – Frigo, Leiserson, et al. - 1998 |
| 3 | Creating a Chess Player – Frey, Atkin - 1979 |
| 1 | de Bruijn. A combinatorial problem – Nicolaas - 1946 |
| 1 | Pentium Pro Family Developer's – Corp - 1995 |
