The following pages link to Bernard Chazelle (Q525971):
Displaying 50 items.
- (Q194149) (redirect page) (← links)
- Well-posedness of the limiting equation of a noisy consensus model in opinion dynamics (Q525973) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Linear space data structures for two types of range search (Q578916) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q675296) (← links)
- How hard is half-space range searching? (Q685178) (← links)
- Diameter, width, closest line pair, and parametric searching (Q685180) (← links)
- A deterministic view of random sampling and its use in geometry (Q751816) (← links)
- Unbounded hardware is equivalent to deterministic Turing machines (Q789180) (← links)
- A decision procedure for optimal polyhedron partitioning (Q794166) (← links)
- Information theory in property testing and monotonicity testing in higher dimension (Q859828) (← links)
- Visibility and intersection problems in plane geometry (Q910213) (← links)
- Triangulating a nonconvex polytope (Q914375) (← links)
- Property-preserving data reconstruction (Q930593) (← links)
- Optimal solutions for a class of point retrieval problems (Q1062772) (← links)
- Halfspace range search: An algorithmic application of k-sets (Q1077166) (← links)
- Computing on a free tree via complexity-preserving mappings (Q1098314) (← links)
- Fractional cascading. I: A data structuring technique (Q1099957) (← links)
- Fractional cascading. II: Applications (Q1099958) (← links)
- Some techniques for geometric searching with implicit set representations (Q1101235) (← links)
- The complexity of cutting complexes (Q1115186) (← links)
- Parallel computational geometry (Q1115600) (← links)
- Points and triangles in the plane and halving planes in space (Q1176320) (← links)
- Triangulating a simple polygon in linear time (Q1176324) (← links)
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← links)
- Counting and cutting cycles of lines and rods in space (Q1194306) (← links)
- Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
- Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
- An optimal convex hull algorithm in any fixed dimension (Q1312190) (← links)
- Algorithms for bichromatic line-segment problems and polyhedral terrains (Q1314429) (← links)
- Point location among hyperplanes and unidirectional ray-shooting (Q1330461) (← links)
- Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
- Improved bounds on weak \(\varepsilon\)-nets for convex sets (Q1346122) (← links)
- Derandomizing an output-sensitive convex hull algorithm in three dimensions (Q1346251) (← links)
- Optimal slope selection via cuttings (Q1388130) (← links)
- The power of nonmonotonicity in geometric searching (Q1424314) (← links)
- Reporting and counting segment intersections (Q1821557) (← links)
- Quasi-optimal range searching in spaces of finite VC-dimension (Q1823698) (← links)
- Splitting a Delaunay triangulation in linear time (Q1849762) (← links)
- Lower bounds for intersection searching and fractional cascading in higher dimension (Q1887711) (← links)
- A reflective symmetry descriptor for 3D models (Q1889594) (← links)
- An elementary approach to lower bounds in geometric discrepancy (Q1892416) (← links)
- Bounds on the size of tetrahedralizations (Q1906047) (← links)
- Lines in space: Combinatorics and algorithms (Q1913699) (← links)
- Simplex range reporting on a pointer machine (Q1917035) (← links)
- Some observations on dynamic random walks and network renormalization (Q2291411) (← links)
- An algorithmic approach to collective behavior (Q2342054) (← links)
- Data structures on event graphs (Q2350906) (← links)
- Lower bounds for off-line range searching (Q2365324) (← links)
- Approximate range searching in higher dimension (Q2456663) (← links)
