Name: Fast and Vectorizable Alternative to Binary Search in O(1) Applicable to a Wide Domain of Sorted Arrays of Floating Point Numbers
Creator: Cannizzo, Fabio

Fast and Vectorizable Alternative to Binary Search in O(1) Applicable to a Wide Domain of Sorted Arrays of Floating Point Numbers

Preprint English OPEN

Cannizzo, Fabio;

(2015)

Related identifiers: doi: 10.1016/j.jpdc.2017.10.007
Subject: Computer Science - Data Structures and Algorithms

Given an array $X$ of $N+1$ strictly ordered floating point numbers and a floating point number $z$ in the interval $[X_0,X_N)$, a common problem is to find the index $i$ of the interval $[X_{i},X_{i+1})$ containing $z$. This problem arises for instance in the context o... View more

References (2)
[1] Press, Teukolsky, Vetterling, Flannery, Numerical Recipes in C, Section 3.3, 2nd edition, Cambridge University Press, 1992
[2] Pulver, Binary Search Revisited, http://eigenjoy.com/2011/09/09/binary-search-revisited/, 2011
Related Research Results (1)
Inferred by OpenAIRE
software
FastBinarySearch software on GitHub
72%
Similar Research Results (2)
other
Modeling cooperating micro-organisms in antibiotic environment (2017)
77%
publication
Simultaneous multithreaded vector architecture: merging ILP and DLP for high performance (1997)
70%
Metrics

Share - Bookmark

Download from
arXiv.org e-Print Archive via arXiv.org e-Print Archive (Preprint, 2015)
Cite this publication

other Modeling cooperating micro-organisms in antibiotic environment (2017)	77%
publication Simultaneous multithreaded vector architecture: merging ILP and DLP for high performance (1997)	70%