The following pages link to Sublinear Geometric Algorithms (Q5470705):
Displayed 8 items.
- Approximating the maximum overlap of polygons under translation (Q527417) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- Separating sublinear time computations by approximate diameter (Q849140) (← links)
- Practical distribution-sensitive point location in triangulations (Q2637075) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Testing Euclidean Spanners (Q4933382) (← links)
- Separating Sublinear Time Computations by Approximate Diameter (Q5505645) (← links)
- Recognizing the tractability in big data computing (Q5918820) (← links)