N. S. Janaki Latha

According to our database, N. S. Janaki Latha authored at least 2 papers between 1997 and 1998.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1998

The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries.

Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

An optimal parallel algorithm for the all-nearest-foreign-neighbors problem in arbitrary dimensions.

Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan

Proceedings of the Fourth International on High-Performance Computing, 1997