scientific article; zbMATH DE number 742952

MaRDI QIDQ4763393zbMATH OpenFDO

Authors K. Mehlhorn, Micha Sharir, Emo Welzl

Publication date 11 April 1995

zbMATH Keywords

randomized incremental algorithmsspace complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection
• A tail estimate for Mulmuley's segment intersection algorithm
• Four results on randomized incremental constructions
• Computing a Face in an Arrangement of Line Segments and Related Problems
• Four results on randomized incremental constructions

Cited in

(6)

• The entropy of backwards analysis
• Lower space bounds for randomized computation
• A unified approach to tail estimates for randomized incremental construction
• A tail estimate for Mulmuley's segment intersection algorithm
• On randomized sketching algorithms and the Tracy-Widom law
• Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763393)