*{{Cite journal|last=Beame|first=Paul|last2=Fich|first2=Faith E.|date=2002-08-01|title=Optimal Bounds for the Predecessor Problem and Related Problems|url=http://www.sciencedirect.com/science/article/pii/S0022000002918222|journal=Journal of Computer and System Sciences|volume=65|issue=1|pages=38–72|doi=10.1006/jcss.2002.1822|doi-access=free|ref=harv}}
==External links==
{{Refbegin}}
*[[Wikiversity:Uninformed Search Project|Uninformed Search Project]] at the [[Wikiversity]].
*[http://sites.google.com/site/hantarto/quantum-computing/unsorted Unsorted Data Searching Using Modulated Database].
