| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ragesh Jaiswal, Amit Kumar, Sandeep Sen |
A simple D^2-sampling based PTAS for k-means and other Clustering Problems  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Sandeep Sen, V. N. Muralidhara |
The covert set-cover problem with application to Network Discovery |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Neeraj Sharma, Sandeep Sen |
Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Surender Baswana, Manoj Gupta, Sandeep Sen |
Fully dynamic maximal matching in O(log n) update time |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Manoj Gupta, Yogish Sabharwal, Sandeep Sen |
The update complexity of selection and related problems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Surender Baswana, Manoj Gupta, Sandeep Sen |
Fully Dynamic Maximal Matching in O (log n) Update Time. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Manoj Gupta, Yogish Sabharwal, Sandeep Sen |
The update complexity of selection and related problems. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Kumar, Yogish Sabharwal, Sandeep Sen |
Linear-time approximation schemes for clustering problems in any dimensions. |
J. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen, V. N. Muralidhara |
The Covert Set-Cover Problem with Application to Network Discovery. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Vishrut Goyal, Sandeep Sen |
All-pairs nearly 2-approximate shortest paths in I time. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | V. N. Muralidhara, Sandeep Sen |
Improvements on the Johnson bound for Reed-Solomon codes. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen |
Approximating Shortest Paths in Graphs. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanguthevar Rajasekaran, Sandeep Sen |
Optimal and Practical Algorithms for Sorting on the PDM. |
IEEE Trans. Computers |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Akshat Verma, Sandeep Sen |
Combating I-O bottleneck using prefetching: model, algorithms, and ramifications. |
The Journal of Supercomputing |
2008 |
DBLP DOI BibTeX RDF |
Prediction sequence, Sorting, Prefetching, Memory hierarchy, External memory algorithms |
| 1 | Surender Baswana, Sandeep Sen |
Algorithms for Spanners in Weighted Graphs. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Akshay Gaur, Sandeep Sen, Jayant Upadhyay |
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pratik Worah, Sandeep Sen |
A linear time deterministic algorithm to find a small subset that approximates the centroid. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Sandeep Sen |
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. |
Random Struct. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. |
J. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | V. N. Muralidhara, Sandeep Sen |
A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography. |
INDOCRYPT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Sandeep Sen |
Approximate distance oracles for unweighted graphs in expected O(n2) time. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
Approximate distance oracles, distance queries, shortest paths, distances, spanners |
| 1 | Yogish Sabharwal, Nishant Sharma, Sandeep Sen |
Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Akshat Verma, Sandeep Sen |
Algorithmic Ramifications of Prefetching in Memory Hierarchy. |
HiPC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanguthevar Rajasekaran, Sandeep Sen |
A generalization of the 0-1 principle for sorting. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yogish Sabharwal, Sandeep Sen |
A linear time algorithm for approximate 2-means clustering. |
Comput. Geom. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Kumar, Yogish Sabharwal, Sandeep Sen |
Linear Time Algorithms for Clustering Problems in Any Dimensions. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanguthevar Rajasekaran, Sandeep Sen |
PDM Sorting Algorithms That Take A Small Number of Passes. |
IPDPS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Vishrut Goyal, Sandeep Sen |
All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanguthevar Rajasekaran, Sandeep Sen |
A Simple Optimal Randomized Algorithm for Sorting on the PDM. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramaswamy Ramanujam, Sandeep Sen (eds.) |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings |
FSTTCS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey |
Fair adaptive bandwidth allocation: a rate control based active queue management discipline. |
Computer Networks |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Sandeep Sen |
Approximate distance oracles for unweighted graphs in Õ(n2) time. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Kumar, Yogish Sabharwal, Sandeep Sen |
A Simple Linear Time (1+Î)-Approximation Algorithm for k-Means Clustering in Any Dimensions. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Neelima Gupta, Sandeep Sen |
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima. |
J. Parallel Distrib. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
Maintaining all-pairs approximate shortest paths under deletion of edges. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
Randomized algorithms, Shortest path, Graph algorithms |
| 1 | Surender Baswana, Sandeep Sen |
Planar Graph Blocking for External Searching. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen |
Improved Algorithms for Uniform Partitions of Points. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
Hashing, Random Sampling, Arrangements, Bucketing |
| 1 | Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir |
Towards a theory of cache-efficient algorithms. |
J. ACM |
2002 |
DBLP DOI BibTeX RDF |
I/O complexity, lower bound, Hierarchical memory |
| 1 | Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey |
Fair Adaptive Bandwidth Allocation: A Rate Control Based Active Queue Management Discipline. |
NETWORKING |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yogish Sabharwal, Nishant Sharma, Sandeep Sen |
Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions. |
FSTTCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
BFS tree, decremental, reachability |
| 1 | Neelima Gupta, Sandeep Sen |
An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
Parallel algorithms, Data structure, Terrain, Output-sensitive, Hidden surface elimination |
| 1 | Neelima Gupta, Sumit Chopra, Sandeep Sen |
Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel. |
FSTTCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir |
Towards a Theory of Cache-Efficient Algorithms |
CoRR |
2000 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Sandeep Sen |
Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen, Siddhartha Chatterjee |
Towards a theory of cache-efficient algorithms. |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Siddhartha Chatterjee, Sandeep Sen |
Cache-Efficient Matrix Transposition. |
HPCA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Sandeep Sen |
Planar Graph Blocking for External Searching. |
FSTTCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen, Neelima Gupta |
Distribution-Sensitive Algorithms. |
Nord. J. Comput. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen |
Output-Sensitive Algorithms for Uniform Partitions of Points. |
ISAAC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Neelima Gupta, Sandeep Sen |
An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. (PDF / PS) |
IPPS/SPDP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen, Neelima Gupta |
Distribution-Sensitive Algorithms. |
SWAT |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen |
Lower Bounds for Parallel Algebraic Decision Trees, Parallel Complexity of Convex Hulls and Related Problems. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen |
Parallel Searching in Generalized Monge Arrays. |
Algorithmica |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Binay K. Bhattacharya, Sandeep Sen |
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Neelima Gupta, Sandeep Sen |
Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel. |
Comput. Geom. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Sandeep Sen |
Selection in Monotone Matrices and Computing kth Nearest Neighbors. |
J. Algorithms |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Neelima Gupta, Sandeep Sen |
Faster Output-Sensitive Parallel Convex Hulls for d<=3: Optimal Sublogarithmic Algorithms for Small Outputs. |
Symposium on Computational Geometry |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen |
Parallel Multidimensional Search Using Approximation Algorithms: With Applications to Linear-Programming and Related Problems. |
SPAA |
1996 |
DBLP BibTeX RDF |
|
| 1 | Sandeep Sen |
Fractional Cascading Revisited. |
J. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | John H. Reif, Sandeep Sen |
Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. |
SIAM J. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | John H. Reif, Sandeep Sen |
Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications. |
SIAM J. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Sandeep Sen |
Selection in Monotone Matrices and Computing kth Nearest Neighbors. |
SWAT |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen |
Lower Bounds for Parallel Algebraic Decision Trees, Complexity of Convex Hulls and Related Problems. |
FSTTCS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Yishay Mansour, James K. Park, Baruch Schieber, Sandeep Sen |
Improved selection in totally monotone arrays. |
Int. J. Comput. Geometry Appl. |
1993 |
DBLP BibTeX RDF |
|
| 1 | Sanguthevar Rajasekaran, Sandeep Sen |
On Parallel Integer Sorting. |
Acta Inf. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | John H. Reif, Sandeep Sen |
Optimal Randomized Parallel Algorithms for Computational Geometry. |
Algorithmica |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Ketan Mulmuley, Sandeep Sen |
Dynamic Point Location in Arrangement of Hyperplanes. |
Discrete & Computational Geometry |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | John H. Reif, Sandeep Sen |
Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. |
SIAM J. Comput. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen |
Fractional Cascading Simplified. |
SWAT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen |
Some Observations on Skip-Lists. |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Ketan Mulmuley, Sandeep Sen |
Dynamic Point Location in Arrangements of Hyperplanes. |
Symposium on Computational Geometry |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen |
Finding an Approximate Median with High Probability in Constant Parallel Time. |
Inf. Process. Lett. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | John H. Reif, Sandeep Sen |
Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications. |
SPAA |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen |
Parallel Searching in Generalized Monge Arrays with Applications. |
SPAA |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Isaac D. Scherson, Sandeep Sen |
Parallel Sorting in Two-Dimensional VLSI Models of Computation. |
IEEE Trans. Computers |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Isaac D. Scherson, Sandeep Sen, Yiming Ma |
Two Nearly Optimal Sorting Algorithms for Mesh-Connected Processor Arrays Using Shear-Sort. |
J. Parallel Distrib. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | John H. Reif, Sandeep Sen |
Randomization in Parallel Algorithms and its Impact on Computational Geometry. |
Optimal Algorithms |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | John H. Reif, Sandeep Sen |
Randomized Parallel Algorithms. |
IFIP Congress |
1989 |
DBLP BibTeX RDF |
|
| 1 | John H. Reif, Sandeep Sen |
Polling: A New Randomized Sampling Technique for Computational Geometry |
STOC |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | John H. Reif, Sandeep Sen |
An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization. |
Symposium on Computational Geometry |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | John H. Reif, Sandeep Sen |
Optimal Randomized Parallel Algorithms for Computational Geometry. |
ICPP |
1987 |
DBLP BibTeX RDF |
|
| 1 | Sandeep Sen, Isaac D. Scherson, Adi Shamir |
Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks. |
ICPP |
1986 |
DBLP BibTeX RDF |
|
| 1 | Yiming Ma, Sandeep Sen, Isaac D. Scherson |
The Distance Bound for Sorting on Mesh-Connected Processor Arrays Is Tight (Preliminary Report) |
FOCS |
1986 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")