RANDOM HYPERPLANE SEARCH TREES IN HIGH DIMENSIONS

DOI10.20382/JOCG.V6I1A6zbMATH Open1405.68412OpenAlexW2962954810MaRDI QIDQ2970418

Author name not available (Why is that?)

Publication date: 30 March 2017

Full work available at URL: https://arxiv.org/abs/1106.0461

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

A multivariate view of random bucket digital search trees ⋮ Tight bounds for deterministic high-dimensional grid exploration

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The random minimal spanning tree in high dimensions 👍 👎
• Randomized search trees 👍 👎
• Large hypertree width for sparse random hypergraphs 👍 👎
• Random Hyperplane Search Trees 👍 👎
• On the height of random m‐ary search trees 👍 👎
• Large Hypertree Width for Sparse Random Hypergraphs 👍 👎

This page was built for publication: RANDOM HYPERPLANE SEARCH TREES IN HIGH DIMENSIONS

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