Sandeep Sen

According to our database, Sandeep Sen authored at least 99 papers between 1986 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings.

Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Efficient algorithms for decode efficient prefix codes.

Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen

Proceedings of the 31st Data Compression Conference, 2021

2020

Decode efficient prefix codes.

Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen

CoRR, 2020

Decode-Efficient Prefix Codes for Hierarchical Memory Models.

Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen

Proceedings of the Data Compression Conference, 2020

2019

A Unified Approach to Tail Estimates for Randomized Incremental Construction.

Sandeep Sen

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018

Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected Version).

Surender Baswana, Manoj Gupta, Sandeep Sen

SIAM J. Comput., 2018

On tail estimates for Randomized Incremental Construction.

Sandeep Sen

CoRR, 2018

On the streaming complexity of fundamental geometric problems.

Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Sandeep Sen

CoRR, 2018

Faster Coreset Construction for Projective Clustering via Low-Rank Approximation.

Rameshwar Pratap, Sandeep Sen

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Approximate Clustering.

Ragesh Jaiswal, Sandeep Sen

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2016

Simple Algorithms for Spanners in Weighted Graphs.

Surender Baswana, Sandeep Sen

Encyclopedia of Algorithms, 2016

Matching in Dynamic Graphs.

Surender Baswana, Manoj Gupta, Sandeep Sen

Encyclopedia of Algorithms, 2016

Partitioning and Data Mapping in Reconfigurable Cache and Scratchpad Memory-Based Architectures.

Prasenjit Chakraborty, Preeti Ranjan Panda, Sandeep Sen

ACM Trans. Design Autom. Electr. Syst., 2016

The Update Complexity of Selection and Related Problems.

Manoj Gupta, Yogish Sabharwal, Sandeep Sen

Theory Comput. Syst., 2016

Faster coreset construction for subspace and projective clustering.

Rameshwar Pratap, Sandeep Sen

CoRR, 2016

Improvable Knapsack Problems.

Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen

CoRR, 2016

2015

Fully Dynamic Maximal Matching in O(log n) Update Time.

Surender Baswana, Manoj Gupta, Sandeep Sen

SIAM J. Comput., 2015

Randomised Rounding with Applications.

Dhiraj Madan, Sandeep Sen

CoRR, 2015

The robust knapsack problem with queries.

Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, Sandeep Sen

Comput. Oper. Res., 2015

On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model.

Arijit Bishnu, Amit Chakrabarti, Subhas C. Nandy, Sandeep Sen

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014

Approximation Algorithms for Budget Constrained Network Upgradeable Problems.

Debjyoti Saharoy, Sandeep Sen

CoRR, 2014

A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems.

Ragesh Jaiswal, Amit Kumar, Sandeep Sen

Algorithmica, 2014

Approximation Algorithms for the Weight-Reducible Knapsack Problem.

Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen

Proceedings of the Theory and Applications of Models of Computation, 2014

2012

Preface.

Subhas C. Nandy, Sandeep Sen

Theor. Comput. Sci., 2012

Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model

Neeraj Sharma, Sandeep Sen

CoRR, 2012

Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model.

Neeraj Sharma, Sandeep Sen

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs.

Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2010

Linear-time approximation schemes for clustering problems in any dimensions.

Amit Kumar, Yogish Sabharwal, Sandeep Sen

J. ACM, 2010

The Covert Set-Cover Problem with Application to Network Discovery.

Sandeep Sen, V. N. Muralidhara

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

2009

All-pairs nearly 2-approximate shortest paths in <i>I</i> time.

Surender Baswana, Vishrut Goyal, Sandeep Sen

Theor. Comput. Sci., 2009

Improvements on the Johnson bound for Reed-Solomon codes.

V. N. Muralidhara, Sandeep Sen

Discret. Appl. Math., 2009

Approximating Shortest Paths in Graphs.

Sandeep Sen

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

2008

Algorithms for Spanners in Weighted Graphs.

Surender Baswana, Sandeep Sen

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Combating I-O bottleneck using prefetching: model, algorithms, and ramifications.

Akshat Verma, Sandeep Sen

J. Supercomput., 2008

Optimal and Practical Algorithms for Sorting on the PDM.

