# Sandeep Sen

According to our database

Collaborative distances:

^{1}, Sandeep Sen authored at least 87 papers between 1986 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2019

A Unified Approach to Tail Estimates for Randomized Incremental Construction.

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).

SIAM J. Comput., 2018

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

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

2016

Simple Algorithms for Spanners in Weighted Graphs.

Encyclopedia of Algorithms, 2016

Matching in Dynamic Graphs.

Encyclopedia of Algorithms, 2016

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

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

2015

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

SIAM J. Comput., 2015

The robust knapsack problem with queries.

Computers & OR, 2015

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

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

2014

Approximation Algorithms for the Weight-Reducible Knapsack Problem.

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

2012

Preface.

Theor. Comput. Sci., 2012

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

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

Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs.

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

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

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011

The update complexity of selection and related problems.

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

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

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

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

J. ACM, 2010

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

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

2009

All-pairs nearly 2-approximate shortest paths in

*I*time.
Theor. Comput. Sci., 2009

Improvements on the Johnson bound for Reed-Solomon codes.

Discrete Applied Mathematics, 2009

Approximating Shortest Paths in Graphs.

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

2008

Algorithms for Spanners in Weighted Graphs.

Proceedings of the Encyclopedia of Algorithms, 2008

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

The Journal of Supercomputing, 2008

Optimal and Practical Algorithms for Sorting on the PDM.

IEEE Trans. Computers, 2008

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

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.

Random Struct. Algorithms, 2007

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

Inf. Process. Lett., 2007

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

Proceedings of the Progress in Cryptology, 2007

2006

ACM Trans. Algorithms, 2006

Algorithmic Ramifications of Prefetching in Memory Hierarchy.

Proceedings of the High Performance Computing, 2006

2005

A generalization of the 0-1 principle for sorting.

Inf. Process. Lett., 2005

A linear time algorithm for approximate 2-means clustering.

Comput. Geom., 2005

All-Pairs Nearly 2-Approximate Shortest-Paths in O(n

^{2}polylog n) Time.
Proceedings of the STACS 2005, 2005

A Simple Optimal Randomized Algorithm for Sorting on the PDM.

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

PDM Sorting Algorithms That Take A Small Number of Passes.

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

Linear Time Algorithms for Clustering Problems in Any Dimensions.

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

2004

Randomized Graph Data-Structures for Approximate Shortest Paths.

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

Approximate distance oracles for unweighted graphs in Õ(n

^{2}) time.
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.

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.

J. Parallel Distrib. Comput., 2003

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

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.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Towards a theory of cache-efficient algorithms.

J. ACM, 2002

Improved Algorithms for Uniform Partitions of Points.

Algorithmica, 2002

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

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Fair Adaptive Bandwidth Allocation: A Rate Control Based Active Queue Management Discipline.

Proceedings of the NETWORKING 2002, 2002

Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions.

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

2001

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

Algorithmica, 2001

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

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.

SIAM J. Comput., 2000

Towards a theory of cache-efficient algorithms.

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

Cache-Efficient Matrix Transposition.

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

Planar Graph Blocking for External Searching.

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

1999

Output-Sensitive Algorithms for Uniform Partitions of Points.

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

1998

Distribution-Sensitive Algorithms.

Proceedings of the Algorithm Theory, 1998

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

IPPS/SPDP, 1998

1997

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

Theor. Comput. Sci., 1997

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

J. Algorithms, 1997

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

Comput. Geom., 1997

Parallel Searching in Generalized Monge Arrays.

Algorithmica, 1997

1996

Selection in Monotone Matrices and Computing

*k*th Nearest Neighbors.
J. Algorithms, 1996

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

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

Faster Output-Sensitive Parallel Convex Hulls for

*d*<=3: Optimal Sublogarithmic Algorithms for Small Outputs.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Fractional Cascading Revisited.

J. Algorithms, 1995

1994

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

SIAM J. Comput., 1994

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

SIAM J. Comput., 1994

Selection in Monotone Matrices and Computing k

^{th}Nearest Neighbors.
Proceedings of the Algorithm Theory, 1994

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

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

1993

Improved selection in totally monotone arrays.

Int. J. Comput. Geometry Appl., 1993

1992

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

SIAM J. Comput., 1992

Dynamic Point Location in Arrangement of Hyperplanes.

Discrete & Computational Geometry, 1992

On Parallel Integer Sorting.

Acta Inf., 1992

Fractional Cascading Simplified.

Proceedings of the Algorithm Theory, 1992

1991

Some Observations on Skip-Lists.

Inf. Process. Lett., 1991

Dynamic Point Location in Arrangements of Hyperplanes.

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

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

Inf. Process. Lett., 1990

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

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

Parallel Searching in Generalized Monge Arrays with Applications.

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

1989

Parallel Sorting in Two-Dimensional VLSI Models of Computation.

IEEE Trans. Computers, 1989

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

J. Parallel Distrib. Comput., 1989

Polling: A New Randomized Sampling Technique for Computational Geometry

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

Randomization in Parallel Algorithms and its Impact on Computational Geometry.

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

Randomized Parallel Algorithms.

IFIP Congress, 1989

1988

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

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987

Optimal Randomized Parallel Algorithms for Computational Geometry.

Proceedings of the International Conference on Parallel Processing, 1987

1986

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

Proceedings of the International Conference on Parallel Processing, 1986

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

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