Robust variations of interpolation search: An asymptotic analysis
From MaRDI portal
Publication:809592
DOI10.1007/BF02238298zbMath0733.68016OpenAlexW1574581085MaRDI QIDQ809592
Publication date: 1991
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02238298
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust variations of interpolation search: An asymptotic analysis
- Interpolation-binary search
- Brownian motion and algorithm complexity
- Random walks, Gaussian processes and list structures
- Notes on the derivation of asymptotic expressions from summations
- Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
- The “Pegasus” method for computing the root of an equation
- An improved pegasus method for root finding
This page was built for publication: Robust variations of interpolation search: An asymptotic analysis
