Dynamic interpolation search revisited (Q2288214): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2019.104465 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2972161255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic interpolation search in o(log log n) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved behaviour of tries by adaptive branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight(er) worst-case bounds on dynamic searching and priority queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic ordered sets with exponential search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal bounds for the predecessor problem and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounded random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ubiquitous Digital Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Data Structures for the Dictionary Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surpassing the information theoretic bound with fusion trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic and complexity analysis of interpolation search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new data structure for representing sorted lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Interpolation Search Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for finger search on a RAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: A balanced search tree O(1) worst-case update time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4937698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic interpolation search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Brief History of Generative Models for Power Law and Lognormal Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental study of compression methods for dynamic tries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case optimal insertion and deletion methods for decomposable searching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space trade-offs for predecessor search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation search—a log log <i>N</i> search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding the complexity of interpolation search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation-binary search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special issue: Average-case analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of algorithms which require nonlinear time to maintain disjoint sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating a balanced search tree in 0(1) rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On RAM Priority Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving order in a forest in less than logarithmic time and linear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and implementation of an efficient priority queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log-logarithmic worst-case range queries are possible in space theta(N) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree / rank
 
Normal rank

Latest revision as of 11:20, 21 July 2024

scientific article
Language Label Description Also known as
English
Dynamic interpolation search revisited
scientific article

    Statements

    Dynamic interpolation search revisited (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 January 2020
    0 references
    interpolation search
    0 references
    dynamic predecessor search
    0 references
    dynamic search data structure
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers