"Randomization yields simple O(n log* n) algorithms for ..."

Olivier Devillers (1992)

> Home

Details and statistics

DOI: 10.1142/S021819599200007X

access: closed

type: Journal Article

metadata version: 2020-06-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijcga/Devillers92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcga/Devillers92
Olivier Devillers:
Randomization yields simple O(n log^* n) algorithms for difficult Omega(n) problems. Int. J. Comput. Geom. Appl. 2(1): 97-111 (1992)

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.