Worst-case optimal insertion and deletion methods for decomposable searching problems (Q1152223): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / OpenAlex ID
 
Property / OpenAlex ID: W2083694582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposable searching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal dynamization of decomposable searching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamization of order decomposable set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3332258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two general methods for dynamizing decomposable searching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank

Latest revision as of 11:13, 13 June 2024

scientific article
Language Label Description Also known as
English
Worst-case optimal insertion and deletion methods for decomposable searching problems
scientific article

    Statements

    Worst-case optimal insertion and deletion methods for decomposable searching problems (English)
    0 references
    0 references
    0 references
    1981
    0 references
    range querying
    0 references
    nearest neighbor searching
    0 references

    Identifiers