Pages that link to "Item:Q1917035"
From MaRDI portal
The following pages link to Simplex range reporting on a pointer machine (Q1917035):
Displaying 14 items.
- Optimal partition trees (Q420575) (← links)
- Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- Lower bounds for intersection searching and fractional cascading in higher dimension (Q1887711) (← links)
- Top tree compression of tries (Q2067669) (← links)
- Lower bounds for off-line range searching (Q2365324) (← links)
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems (Q2874595) (← links)
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems (Q2875643) (← links)
- (Q3467513) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- Polynomial Data Structure Lower Bounds in the Group Model (Q5067444) (← links)
- An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ<sup>3</sup> (Q5108270) (← links)
- On semialgebraic range reporting (Q6145667) (← links)
- Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions (Q6159411) (← links)