Pages that link to "Item:Q5375460"
From MaRDI portal
The following pages link to Mesh computer algorithms for computational geometry (Q5375460):
Displaying 8 items.
- Finite nondense point set analysis (Q686052) (← links)
- Geometric problems on two-dimensional array processors (Q1104746) (← links)
- On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors (Q1111382) (← links)
- Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers (Q1187199) (← links)
- Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers (Q1187201) (← links)
- On the parallel-decomposability of geometric problems (Q1194344) (← links)
- Towards optimal locality in mesh-indexings (Q1348392) (← links)
- Towards optimal locality in mesh-indexings (Q5055949) (← links)
