"Can a randomized binary search have an O(1) complexity at least in practice?"

Soubhik Chakraborty (2007)

> Home

Details and statistics

DOI: 10.1016/J.AMC.2006.12.079

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amc/Chakraborty07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amc/Chakraborty07
Soubhik Chakraborty:
Can a randomized binary search have an O(1) complexity at least in practice? Appl. Math. Comput. 189(2): 1884-1888 (2007)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.