| 2009 |
|---|
| 75 | EE | Sandeep Sen:
Approximating Shortest Paths in Graphs.
WALCOM 2009: 32-43 |
| 74 | EE | Surender Baswana,
Vishrut Goyal,
Sandeep Sen:
All-pairs nearly 2-approximate shortest paths in I time.
Theor. Comput. Sci. 410(1): 84-93 (2009) |
| 2008 |
|---|
| 73 | EE | Surender Baswana,
Akshay Gaur,
Sandeep Sen,
Jayant Upadhyay:
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error.
ICALP (1) 2008: 609-621 |
| 72 | EE | Surender Baswana,
Sandeep Sen:
Algorithms for Spanners in Weighted Graphs.
Encyclopedia of Algorithms 2008 |
| 71 | EE | Sanguthevar Rajasekaran,
Sandeep Sen:
Optimal and Practical Algorithms for Sorting on the PDM.
IEEE Trans. Computers 57(4): 547-561 (2008) |
| 70 | EE | Akshat Verma,
Sandeep Sen:
Combating I-O bottleneck using prefetching: model, algorithms, and ramifications.
The Journal of Supercomputing 45(2): 205-235 (2008) |
| 2007 |
|---|
| 69 | EE | V. N. Muralidhara,
Sandeep Sen:
A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography.
INDOCRYPT 2007: 48-57 |
| 68 | EE | Pratik Worah,
Sandeep Sen:
A linear time deterministic algorithm to find a small subset that approximates the centroid.
Inf. Process. Lett. 105(1): 17-19 (2007) |
| 67 | EE | Surender Baswana,
Ramesh Hariharan,
Sandeep Sen:
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.
J. Algorithms 62(2): 74-92 (2007) |
| 66 | EE | Surender Baswana,
Sandeep Sen:
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs.
Random Struct. Algorithms 30(4): 532-563 (2007) |
| 2006 |
|---|
| 65 | EE | Akshat Verma,
Sandeep Sen:
Algorithmic Ramifications of Prefetching in Memory Hierarchy.
HiPC 2006: 9-21 |
| 64 | EE | Surender Baswana,
Sandeep Sen:
Approximate distance oracles for unweighted graphs in expected O(n2) time.
ACM Transactions on Algorithms 2(4): 557-577 (2006) |
| 63 | EE | Yogish Sabharwal,
Nishant Sharma,
Sandeep Sen:
Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions.
J. Comput. Syst. Sci. 72(6): 955-977 (2006) |
| 2005 |
|---|
| 62 | | Ramaswamy Ramanujam,
Sandeep Sen:
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings
Springer 2005 |
| 61 | EE | Amit Kumar,
Yogish Sabharwal,
Sandeep Sen:
Linear Time Algorithms for Clustering Problems in Any Dimensions.
ICALP 2005: 1374-1385 |
| 60 | EE | Sanguthevar Rajasekaran,
Sandeep Sen:
PDM Sorting Algorithms That Take A Small Number of Passes.
IPDPS 2005 |
| 59 | EE | Sanguthevar Rajasekaran,
Sandeep Sen:
A Simple Optimal Randomized Algorithm for Sorting on the PDM.
ISAAC 2005: 543-552 |
| 58 | EE | Surender Baswana,
Vishrut Goyal,
Sandeep Sen:
All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time.
STACS 2005: 666-679 |
| 57 | EE | Yogish Sabharwal,
Sandeep Sen:
A linear time algorithm for approximate 2-means clustering.
Comput. Geom. 32(2): 159-172 (2005) |
| 56 | EE | Sanguthevar Rajasekaran,
Sandeep Sen:
A generalization of the 0-1 principle for sorting.
Inf. Process. Lett. 94(1): 43-47 (2005) |
| 2004 |
|---|
| 55 | EE | Amit Kumar,
Yogish Sabharwal,
Sandeep Sen:
A Simple Linear Time (1+ ) -Approximation Algorithm for k-Means Clustering in Any Dimensions.
FOCS 2004: 454-462 |
| 54 | EE | Surender Baswana,
Sandeep Sen:
Approximate distance oracles for unweighted graphs in Õ(n2) time.
SODA 2004: 271-280 |
| 53 | EE | Abhinav Kamra,
Huzur Saran,
Sandeep Sen,
Rajeev Shorey:
Fair adaptive bandwidth allocation: a rate control based active queue management discipline.
Computer Networks 44(2): 135-152 (2004) |
| 2003 |
|---|
| 52 | EE | Surender Baswana,
Sandeep Sen:
A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs.
ICALP 2003: 384-296 |
| 51 | EE | Surender Baswana,
Ramesh Hariharan,
Sandeep Sen:
Maintaining all-pairs approximate shortest paths under deletion of edges.
SODA 2003: 394-403 |
| 50 | EE | Neelima Gupta,
Sandeep Sen:
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima.
J. Parallel Distrib. Comput. 63(4): 488-500 (2003) |
| 2002 |
|---|
| 49 | EE | Yogish Sabharwal,
Nishant Sharma,
Sandeep Sen:
Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions.
FSTTCS 2002: 311-323 |
| 48 | EE | Abhinav Kamra,
Huzur Saran,
Sandeep Sen,
Rajeev Shorey:
Fair Adaptive Bandwidth Allocation: A Rate Control Based Active Queue Management Discipline.
NETWORKING 2002: 838-849 |
| 47 | EE | Surender Baswana,
Ramesh Hariharan,
Sandeep Sen:
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.
STOC 2002: 117-123 |
| 46 | EE | Pankaj K. Agarwal,
Binay K. Bhattacharya,
Sandeep Sen:
Improved Algorithms for Uniform Partitions of Points.
Algorithmica 32(4): 521-539 (2002) |
| 45 | EE | Surender Baswana,
Sandeep Sen:
Planar Graph Blocking for External Searching.
Algorithmica 34(3): 298-308 (2002) |
| 44 | EE | Sandeep Sen,
Siddhartha Chatterjee,
Neeraj Dumir:
Towards a theory of cache-efficient algorithms.
J. ACM 49(6): 828-858 (2002) |
| 2001 |
|---|
| 43 | EE | Neelima Gupta,
Sumit Chopra,
Sandeep Sen:
Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel.
FSTTCS 2001: 183-194 |
| 42 | EE | Neelima Gupta,
Sandeep Sen:
An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains.
Algorithmica 31(2): 179-207 (2001) |
| 2000 |
|---|
| 41 | EE | Surender Baswana,
Sandeep Sen:
Planar Graph Blocking for External Searching.
FSTTCS 2000: 252-263 |
| 40 | EE | Siddhartha Chatterjee,
Sandeep Sen:
Cache-Efficient Matrix Transposition.
HPCA 2000: 195-205 |
| 39 | EE | Sandeep Sen,
Siddhartha Chatterjee:
Towards a theory of cache-efficient algorithms.
SODA 2000: 829-838 |
| 38 | EE | Sandeep Sen,
Siddhartha Chatterjee,
Neeraj Dumir:
Towards a Theory of Cache-Efficient Algorithms
CoRR cs.AR/0010007: (2000) |
| 37 | EE | Martin E. Dyer,
Sandeep Sen:
Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems.
SIAM J. Comput. 30(5): 1443-1461 (2000) |
| 1999 |
|---|
| 36 | EE | Pankaj K. Agarwal,
Binay K. Bhattacharya,
Sandeep Sen:
Output-Sensitive Algorithms for Uniform Partitions of Points.
ISAAC 1999: 403-414 |
| 35 | | Sandeep Sen,
Neelima Gupta:
Distribution-Sensitive Algorithms.
Nord. J. Comput. 6(2): 194- (1999) |
| 1998 |
|---|
| 34 | EE | Neelima Gupta,
Sandeep Sen:
An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains.
IPPS/SPDP 1998: 215-219 |
| 33 | EE | Sandeep Sen,
Neelima Gupta:
Distribution-Sensitive Algorithms.
SWAT 1998: 335-346 |
| 1997 |
|---|
| 32 | | Alok Aggarwal,
Dina Kravets,
James K. Park,
Sandeep Sen:
Parallel Searching in Generalized Monge Arrays.
Algorithmica 19(3): 291-317 (1997) |
| 31 | | Neelima Gupta,
Sandeep Sen:
Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel.
Comput. Geom. 8: 151-166 (1997) |
| 30 | | Binay K. Bhattacharya,
Sandeep Sen:
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm.
J. Algorithms 25(1): 177-193 (1997) |
| 29 | EE | Sandeep Sen:
Lower Bounds for Parallel Algebraic Decision Trees, Parallel Complexity of Convex Hulls and Related Problems.
Theor. Comput. Sci. 188(1-2): 59-78 (1997) |
| 1996 |
|---|
| 28 | | Sandeep Sen:
Parallel Multidimensional Search Using Approximation Algorithms: With Applications to Linear-Programming and Related Problems.
SPAA 1996: 251-260 |
| 27 | EE | Neelima Gupta,
Sandeep Sen:
Faster Output-Sensitive Parallel Convex Hulls for d<=3: Optimal Sublogarithmic Algorithms for Small Outputs.
Symposium on Computational Geometry 1996: 176-185 |
| 26 | | Pankaj K. Agarwal,
Sandeep Sen:
Selection in Monotone Matrices and Computing kth Nearest Neighbors.
J. Algorithms 20(3): 581-601 (1996) |
| 1995 |
|---|
| 25 | | Sandeep Sen:
Fractional Cascading Revisited.
J. Algorithms 19(2): 161-172 (1995) |
| 1994 |
|---|
| 24 | | Sandeep Sen:
Lower Bounds for Parallel Algebraic Decision Trees, Complexity of Convex Hulls and Related Problems.
FSTTCS 1994: 193-204 |
| 23 | | Pankaj K. Agarwal,
Sandeep Sen:
Selection in Monotone Matrices and Computing kth Nearest Neighbors.
SWAT 1994: 13-24 |
| 22 | | John H. Reif,
Sandeep Sen:
Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems.
SIAM J. Comput. 23(2): 447-448 (1994) |
| 21 | | John H. Reif,
Sandeep Sen:
Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications.
SIAM J. Comput. 23(3): 633-651 (1994) |
| 1993 |
|---|
| 20 | | Yishay Mansour,
James K. Park,
Baruch Schieber,
Sandeep Sen:
Improved selection in totally monotone arrays.
Int. J. Comput. Geometry Appl. 3(2): 115-132 (1993) |
| 1992 |
|---|
| 19 | | Sandeep Sen:
Fractional Cascading Simplified.
SWAT 1992: 212-220 |
| 18 | | Sanguthevar Rajasekaran,
Sandeep Sen:
On Parallel Integer Sorting.
Acta Inf. 29(1): 1-15 (1992) |
| 17 | | John H. Reif,
Sandeep Sen:
Optimal Randomized Parallel Algorithms for Computational Geometry.
Algorithmica 7(1): 91-117 (1992) |
| 16 | | Ketan Mulmuley,
Sandeep Sen:
Dynamic Point Location in Arrangement of Hyperplanes.
Discrete & Computational Geometry 8: 335-360 (1992) |
| 15 | | John H. Reif,
Sandeep Sen:
Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems.
SIAM J. Comput. 21(3): 466-485 (1992) |
| 1991 |
|---|
| 14 | EE | Ketan Mulmuley,
Sandeep Sen:
Dynamic Point Location in Arrangements of Hyperplanes.
Symposium on Computational Geometry 1991: 132-141 |
| 13 | | Sandeep Sen:
Some Observations on Skip-Lists.
Inf. Process. Lett. 39(4): 173-176 (1991) |
| 1990 |
|---|
| 12 | EE | Alok Aggarwal,
Dina Kravets,
James K. Park,
Sandeep Sen:
Parallel Searching in Generalized Monge Arrays with Applications.
SPAA 1990: 259-268 |
| 11 | EE | John H. Reif,
Sandeep Sen:
Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications.
SPAA 1990: 327-339 |
| 10 | | Sandeep Sen:
Finding an Approximate Median with High Probability in Constant Parallel Time.
Inf. Process. Lett. 34(2): 77-80 (1990) |
| 1989 |
|---|
| 9 | | John H. Reif,
Sandeep Sen:
Randomized Parallel Algorithms.
IFIP Congress 1989: 455-458 |
| 8 | | John H. Reif,
Sandeep Sen:
Randomization in Parallel Algorithms and its Impact on Computational Geometry.
Optimal Algorithms 1989: 1-8 |
| 7 | | John H. Reif,
Sandeep Sen:
Polling: A New Randomized Sampling Technique for Computational Geometry
STOC 1989: 394-404 |
| 6 | | Isaac D. Scherson,
Sandeep Sen:
Parallel Sorting in Two-Dimensional VLSI Models of Computation.
IEEE Trans. Computers 38(2): 238-249 (1989) |
| 5 | | Isaac D. Scherson,
Sandeep Sen,
Yiming Ma:
Two Nearly Optimal Sorting Algorithms for Mesh-Connected Processor Arrays Using Shear-Sort.
J. Parallel Distrib. Comput. 6(1): 151-165 (1989) |
| 1988 |
|---|
| 4 | EE | John H. Reif,
Sandeep Sen:
An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization.
Symposium on Computational Geometry 1988: 193-200 |
| 1987 |
|---|
| 3 | | John H. Reif,
Sandeep Sen:
Optimal Randomized Parallel Algorithms for Computational Geometry.
ICPP 1987: 270-277 |
| 1986 |
|---|
| 2 | | Yiming Ma,
Sandeep Sen,
Isaac D. Scherson:
The Distance Bound for Sorting on Mesh-Connected Processor Arrays Is Tight (Preliminary Report)
FOCS 1986: 255-263 |
| 1 | | Sandeep Sen,
Isaac D. Scherson,
Adi Shamir:
Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks.
ICPP 1986: 903-908 |
