Robust variations of interpolation search: An asymptotic analysis
From MaRDI portal
Publication:809592
DOI10.1007/BF02238298zbMATH Open0733.68016OpenAlexW1574581085MaRDI QIDQ809592FDOQ809592
Publication date: 1991
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02238298
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The “Pegasus” method for computing the root of an equation
- Interpolation-binary search
- Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
- Random walks, Gaussian processes and list structures
- Brownian motion and algorithm complexity
- Notes on the derivation of asymptotic expressions from summations
- An improved pegasus method for root finding
- Robust variations of interpolation search: An asymptotic analysis
Cited In (2)
Uses Software
This page was built for publication: Robust variations of interpolation search: An asymptotic analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809592)