Sanguthevar Rajasekaran, Sandeep Sen

IEEE Trans. Computers, 2008

Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error.

Surender Baswana, Akshay Gaur, Sandeep Sen, Jayant Upadhyay

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs.

Surender Baswana, Sandeep Sen

Random Struct. Algorithms, 2007

Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.

Surender Baswana, Ramesh Hariharan, Sandeep Sen

J. Algorithms, 2007

A linear time deterministic algorithm to find a small subset that approximates the centroid.

Pratik Worah, Sandeep Sen

Inf. Process. Lett., 2007

A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography.

V. N. Muralidhara, Sandeep Sen

Proceedings of the Progress in Cryptology, 2007

2006

Approximate distance oracles for unweighted graphs in expected <i>O</i>(<i>n</i>²) time.

Surender Baswana, Sandeep Sen

ACM Trans. Algorithms, 2006

Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions.

Yogish Sabharwal, Nishant Sharma, Sandeep Sen

J. Comput. Syst. Sci., 2006

Algorithmic Ramifications of Prefetching in Memory Hierarchy.

Akshat Verma, Sandeep Sen

Proceedings of the High Performance Computing, 2006

2005

A generalization of the 0-1 principle for sorting.

Sanguthevar Rajasekaran, Sandeep Sen

Inf. Process. Lett., 2005

A linear time algorithm for approximate 2-means clustering.

Yogish Sabharwal, Sandeep Sen

Comput. Geom., 2005

All-Pairs Nearly 2-Approximate Shortest-Paths in O(n² polylog n) Time.

Surender Baswana, Vishrut Goyal, Sandeep Sen

Proceedings of the STACS 2005, 2005

A Simple Optimal Randomized Algorithm for Sorting on the PDM.

Sanguthevar Rajasekaran, Sandeep Sen

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

PDM Sorting Algorithms That Take A Small Number of Passes.

Sanguthevar Rajasekaran, Sandeep Sen

Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

Linear Time Algorithms for Clustering Problems in Any Dimensions.

Amit Kumar, Yogish Sabharwal, Sandeep Sen

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Randomized Graph Data-Structures for Approximate Shortest Paths.

Surender Baswana, Sandeep Sen

Proceedings of the Handbook of Data Structures and Applications., 2004

Fair adaptive bandwidth allocation: a rate control based active queue management discipline.

Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey

Comput. Networks, 2004

Approximate distance oracles for unweighted graphs in Õ(n²) time.

Surender Baswana, Sandeep Sen

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

A Simple Linear Time (1+έ)-Approximation Algorithm for k-Means Clustering in Any Dimensions.

Amit Kumar, Yogish Sabharwal, Sandeep Sen

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003

Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima.

Neelima Gupta, Sandeep Sen

J. Parallel Distributed Comput., 2003

Maintaining all-pairs approximate shortest paths under deletion of edges.

Surender Baswana, Ramesh Hariharan, Sandeep Sen

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n^1+1/k) Size in Weighted Graphs.

Surender Baswana, Sandeep Sen

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Towards a theory of cache-efficient algorithms.

Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir

J. ACM, 2002

Planar Graph Blocking for External Searching.

Surender Baswana, Sandeep Sen

Algorithmica, 2002

Improved Algorithms for Uniform Partitions of Points.

Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen

Algorithmica, 2002

2001

An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains.

Neelima Gupta, Sandeep Sen

Algorithmica, 2001

Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel.

Neelima Gupta, Sumit Chopra, Sandeep Sen

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

2000

Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems.

Martin E. Dyer, Sandeep Sen

SIAM J. Comput., 2000

Towards a theory of cache-efficient algorithms.

Sandeep Sen, Siddhartha Chatterjee

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Cache-Efficient Matrix Transposition.

Siddhartha Chatterjee, Sandeep Sen

Proceedings of the Sixth International Symposium on High-Performance Computer Architecture, 2000

Parallel Computational Geometry: An Approach using Randomization.

John H. Reif, Sandeep Sen

Proceedings of the Handbook of Computational Geometry, 2000

1999

Distribution-Sensitive Algorithms.

Sandeep Sen, Neelima Gupta

Nord. J. Comput., 1999

Output-Sensitive Algorithms for Uniform Partitions of Points.

Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998

An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains.

Neelima Gupta, Sandeep Sen

Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998

1997

Lower Bounds for Parallel Algebraic Decision Trees, Parallel Complexity of Convex Hulls and Related Problems.

Sandeep Sen

Theor. Comput. Sci., 1997

On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm.

Binay K. Bhattacharya, Sandeep Sen

J. Algorithms, 1997

Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel.

Neelima Gupta, Sandeep Sen

Comput. Geom., 1997

Parallel Searching in Generalized Monge Arrays.

Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen

Algorithmica, 1997

1996

Selection in Monotone Matrices and Computing <i>k</i>th Nearest Neighbors.

Pankaj K. Agarwal, Sandeep Sen

J. Algorithms, 1996

Parallel Multidimensional Search Using Approximation Algorithms: With Applications to Linear-Programming and Related Problems.

Sandeep Sen

Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Faster Output-Sensitive Parallel Convex Hulls for <i>d</i><=3: Optimal Sublogarithmic Algorithms for Small Outputs.

Neelima Gupta, Sandeep Sen

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Fractional Cascading Revisited.

Sandeep Sen

J. Algorithms, 1995

1994

Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications.

John H. Reif, Sandeep Sen

SIAM J. Comput., 1994

Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems.

John H. Reif, Sandeep Sen

SIAM J. Comput., 1994

Selection in Monotone Matrices and Computing k^th Nearest Neighbors.

Pankaj K. Agarwal, Sandeep Sen

Proceedings of the Algorithm Theory, 1994

Lower Bounds for Parallel Algebraic Decision Trees, Complexity of Convex Hulls and Related Problems.

Sandeep Sen

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1993

Improved selection in totally monotone arrays.

Yishay Mansour, James K. Park, Baruch Schieber, Sandeep Sen

Int. J. Comput. Geom. Appl., 1993

1992

Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems.

John H. Reif, Sandeep Sen

SIAM J. Comput., 1992

Dynamic Point Location in Arrangement of Hyperplanes.

Ketan Mulmuley, Sandeep Sen

Discret. Comput. Geom., 1992

Optimal Randomized Parallel Algorithms for Computational Geometry.

John H. Reif, Sandeep Sen

Algorithmica, 1992

On Parallel Integer Sorting.

Sanguthevar Rajasekaran, Sandeep Sen

Acta Informatica, 1992

Fractional Cascading Simplified.

Sandeep Sen

Proceedings of the Algorithm Theory, 1992

1991

Some Observations on Skip-Lists.

Sandeep Sen

Inf. Process. Lett., 1991

Dynamic Point Location in Arrangements of Hyperplanes.

Ketan Mulmuley, Sandeep Sen

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

Finding an Approximate Median with High Probability in Constant Parallel Time.

Sandeep Sen

Inf. Process. Lett., 1990

Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications.

John H. Reif, Sandeep Sen

Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

Parallel Searching in Generalized Monge Arrays with Applications.

Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen

Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

1989

Parallel Sorting in Two-Dimensional VLSI Models of Computation.

Isaac D. Scherson, Sandeep Sen

IEEE Trans. Computers, 1989

Two Nearly Optimal Sorting Algorithms for Mesh-Connected Processor Arrays Using Shear-Sort.

Isaac D. Scherson, Sandeep Sen, Yiming Ma

J. Parallel Distributed Comput., 1989

Polling: A New Randomized Sampling Technique for Computational Geometry

John H. Reif, Sandeep Sen

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Randomization in Parallel Algorithms and its Impact on Computational Geometry.

John H. Reif, Sandeep Sen

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Randomized Parallel Algorithms.

John H. Reif, Sandeep Sen

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1988

An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization.

John H. Reif, Sandeep Sen

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1986

Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks.

Sandeep Sen, Isaac D. Scherson, Adi Shamir

Proceedings of the International Conference on Parallel Processing, 1986

The Distance Bound for Sorting on Mesh-Connected Processor Arrays Is Tight (Preliminary Report)

Yiming Ma, Sandeep Sen, Isaac D. Scherson

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986