Efficient randomized incremental algorithm for the closest pair problem using Leafary trees (Q6064016): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/bfb0030821 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bfb0030821 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1596775411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reliable Randomized Algorithm for the Closest-Pair Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Rabin's nearest-neighbor algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple randomized sieve algorithm for the closest-pair problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138743 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/BFB0030821 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:05, 30 December 2024

scientific article; zbMATH DE number 7776433
Language Label Description Also known as
English
Efficient randomized incremental algorithm for the closest pair problem using Leafary trees
scientific article; zbMATH DE number 7776433

    Statements

    Efficient randomized incremental algorithm for the closest pair problem using Leafary trees (English)
    0 references
    0 references
    0 references
    0 references
    12 December 2023
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references