Untangled monotonic chains and adaptive range search (Q553358): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3146418440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The priority R-tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangled Monotonic Chains and Adaptive Range Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a sequence into few monotone subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional binary search trees used for associative searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional cascading. I: A data structuring technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum \(k\)-modal partitions of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum cocolorings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit data structures for fast search and update / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal range searching in linear and almost-linear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a set of points into chains, with applications to permutation and circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences / rank
 
Normal rank

Latest revision as of 07:54, 4 July 2024

scientific article
Language Label Description Also known as
English
Untangled monotonic chains and adaptive range search
scientific article

    Statements

    Untangled monotonic chains and adaptive range search (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 July 2011
    0 references
    adaptive
    0 references
    range search
    0 references
    range query
    0 references
    monotonic chain
    0 references
    untangling
    0 references
    implicit
    0 references
    data structure
    0 references
    computational geometry
    0 references

    Identifiers