Derandomization in Computational Geometry

DOI10.1006/JAGM.1996.0027MaRDI QIDQ4881408zbMATH OpenOpenAlexFDO

Authors Jiří Matoušek

Publication date 9 June 1996

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1996.0027

zbMATH Keywords

computational geometryrandomized algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited in

(4)

• scientific article; zbMATH DE number 431985 (Why is no real title available?)
• Deterministic Fault-Tolerant Connectivity Labeling Scheme
• Subquadratic algorithms for algebraic 3SUM
• RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS

This page was built for publication: Derandomization in Computational Geometry

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