Randomization yields simple 0(n log\* n) algorithms for difficult (n) problems

Olivier Devillers 1
1 PRISME - Geometry, Algorithms and Robotics
CRISAM - Inria Sophia Antipolis - Méditerranée
Résumé : Résumé disponible sur le PDF
Keywords : Randomized algorithms influence graphs conflict graph skeleton of a polyngon Delaunay triangulation Euclidean minimum spanning tree
Document type :
Reports
Complete list of metadatas
https://hal.inria.fr/inria-00075148
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 5:33:14 PM
Last modification on : Saturday, January 27, 2018 - 1:31:08 AM
Long-term archiving on: Sunday, April 4, 2010 - 9:47:09 PM

Files

RR-1412.pdf

Identifiers

  • HAL Id : inria-00075148, version 1

Collections

INRIA | INRIA-RRRT | LARA

Citation

Olivier Devillers. Randomization yields simple 0(n log\* n) algorithms for difficult (n) problems. [Research Report] RR-1412, INRIA. 1991, pp.15. ⟨inria-00075148⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

345

Files downloads

180

Contact


archive-ouverte@inria.fr