Sandeep Sen

Publication Activity (10 Years)

Years Active: 1986-2021
Publications (10 Years): 13

Top Venues

CoRR

FSTTCS

DCC

SIAM J. Comput.

Publications

Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen
Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings. FSTTCS (2021)
Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen
Efficient algorithms for decode efficient prefix codes. DCC (2021)
Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen
Decode efficient prefix codes. CoRR (2020)
Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen
Decode-Efficient Prefix Codes for Hierarchical Memory Models. DCC (2020)
Sandeep Sen
A Unified Approach to Tail Estimates for Randomized Incremental Construction. STACS (2019)
Surender Baswana, Manoj Gupta, Sandeep Sen
Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected Version). SIAM J. Comput. 47 (3) (2018)
Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Sandeep Sen
On the streaming complexity of fundamental geometric problems. CoRR (2018)
Sandeep Sen
On tail estimates for Randomized Incremental Construction. CoRR (2018)
Rameshwar Pratap, Sandeep Sen
Faster Coreset Construction for Projective Clustering via Low-Rank Approximation. IWOCA (2018)
Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen
Improvable Knapsack Problems. CoRR (2016)
Manoj Gupta, Yogish Sabharwal, Sandeep Sen
The Update Complexity of Selection and Related Problems. Theory Comput. Syst. 59 (1) (2016)
Rameshwar Pratap, Sandeep Sen
Faster coreset construction for subspace and projective clustering. CoRR (2016)
Prasenjit Chakraborty, Preeti Ranjan Panda, Sandeep Sen
Partitioning and Data Mapping in Reconfigurable Cache and Scratchpad Memory-Based Architectures. ACM Trans. Design Autom. Electr. Syst. 22 (1) (2016)
Arijit Bishnu, Amit Chakrabarti, Subhas C. Nandy, Sandeep Sen
On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model. FSTTCS (2015)
Surender Baswana, Manoj Gupta, Sandeep Sen
Fully Dynamic Maximal Matching in O(log n) Update Time. SIAM J. Comput. 44 (1) (2015)
Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, Sandeep Sen
The robust knapsack problem with queries. Comput. Oper. Res. 55 (2015)
Dhiraj Madan, Sandeep Sen
Randomised Rounding with Applications. CoRR (2015)
Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen
Approximation Algorithms for the Weight-Reducible Knapsack Problem. TAMC (2014)
Debjyoti Saharoy, Sandeep Sen
Approximation Algorithms for Budget Constrained Network Upgradeable Problems. CoRR (2014)
Ragesh Jaiswal, Amit Kumar, Sandeep Sen
A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems. Algorithmica 70 (1) (2014)
Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs. FSTTCS (2012)
Subhas C. Nandy, Sandeep Sen
Preface. Theor. Comput. Sci. 442 (2012)
Ragesh Jaiswal, Amit Kumar, Sandeep Sen
A simple D^2-sampling based PTAS for k-means and other Clustering Problems CoRR (2012)
Neeraj Sharma, Sandeep Sen
Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model CoRR (2012)
Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs CoRR (2012)
Neeraj Sharma, Sandeep Sen
Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model. SPAA (2012)
Sandeep Sen, V. N. Muralidhara
The covert set-cover problem with application to Network Discovery CoRR (2012)
Ragesh Jaiswal, Amit Kumar, Sandeep Sen
A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems. COCOON (2012)
Surender Baswana, Manoj Gupta, Sandeep Sen
Fully Dynamic Maximal Matching in O (log n) Update Time. FOCS (2011)
Manoj Gupta, Yogish Sabharwal, Sandeep Sen
The update complexity of selection and related problems. FSTTCS (2011)
Surender Baswana, Manoj Gupta, Sandeep Sen
Fully dynamic maximal matching in O(log n) update time CoRR (2011)
Manoj Gupta, Yogish Sabharwal, Sandeep Sen
The update complexity of selection and related problems CoRR (2011)
Amit Kumar, Yogish Sabharwal, Sandeep Sen
Linear-time approximation schemes for clustering problems in any dimensions. J. ACM 57 (2) (2010)
Sandeep Sen, V. N. Muralidhara
The Covert Set-Cover Problem with Application to Network Discovery. WALCOM (2010)
Sandeep Sen
Approximating Shortest Paths in Graphs. WALCOM (2009)
V. N. Muralidhara, Sandeep Sen
Improvements on the Johnson bound for Reed-Solomon codes. Discret. Appl. Math. 157 (4) (2009)
Surender Baswana, Vishrut Goyal, Sandeep Sen
time. Theor. Comput. Sci. 410 (1) (2009)
Surender Baswana, Akshay Gaur, Sandeep Sen, Jayant Upadhyay
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error. ICALP (1) (2008)
Sanguthevar Rajasekaran, Sandeep Sen
Optimal and Practical Algorithms for Sorting on the PDM. IEEE Trans. Computers 57 (4) (2008)
Akshat Verma, Sandeep Sen
Combating I-O bottleneck using prefetching: model, algorithms, and ramifications. J. Supercomput. 45 (2) (2008)
V. N. Muralidhara, Sandeep Sen
A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography. INDOCRYPT (2007)
Surender Baswana, Ramesh Hariharan, Sandeep Sen
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. J. Algorithms 62 (2) (2007)
Surender Baswana, Sandeep Sen
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Struct. Algorithms 30 (4) (2007)
Pratik Worah, Sandeep Sen
A linear time deterministic algorithm to find a small subset that approximates the centroid. Inf. Process. Lett. 105 (1) (2007)
Surender Baswana, Sandeep Sen
) time. ACM Trans. Algorithms 2 (4) (2006)
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) (2006)
Akshat Verma, Sandeep Sen
Algorithmic Ramifications of Prefetching in Memory Hierarchy. HiPC (2006)
Amit Kumar, Yogish Sabharwal, Sandeep Sen
Linear Time Algorithms for Clustering Problems in Any Dimensions. ICALP (2005)
Sanguthevar Rajasekaran, Sandeep Sen
PDM Sorting Algorithms That Take A Small Number of Passes. IPDPS (2005)
Surender Baswana, Vishrut Goyal, Sandeep Sen
polylog n) Time. STACS (2005)
Sanguthevar Rajasekaran, Sandeep Sen
A Simple Optimal Randomized Algorithm for Sorting on the PDM. ISAAC (2005)
Sanguthevar Rajasekaran, Sandeep Sen
A generalization of the 0-1 principle for sorting. Inf. Process. Lett. 94 (1) (2005)
Yogish Sabharwal, Sandeep Sen
A linear time algorithm for approximate 2-means clustering. Comput. Geom. 32 (2) (2005)
Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey
Fair adaptive bandwidth allocation: a rate control based active queue management discipline. Comput. Networks 44 (2) (2004)
Surender Baswana, Sandeep Sen
) time. SODA (2004)
Amit Kumar, Yogish Sabharwal, Sandeep Sen
A Simple Linear Time (1+έ)-Approximation Algorithm for k-Means Clustering in Any Dimensions. FOCS (2004)
Surender Baswana, Sandeep Sen
) Size in Weighted Graphs. ICALP (2003)
Neelima Gupta, Sandeep Sen
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima. J. Parallel Distributed Comput. 63 (4) (2003)
Surender Baswana, Ramesh Hariharan, Sandeep Sen
Maintaining all-pairs approximate shortest paths under deletion of edges. SODA (2003)
Surender Baswana, Ramesh Hariharan, Sandeep Sen
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. STOC (2002)
Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey
Fair Adaptive Bandwidth Allocation: A Rate Control Based Active Queue Management Discipline. NETWORKING (2002)
Surender Baswana, Sandeep Sen
Planar Graph Blocking for External Searching. Algorithmica 34 (3) (2002)
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen
Improved Algorithms for Uniform Partitions of Points. Algorithmica 32 (4) (2002)
Yogish Sabharwal, Nishant Sharma, Sandeep Sen
Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions. FSTTCS (2002)
Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir
Towards a theory of cache-efficient algorithms. J. ACM 49 (6) (2002)
Neelima Gupta, Sandeep Sen
An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. Algorithmica 31 (2) (2001)
Neelima Gupta, Sumit Chopra, Sandeep Sen
Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel. FSTTCS (2001)
Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir
Towards a Theory of Cache-Efficient Algorithms CoRR (2000)
Surender Baswana, Sandeep Sen
Planar Graph Blocking for External Searching. FSTTCS (2000)
Siddhartha Chatterjee, Sandeep Sen
Cache-Efficient Matrix Transposition. HPCA (2000)
Sandeep Sen, Siddhartha Chatterjee
Towards a theory of cache-efficient algorithms. SODA (2000)
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) (2000)
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen
Output-Sensitive Algorithms for Uniform Partitions of Points. ISAAC (1999)
Sandeep Sen, Neelima Gupta
Distribution-Sensitive Algorithms. Nord. J. Comput. 6 (2) (1999)
Neelima Gupta, Sandeep Sen
An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. IPPS/SPDP (1998)
Sandeep Sen, Neelima Gupta
Distribution-Sensitive Algorithms. SWAT (1998)
Sandeep Sen
Lower Bounds for Parallel Algebraic Decision Trees, Parallel Complexity of Convex Hulls and Related Problems. Theor. Comput. Sci. 188 (1-2) (1997)
Binay K. Bhattacharya, Sandeep Sen
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm. J. Algorithms 25 (1) (1997)
Neelima Gupta, Sandeep Sen
Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel. Comput. Geom. 8 (1997)
Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen
Parallel Searching in Generalized Monge Arrays. Algorithmica 19 (3) (1997)
Pankaj K. Agarwal, Sandeep Sen
th Nearest Neighbors. J. Algorithms 20 (3) (1996)
Neelima Gupta, Sandeep Sen
<=3: Optimal Sublogarithmic Algorithms for Small Outputs. SCG (1996)
Sandeep Sen
Parallel Multidimensional Search Using Approximation Algorithms: With Applications to Linear-Programming and Related Problems. SPAA (1996)
Sandeep Sen
Fractional Cascading Revisited. J. Algorithms 19 (2) (1995)
Pankaj K. Agarwal, Sandeep Sen
Nearest Neighbors. SWAT (1994)
Sandeep Sen
Lower Bounds for Parallel Algebraic Decision Trees, Complexity of Convex Hulls and Related Problems. FSTTCS (1994)
John H. Reif, Sandeep Sen
Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. SIAM J. Comput. 23 (2) (1994)
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) (1994)
Yishay Mansour, James K. Park, Baruch Schieber, Sandeep Sen
Improved selection in totally monotone arrays. Int. J. Comput. Geom. Appl. 3 (2) (1993)
Sanguthevar Rajasekaran, Sandeep Sen
On Parallel Integer Sorting. Acta Informatica 29 (1) (1992)
Sandeep Sen
Fractional Cascading Simplified. SWAT (1992)
John H. Reif, Sandeep Sen
Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. SIAM J. Comput. 21 (3) (1992)
John H. Reif, Sandeep Sen
Optimal Randomized Parallel Algorithms for Computational Geometry. Algorithmica 7 (1) (1992)
Ketan Mulmuley, Sandeep Sen
Dynamic Point Location in Arrangement of Hyperplanes. Discret. Comput. Geom. 8 (1992)
Sandeep Sen
Some Observations on Skip-Lists. Inf. Process. Lett. 39 (4) (1991)
Ketan Mulmuley, Sandeep Sen
Dynamic Point Location in Arrangements of Hyperplanes. SCG (1991)
Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen
Parallel Searching in Generalized Monge Arrays with Applications. SPAA (1990)
Sandeep Sen
Finding an Approximate Median with High Probability in Constant Parallel Time. Inf. Process. Lett. 34 (2) (1990)
John H. Reif, Sandeep Sen
Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications. SPAA (1990)
John H. Reif, Sandeep Sen
Randomized Parallel Algorithms. IFIP Congress (1989)

Sandeep Sen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sandeep Sen