Login / Signup
A fast and vectorizable alternative to binary search in O(1) with wide applicability to arrays of floating point numbers.
Fabio Cannizzo
Published in:
J. Parallel Distributed Comput. (2018)
Keyphrases
</>
floating point
wide applicability
binary search
fixed point
square root
instruction set
sparse matrices
floating point arithmetic
fast fourier transform
interval arithmetic
three dimensional
frequency domain