Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Interpolation-binary search

From MaRDI portal
Publication:1062762
Jump to:navigation, search

DOI10.1016/0020-0190(85)90046-8zbMath0573.68031OpenAlexW1968801254MaRDI QIDQ1062762

Jeffrey B. Sidney, Nicola Santoro

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90046-8

zbMATH Keywords

searchingmultiple complexity objectiveordered array


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)


Related Items

Operations research applications of dichotomous search, Adaptive search over sorted sets, Analysis of recursive batched interpolation search, Dynamic interpolation search revisited, Batched interpolation searching on databases, Robust variations of interpolation search: An asymptotic analysis



Cites Work

  • The interpolation-sequential search algorithm
  • Understanding the complexity of interpolation search
  • An algorithmic and complexity analysis of interpolation search
  • Interpolation search—a log log N search
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1062762&oldid=13072217"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 00:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki