"Efficient Randomized Incremental Algorithm For The Closest Pair Problem ..."

V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan (1995)

> Home

Details and statistics

DOI: 10.1007/BFB0030821

access: closed

type: Conference or Workshop Paper

metadata version: 2020-09-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoon/KamakotiKR95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/KamakotiKR95
V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan:
Efficient Randomized Incremental Algorithm For The Closest Pair Problem Using Leafary Trees. COCOON 1995: 71-80

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.