![]() |
| 2007 | ||
|---|---|---|
| 9 | Chaiyasit Tayabovorn, Songrit Maneewongvatana: An Independent Reputation System for P2P Networks. ICEIS (4) 2007: 249-252 | |
| 2005 | ||
| 8 | EE | Eakalak Suthampan, Songrit Maneewongvatana: Privacy Preserving Decision Tree in Multi Party Environment. AIRS 2005: 727-732 |
| 2001 | ||
| 7 | EE | Songrit Maneewongvatana, David M. Mount: An Empirical Study of a New Approach to Nearest Neighbor Searching. ALENEX 2001: 172-187 |
| 6 | EE | Songrit Maneewongvatana, David M. Mount: On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions. International Conference on Computational Science (1) 2001: 842-851 |
| 5 | EE | Songrit Maneewongvatana, David M. Mount: The Analysis of a Probabilistic Approach to Nearest Neighbor Searching. WADS 2001: 276-286 |
| 1999 | ||
| 4 | EE | Jeffrey K. Hollingsworth, Songrit Maneewongvatana: Imprecise Calendars: an Approach to Scheduling Computational Grids. ICDCS 1999: 352-359 |
| 3 | Srinivas Aluru, Songrit Maneewongvatana: A Practical Parallel Algorithm for Line Segment Visibility. PDPTA 1999: 1676-1682 | |
| 2 | EE | Songrit Maneewongvatana, David M. Mount: Analysis of approximate nearest neighbor searching with clustered point sets CoRR cs.CG/9901013: (1999) |
| 1996 | ||
| 1 | Srinivas Aluru, Songrit Maneewongvatana: Practical Paralle1 Algorithm for Constructing Line Arrangements. PDPTA 1996: 125-135 | |
| 1 | Srinivas Aluru | [1] [3] |
| 2 | Jeffrey K. Hollingsworth | [4] |
| 3 | David M. Mount | [2] [5] [6] [7] |
| 4 | Eakalak Suthampan | [8] |
| 5 | Chaiyasit Tayabovorn | [9] |