Sandeep Sen
Affiliations:- ERNET, India
According to our database1,
Sandeep Sen
authored at least 99 papers
between 1986 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
1
2
1
1
1
1
3
4
3
2
2
1
2
2
3
2
2
1
1
3
1
1
1
4
1
1
2
1
4
1
1
2
2
1
1
1
1
1
2
1
1
1
1
1
4
2
2
1
2
1
1
2
2
1
1
2
3
1
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2021
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021
Proceedings of the 31st Data Compression Conference, 2021
2020
Proceedings of the Data Compression Conference, 2020
2019
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019
2018
SIAM J. Comput., 2018
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018
Approximate Clustering.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2016
Partitioning and Data Mapping in Reconfigurable Cache and Scratchpad Memory-Based Architectures.
ACM Trans. Design Autom. Electr. Syst., 2016
2015
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015
2014
CoRR, 2014
Algorithmica, 2014
Proceedings of the Theory and Applications of Models of Computation, 2014
2012
Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model
CoRR, 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
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012
2010
J. ACM, 2010
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010
2009
Theor. Comput. Sci., 2009
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
J. Supercomput., 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
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.
J. 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
Approximate distance oracles for unweighted graphs in expected <i>O</i>(<i>n</i><sup>2</sup>) time.
ACM Trans. Algorithms, 2006
Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions.
J. Comput. Syst. Sci., 2006
Proceedings of the High Performance Computing, 2006
2005
Proceedings of the STACS 2005, 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005
2004
Proceedings of the Handbook of Data Structures and Applications., 2004
Fair adaptive bandwidth allocation: a rate control based active queue management discipline.
Comput. Networks, 2004
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
J. Parallel Distributed Comput., 2003
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<sup>1+1/k</sup>) Size in Weighted Graphs.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
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
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
Proceedings of the Sixth International Symposium on High-Performance Computer Architecture, 2000
Proceedings of the Handbook of Computational Geometry, 2000
1999
Distribution-Sensitive Algorithms.
Nord. J. Comput., 1999
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999
1998
An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains.
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.
Theor. Comput. Sci., 1997
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm.
J. Algorithms, 1997
Comput. Geom., 1997
1996
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 <i>d</i><=3: Optimal Sublogarithmic Algorithms for Small Outputs.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
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
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
1992
Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems.
SIAM J. Comput., 1992
Algorithmica, 1992
1991
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991
1990
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
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990
1989
IEEE Trans. Computers, 1989
Two Nearly Optimal Sorting Algorithms for Mesh-Connected Processor Arrays Using Shear-Sort.
J. Parallel Distributed Comput., 1989
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989
Randomized Parallel Algorithms.
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.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988
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