| 2011 |
|---|
| 16 | The update complexity of selection and related problems. Manoj Gupta, Yogish Sabharwal, Sandeep Sen. CoRR (abs/1108.5525) (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 15 | Linear-time approximation schemes for clustering problems in any dimensions. Amit Kumar, Yogish Sabharwal, Sandeep Sen. J. ACM (57) (2010). Web SearchBibTeXDownload |
| 2008 |
|---|
| 14 | Combating I-O bottleneck using prefetching: model, algorithms, and ramifications. Akshat Verma, Sandeep Sen. The Journal of Supercomputing (45): 205-235 (2008). Web SearchBibTeXDownload |
| 2006 |
|---|
| 13 | Algorithmic Ramifications of Prefetching in Memory Hierarchy. Akshat Verma, Sandeep Sen. HiPC 2006, 9-21. Web SearchBibTeXDownload |
| 12 | Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions. Yogish Sabharwal, Nishant Sharma, Sandeep Sen. J. Comput. Syst. Sci. (72): 955-977 (2006). Web SearchBibTeXDownload |
| 2005 |
|---|
| 11 | A linear time algorithm for approximate 2-means clustering. Yogish Sabharwal, Sandeep Sen. Comput. Geom. (32): 159-172 (2005). Web SearchBibTeXDownload |
| 10 | Linear Time Algorithms for Clustering Problems in Any Dimensions. Amit Kumar, Yogish Sabharwal, Sandeep Sen. ICALP 2005, 1374-1385. Web SearchBibTeXDownload |
| 2004 |
|---|
| 9 | A Simple Linear Time (1+ ) -Approximation Algorithm for k-Means Clustering in Any Dimensions. Amit Kumar, Yogish Sabharwal, Sandeep Sen. FOCS 2004, 454-462. Web SearchBibTeXDownload |
| 2002 |
|---|
| 8 | Improved Algorithms for Uniform Partitions of Points. Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen. Algorithmica (32): 521-539 (2002). Web SearchBibTeXDownload |
| 7 | Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions. Yogish Sabharwal, Nishant Sharma, Sandeep Sen. FSTTCS 2002, 311-323. Web SearchBibTeXDownload |
| 2001 |
|---|
| 6 | Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel. Neelima Gupta, Sumit Chopra, Sandeep Sen. FSTTCS 2001, 183-194. Web SearchBibTeXDownload |
| 1999 |
|---|
| 5 | Output-Sensitive Algorithms for Uniform Partitions of Points. Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen. ISAAC 1999, 403-414. Web SearchBibTeXDownload |
| 1996 |
|---|
| 4 | Selection in Monotone Matrices and Computing kth Nearest Neighbors. Pankaj K. Agarwal, Sandeep Sen. J. Algorithms (20): 581-601 (1996). Web SearchBibTeXDownload |
| 1994 |
|---|
| 3 | Selection in Monotone Matrices and Computing kth Nearest Neighbors. Pankaj K. Agarwal, Sandeep Sen. SWAT 1994, 13-24. Web SearchBibTeXDownload |
| 1989 |
|---|
| 2 | Two Nearly Optimal Sorting Algorithms for Mesh-Connected Processor Arrays Using Shear-Sort. Isaac D. Scherson, Sandeep Sen, Yiming Ma. J. Parallel Distrib. Comput. (6): 151-165 (1989). Web SearchBibTeXDownload |
| 1986 |
|---|
| 1 | The Distance Bound for Sorting on Mesh-Connected Processor Arrays Is Tight (Preliminary Report). Yiming Ma, Sandeep Sen, Isaac D. Scherson. FOCS 1986, 255-263. Web SearchBibTeXDownload |
