Pages that link to "Item:Q1947974"
From MaRDI portal
The following pages link to On the power of the semi-separated pair decomposition (Q1947974):
Displaying 13 items.
- New constructions of SSPDs and their applications (Q419372) (← links)
- Closest-pair queries and minimum-weight queries are equivalent for squares (Q824331) (← links)
- Spanners for geodesic graphs and visibility graphs (Q1709579) (← links)
- Finding pairwise intersections inside a query range (Q1755743) (← links)
- Approximate range closest-pair queries (Q2206740) (← links)
- Closest-pair queries in fat rectangles (Q2331215) (← links)
- I/O-efficient well-separated pair decomposition and applications (Q2505500) (← links)
- New bounds for range closest-pair problems (Q2671166) (← links)
- On the Power of the Semi-Separated Pair Decomposition (Q3183436) (← links)
- (Q4782039) (← links)
- On the Power of the PPT Constraint in the Symmetric Extensions Test for Separability (Q5189232) (← links)
- Range closest-pair search in higher dimensions (Q5896868) (← links)
- On algorithmic complexity of imprecise spanners (Q6071451) (← links)