On the public citation graph
An algorithmic and complexity analysis of interpolation search
0 signed · 85 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0020-0190(77)90028-xopenalex-snapshot
The interpolation-sequential search algorithm
inferredcites →https://doi.org/10.1016/0020-0190(77)90072-2openalex-snapshot
Understanding the complexity of interpolation search
inferredcites →https://doi.org/10.1016/0020-0190(78)90059-5openalex-snapshot
Notes on the derivation of symptotic expressions from summations
inferredcites →https://doi.org/10.1109/sfcs.1976.32openalex-snapshot
The complexity of searching an ordered random table
inferredcites →https://doi.org/10.1145/359545.359557openalex-snapshot
Interpolation search—a log log N search
inferredcites →https://doi.org/10.1147/rd.12.0130openalex-snapshot
Addressing for Random-Access Storage
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.2000.1138openalex-snapshot
Median Bounds and Their Application
inferred← citeshttps://doi.org/10.1007/11764298_13openalex-snapshot
Faster Adaptive Set Intersections for Text Searching
inferred← citeshttps://doi.org/10.1007/11786986_34openalex-snapshot
Dynamic Interpolation Search Revisited
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_48openalex-snapshot
Sampling algorithms for differential batch retrieval problems (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_3openalex-snapshot
An extrapolation on the interpolation search
inferred← citeshttps://doi.org/10.1007/978-1-349-21151-7_1openalex-snapshot
The Complexity of Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4612-5798-1_1openalex-snapshot
A Log Log N Search Algorithm for Nonuniform Distributions
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_31openalex-snapshot
Improved Bounds for Finger Search on a RAM
inferred← citeshttps://doi.org/10.1007/bf01952691openalex-snapshot
An adaptation of a root finding method to searching ordered disk files revisited
inferred← citeshttps://doi.org/10.1007/bf02238298openalex-snapshot
Robust variations of interpolation search: An asymptotic analysis
inferred← citeshttps://doi.org/10.1007/bfb0027506openalex-snapshot
A study of modified interpolation search in compressed, fully transposed, ordered files
inferred← citeshttps://doi.org/10.1007/s00453-012-9636-4openalex-snapshot
Improved Bounds for Finger Search on a RAM
inferred← citeshttps://doi.org/10.1007/s42044-023-00151-yopenalex-snapshot
Minimum average case time complexity for sorting algorithms
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90075-3openalex-snapshot
Log-logarithmic worst-case range queries are possible in space Θ(N)
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90046-8openalex-snapshot
Interpolation-binary search
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90005-6openalex-snapshot
Jump interpolation search trees and symmetric binary numbers
inferred← citeshttps://doi.org/10.1016/0020-0255(89)90013-3openalex-snapshot
Batched interpolation searching on databases
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90020-5openalex-snapshot
New trie data structures which support very fast search operations
inferred← citeshttps://doi.org/10.1016/0196-6774(84)90001-4openalex-snapshot
The analysis of linear probing sort by the use of a new mathematical transform
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90038-2openalex-snapshot
Parallel processing can be harmful: The unusual behavior of interpolation search
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90034-dopenalex-snapshot
A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
inferred← citeshttps://doi.org/10.1016/0898-1221(93)90329-topenalex-snapshot
Simulating interpolation search
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50014-xopenalex-snapshot
Average-Case Analysis of Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104465openalex-snapshot
Dynamic Interpolation Search revisited
inferred← citeshttps://doi.org/10.1016/j.jestch.2021.02.009openalex-snapshot
Interpolated binary search: An efficient hybrid search algorithm on ordered datasets
inferred← citeshttps://doi.org/10.1016/j.jss.2008.11.845openalex-snapshot
Dynamic Web Service discovery architecture based on a novel peer based overlay network
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80013-9openalex-snapshot
Implicit data structures for weighted elements
inferred← citeshttps://doi.org/10.1049/el.2019.1965openalex-snapshot
Optimal search algorithm in a big database using interpolation–extrapolation method
inferred← citeshttps://doi.org/10.1051/ita/1983170403651openalex-snapshot
The brownian motion : a neglected tool for the complexity analysis of sorted tables manipulation
inferred← citeshttps://doi.org/10.1080/00207160802132871openalex-snapshot
Two-way chaining for non-uniform distributions
inferred← citeshttps://doi.org/10.1108/02644400310467180openalex-snapshot
Fast search algorithms for look‐up tables
inferred← citeshttps://doi.org/10.1109/12.135562openalex-snapshot
Arithmetic interpolation search for alphabet tables
inferred← citeshttps://doi.org/10.1109/bicame45512.2018.1570506382openalex-snapshot
Towards Optimal Search: An Efficient Search Algorithm for Arabic Text using Secant Method
inferred← citeshttps://doi.org/10.1109/delcon54057.2022.9753537openalex-snapshot
Pattern Recognition Search: An Advancement Over Interpolation Search
inferred← citeshttps://doi.org/10.1109/elektro.2018.8398256openalex-snapshot
Common frequency extraction for bandpass sampling based frequency de-hopper
inferred← citeshttps://doi.org/10.1109/icbir61386.2024.10875849openalex-snapshot
Development of the APASIBI Application as an Interactive Learning Media for Speech and Deaf Children Using the Interpolation Search Algorithm
inferred← citeshttps://doi.org/10.1109/iccsit.2009.5234756openalex-snapshot
Research on Web service discovery based on domain ontology
inferred← citeshttps://doi.org/10.1109/icde.1987.7272350openalex-snapshot
Batched Interpolation Searching on databases
inferred← citeshttps://doi.org/10.1109/icdim.2007.369235openalex-snapshot
Does Knowledge about Search Domain Lead to More Efficient Search in Information Retrieval Applications?
inferred← citeshttps://doi.org/10.1109/icraie56454.2022.10054300openalex-snapshot
Contrasting Parallelized with Sequential Sorting
inferred← citeshttps://doi.org/10.1109/icycs.2008.465openalex-snapshot
Multiple-Choice Allocations with Fixed Densities
inferred← citeshttps://doi.org/10.1109/incet54531.2022.9824687openalex-snapshot
Validation of Minimal Worst-Case Time Complexity by Stirling’s, Ramanujan’s, and Mortici’s Approximation
inferred← citeshttps://doi.org/10.1109/silcon59133.2023.10405151openalex-snapshot
Plexus Search – A Search Enumeration
inferred← citeshttps://doi.org/10.1137/0214071openalex-snapshot
Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
inferred← citeshttps://doi.org/10.1145/102782.102786openalex-snapshot
Optimal sample cost residues for differential database batch query problems
inferred← citeshttps://doi.org/10.1145/182.358444openalex-snapshot
A constructive approach to the design of algorithms and their data structures
inferred← citeshttps://doi.org/10.1145/1877766.1877767openalex-snapshot
Efficient set intersection for inverted indexing
inferred← citeshttps://doi.org/10.1145/2911451.2911518openalex-snapshot
Leveraging Context-Free Grammar for Efficient Inverted Index Compression
inferred← citeshttps://doi.org/10.1145/322358.322364openalex-snapshot
Implicit Data Structures for the Dictionary Problem
inferred← citeshttps://doi.org/10.1145/3299869.3300075openalex-snapshot
Efficiently Searching In-Memory Sorted Arrays
inferred← citeshttps://doi.org/10.1145/3332466.3374542openalex-snapshot
Non-blocking interpolation search trees with doubly-logarithmic running time
inferred← citeshttps://doi.org/10.1145/5922.5923openalex-snapshot
Order-preserving key transformations
inferred← citeshttps://doi.org/10.1145/800076.802461openalex-snapshot
A linear probing sort and its analysis(Preliminary Draft)
inferred← citeshttps://doi.org/10.1504/ijwet.2008.016106openalex-snapshot
NBDT: an efficient P2P indexing scheme for web service discovery
inferred← citeshttps://doi.org/10.1515/eko-2016-0012openalex-snapshot
Assessing of landscape potential for water management regarding its surface water (using the example of the micro-region Minčol)
inferred← citeshttps://doi.org/10.21203/rs.3.rs-1754555/v1openalex-snapshot
Establishing pertinence between Sorting Algorithms prevailing in n log (n) time
inferred← citeshttps://doi.org/10.2139/ssrn.7194619openalex-snapshot
New clustering-based search algorithms
inferred← citeshttps://doi.org/10.2514/6.1995-3383openalex-snapshot
Flight simulation efforts in ChangGong-91 flight training device
inferred← citeshttps://doi.org/10.2514/6.1996-3516openalex-snapshot
A study of searching algorithms for real-time simulation of a dynamic system
inferred← citeshttps://doi.org/10.2514/6.2000-4392openalex-snapshot
Dynamic-window search for unevenly-spaced parameter tables
inferred← citeshttps://doi.org/10.33140/jrar.03.02.09openalex-snapshot
Establishing Pertinence between Sorting Algorithms Prevailing in n log(n) time
inferred← citeshttps://doi.org/10.47760/ijcsmc.2022.v11i03.014openalex-snapshot
A Unified Vista and Juxtaposed Study on Sorting Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1104.4353openalex-snapshot
Random input helps searching predecessors
inferred← citeshttps://doi.org/10.48550/arxiv.1708.00964openalex-snapshot
Efficient hybrid search algorithm on ordered datasets
inferred← citeshttps://doi.org/10.48550/arxiv.2001.00413openalex-snapshot
Analysis and Evaluation of Non-Blocking Interpolation Search Trees
inferred← citeshttps://doi.org/10.5120/ijca2016912584openalex-snapshot
Equipartition Search a New Algorithm for Searching
inferred← citeshttps://doi.org/10.5555/982792.982870openalex-snapshot
Interpolation search for non-independent data
inferred← citeshttps://doi.org/10.82308/45910openalex-snapshot
Two-way hashing with separate chaining and linear probing
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.