Sandeep Sen - RankMe

117 papers A* 11A 3B 13C 2Misc 3Journal 59Unranked 18

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Towards universally optimal sorting algorithms. CoRR Sandeep Sen
2021	B	`conf`	Efficient algorithms for decode efficient prefix codes. DCC Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen
2021	—	`conf`	Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings. FSTTCS Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen
2020	J	`jnl`	Decode efficient prefix codes. CoRR Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen
2020	B	`conf`	Decode-Efficient Prefix Codes for Hierarchical Memory Models. DCC Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen
2019	A	`conf`	A Unified Approach to Tail Estimates for Randomized Incremental Construction. STACS Sandeep Sen
2018	—	`ch.`	Approximate Clustering. Handbook of Approximation Algorithms and Metaheuristics (2) Ragesh Jaiswal, Sandeep Sen
2018	C	`conf`	Faster Coreset Construction for Projective Clustering via Low-Rank Approximation. IWOCA Rameshwar Pratap, Sandeep Sen
2018	J	`jnl`	Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected Version). SIAM J. Comput. Surender Baswana, Manoj Gupta, Sandeep Sen
2018	J	`jnl`	On tail estimates for Randomized Incremental Construction. CoRR Sandeep Sen
2018	J	`jnl`	On the streaming complexity of fundamental geometric problems. CoRR Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Sandeep Sen
2016	—	`ed.`	36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, Chennai, India, December 13-15, 2016 FSTTCS Akash Lal, S. Akshay, Saket Saurabh, Sandeep Sen
2016	J	`jnl`	Faster coreset construction for subspace and projective clustering. CoRR Rameshwar Pratap, Sandeep Sen
2016	J	`jnl`	Improvable Knapsack Problems. CoRR Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen
2016	—	`ch.`	Matching in Dynamic Graphs. Encyclopedia of Algorithms Surender Baswana, Manoj Gupta, Sandeep Sen
2016	J	`jnl`	Partitioning and Data Mapping in Reconfigurable Cache and Scratchpad Memory-Based Architectures. ACM Trans. Design Autom. Electr. Syst. Prasenjit Chakraborty, Preeti Ranjan Panda, Sandeep Sen
2016	—	`ch.`	Simple Algorithms for Spanners in Weighted Graphs. Encyclopedia of Algorithms Surender Baswana, Sandeep Sen
2016	J	`jnl`	The Update Complexity of Selection and Related Problems. Theory Comput. Syst. Manoj Gupta, Yogish Sabharwal, Sandeep Sen
2015	J	`jnl`	Fully Dynamic Maximal Matching in O(log n) Update Time. SIAM J. Comput. Surender Baswana, Manoj Gupta, Sandeep Sen
2015	—	`conf`	On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model. FSTTCS Arijit Bishnu, Amit Chakrabarti, Subhas C. Nandy, Sandeep Sen
2015	J	`jnl`	Randomised Rounding with Applications. CoRR Dhiraj Madan, Sandeep Sen
2015	J	`jnl`	The robust knapsack problem with queries. Comput. Oper. Res. Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, Sandeep Sen
2014	J	`jnl`	A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems. Algorithmica Ragesh Jaiswal, Amit Kumar, Sandeep Sen
2014	J	`jnl`	Approximation Algorithms for Budget Constrained Network Upgradeable Problems. CoRR Debjyoti Saharoy, Sandeep Sen
2014	C	`conf`	Approximation Algorithms for the Weight-Reducible Knapsack Problem. TAMC Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen
2012	Misc	`conf`	A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems. COCOON Ragesh Jaiswal, Amit Kumar, Sandeep Sen
2012	J	`jnl`	A simple D^2-sampling based PTAS for k-means and other Clustering Problems CoRR Ragesh Jaiswal, Amit Kumar, Sandeep Sen
2012	B	`conf`	Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model. SPAA Neeraj Sharma, Sandeep Sen
2012	J	`jnl`	Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model CoRR Neeraj Sharma, Sandeep Sen
2012	J	`jnl`	Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs CoRR Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen
2012	—	`conf`	Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs. FSTTCS Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen
2012	J	`jnl`	Preface. Theor. Comput. Sci. Subhas C. Nandy, Sandeep Sen
2012	J	`jnl`	The covert set-cover problem with application to Network Discovery CoRR Sandeep Sen, V. N. Muralidhara
2011	A*	`conf`	Fully Dynamic Maximal Matching in O (log n) Update Time. FOCS Surender Baswana, Manoj Gupta, Sandeep Sen
2011	J	`jnl`	Fully dynamic maximal matching in O(log n) update time CoRR Surender Baswana, Manoj Gupta, Sandeep Sen
2011	J	`jnl`	The update complexity of selection and related problems CoRR Manoj Gupta, Yogish Sabharwal, Sandeep Sen
2011	—	`conf`	The update complexity of selection and related problems. FSTTCS Manoj Gupta, Yogish Sabharwal, Sandeep Sen
2010	J	`jnl`	Linear-time approximation schemes for clustering problems in any dimensions. J. ACM Amit Kumar, Yogish Sabharwal, Sandeep Sen
2010	B	`conf`	The Covert Set-Cover Problem with Application to Network Discovery. WALCOM Sandeep Sen, V. N. Muralidhara
2009	J	`jnl`	All-pairs nearly 2-approximate shortest paths in Theor. Comput. Sci. Surender Baswana, Vishrut Goyal, Sandeep Sen
2009	B	`conf`	Approximating Shortest Paths in Graphs. WALCOM Sandeep Sen
2009	J	`jnl`	Improvements on the Johnson bound for Reed-Solomon codes. Discret. Appl. Math. V. N. Muralidhara, Sandeep Sen
2008	—	`ch.`	Algorithms for Spanners in Weighted Graphs. Encyclopedia of Algorithms Surender Baswana, Sandeep Sen
2008	J	`jnl`	Combating I-O bottleneck using prefetching: model, algorithms, and ramifications. J. Supercomput. Akshat Verma, Sandeep Sen
2008	—	`conf`	Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error. ICALP (1) Surender Baswana, Akshay Gaur, Sandeep Sen, Jayant Upadhyay
2008	J	`jnl`	Optimal and Practical Algorithms for Sorting on the PDM. IEEE Trans. Computers Sanguthevar Rajasekaran, Sandeep Sen
2007	Misc	`conf`	A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography. INDOCRYPT V. N. Muralidhara, Sandeep Sen
2007	J	`jnl`	A linear time deterministic algorithm to find a small subset that approximates the centroid. Inf. Process. Lett. Pratik Worah, Sandeep Sen
2007	J	`jnl`	A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Struct. Algorithms Surender Baswana, Sandeep Sen
2007	J	`jnl`	Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. J. Algorithms Surender Baswana, Ramesh Hariharan, Sandeep Sen
2006	Misc	`conf`	Algorithmic Ramifications of Prefetching in Memory Hierarchy. HiPC Akshat Verma, Sandeep Sen
2006	J	`jnl`	Approximate distance oracles for unweighted graphs in expected ACM Trans. Algorithms Surender Baswana, Sandeep Sen
2006	J	`jnl`	Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions. J. Comput. Syst. Sci. Yogish Sabharwal, Nishant Sharma, Sandeep Sen
2005	B	`conf`	A Simple Optimal Randomized Algorithm for Sorting on the PDM. ISAAC Sanguthevar Rajasekaran, Sandeep Sen
2005	J	`jnl`	A generalization of the 0-1 principle for sorting. Inf. Process. Lett. Sanguthevar Rajasekaran, Sandeep Sen
2005	J	`jnl`	A linear time algorithm for approximate 2-means clustering. Comput. Geom. Yogish Sabharwal, Sandeep Sen
2005	A	`conf`	All-Pairs Nearly 2-Approximate Shortest-Paths in O(n STACS Surender Baswana, Vishrut Goyal, Sandeep Sen
2005	—	`ed.`	FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings FSTTCS Ramaswamy Ramanujam, Sandeep Sen
2005	A*	`conf`	Linear Time Algorithms for Clustering Problems in Any Dimensions. ICALP Amit Kumar, Yogish Sabharwal, Sandeep Sen
2005	A	`conf`	PDM Sorting Algorithms That Take A Small Number of Passes. IPDPS Sanguthevar Rajasekaran, Sandeep Sen
2004	A*	`conf`	A Simple Linear Time (1+έ)-Approximation Algorithm for k-Means Clustering in Any Dimensions. FOCS Amit Kumar, Yogish Sabharwal, Sandeep Sen
2004	A*	`conf`	Approximate distance oracles for unweighted graphs in Õ(n SODA Surender Baswana, Sandeep Sen
2004	J	`jnl`	Fair adaptive bandwidth allocation: a rate control based active queue management discipline. Comput. Networks Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey
2004	—	`ch.`	Randomized Graph Data-Structures for Approximate Shortest Paths. Handbook of Data Structures and Applications Surender Baswana, Sandeep Sen
2003	A*	`conf`	A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n ICALP Surender Baswana, Sandeep Sen
2003	J	`jnl`	Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima. J. Parallel Distributed Comput. Neelima Gupta, Sandeep Sen
2003	A*	`conf`	Maintaining all-pairs approximate shortest paths under deletion of edges. SODA Surender Baswana, Ramesh Hariharan, Sandeep Sen
2002	B	`conf`	Fair Adaptive Bandwidth Allocation: A Rate Control Based Active Queue Management Discipline. NETWORKING Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey
2002	J	`jnl`	Improved Algorithms for Uniform Partitions of Points. Algorithmica Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen
2002	A*	`conf`	Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. STOC Surender Baswana, Ramesh Hariharan, Sandeep Sen
2002	—	`conf`	Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions. FSTTCS Yogish Sabharwal, Nishant Sharma, Sandeep Sen
2002	J	`jnl`	Planar Graph Blocking for External Searching. Algorithmica Surender Baswana, Sandeep Sen
2002	J	`jnl`	Towards a theory of cache-efficient algorithms. J. ACM Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir
2001	J	`jnl`	An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. Algorithmica Neelima Gupta, Sandeep Sen
2001	—	`conf`	Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel. FSTTCS Neelima Gupta, Sumit Chopra, Sandeep Sen
2000	A*	`conf`	Cache-Efficient Matrix Transposition. HPCA Siddhartha Chatterjee, Sandeep Sen
2000	J	`jnl`	Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems. SIAM J. Comput. Martin E. Dyer, Sandeep Sen
2000	—	`ch.`	Parallel Computational Geometry: An Approach using Randomization. Handbook of Computational Geometry John H. Reif, Sandeep Sen
2000	—	`conf`	Planar Graph Blocking for External Searching. FSTTCS Surender Baswana, Sandeep Sen
2000	J	`jnl`	Towards a Theory of Cache-Efficient Algorithms CoRR Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir
2000	A*	`conf`	Towards a theory of cache-efficient algorithms. SODA Sandeep Sen, Siddhartha Chatterjee
1999	J	`jnl`	Distribution-Sensitive Algorithms. Nord. J. Comput. Sandeep Sen, Neelima Gupta
1999	B	`conf`	Output-Sensitive Algorithms for Uniform Partitions of Points. ISAAC Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen
1998	—	`conf`	An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. IPPS/SPDP Neelima Gupta, Sandeep Sen
1998	—	`conf`	Distribution-Sensitive Algorithms. SWAT Sandeep Sen, Neelima Gupta
1997	J	`jnl`	Lower Bounds for Parallel Algebraic Decision Trees, Parallel Complexity of Convex Hulls and Related Problems. Theor. Comput. Sci. Sandeep Sen
1997	J	`jnl`	On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm. J. Algorithms Binay K. Bhattacharya, Sandeep Sen
1997	J	`jnl`	Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel. Comput. Geom. Neelima Gupta, Sandeep Sen
1997	J	`jnl`	Parallel Searching in Generalized Monge Arrays. Algorithmica Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen
1996	—	`conf`	Faster Output-Sensitive Parallel Convex Hulls for SCG Neelima Gupta, Sandeep Sen
1996	B	`conf`	Parallel Multidimensional Search Using Approximation Algorithms: With Applications to Linear-Programming and Related Problems. SPAA Sandeep Sen
1996	J	`jnl`	Selection in Monotone Matrices and Computing J. Algorithms Pankaj K. Agarwal, Sandeep Sen
1995	J	`jnl`	Fractional Cascading Revisited. J. Algorithms Sandeep Sen
1994	J	`jnl`	Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. SIAM J. Comput. John H. Reif, Sandeep Sen
1994	—	`conf`	Lower Bounds for Parallel Algebraic Decision Trees, Complexity of Convex Hulls and Related Problems. FSTTCS Sandeep Sen
1994	J	`jnl`	Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications. SIAM J. Comput. John H. Reif, Sandeep Sen
1994	—	`conf`	Selection in Monotone Matrices and Computing k SWAT Pankaj K. Agarwal, Sandeep Sen
1993	J	`jnl`	Improved selection in totally monotone arrays. Int. J. Comput. Geom. Appl. Yishay Mansour, James K. Park, Baruch Schieber, Sandeep Sen
1992	J	`jnl`	Dynamic Point Location in Arrangement of Hyperplanes. Discret. Comput. Geom. Ketan Mulmuley, Sandeep Sen
1992	—	`conf`	Fractional Cascading Simplified. SWAT Sandeep Sen
1992	J	`jnl`	On Parallel Integer Sorting. Acta Informatica Sanguthevar Rajasekaran, Sandeep Sen
1992	J	`jnl`	Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. SIAM J. Comput. John H. Reif, Sandeep Sen
1992	J	`jnl`	Optimal Randomized Parallel Algorithms for Computational Geometry. Algorithmica John H. Reif, Sandeep Sen
1991	—	`conf`	Dynamic Point Location in Arrangements of Hyperplanes. SCG Ketan Mulmuley, Sandeep Sen
1991	J	`jnl`	Some Observations on Skip-Lists. Inf. Process. Lett. Sandeep Sen
1990	J	`jnl`	Finding an Approximate Median with High Probability in Constant Parallel Time. Inf. Process. Lett. Sandeep Sen
1990	B	`conf`	Parallel Searching in Generalized Monge Arrays with Applications. SPAA Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen
1990	B	`conf`	Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications. SPAA John H. Reif, Sandeep Sen
1989	J	`jnl`	Parallel Sorting in Two-Dimensional VLSI Models of Computation. IEEE Trans. Computers Isaac D. Scherson, Sandeep Sen
1989	A*	`conf`	Polling: A New Randomized Sampling Technique for Computational Geometry STOC John H. Reif, Sandeep Sen
1989	—	`conf`	Randomization in Parallel Algorithms and its Impact on Computational Geometry. Optimal Algorithms John H. Reif, Sandeep Sen
1989	—	`conf`	Randomized Parallel Algorithms. IFIP Congress John H. Reif, Sandeep Sen
1989	J	`jnl`	Two Nearly Optimal Sorting Algorithms for Mesh-Connected Processor Arrays Using Shear-Sort. J. Parallel Distributed Comput. Isaac D. Scherson, Sandeep Sen, Yiming Ma
1988	—	`conf`	An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization. SCG John H. Reif, Sandeep Sen
1987	B	`conf`	Optimal Randomized Parallel Algorithms for Computational Geometry. ICPP John H. Reif, Sandeep Sen
1986	B	`conf`	Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks. ICPP Sandeep Sen, Isaac D. Scherson, Adi Shamir
1986	A*	`conf`	The Distance Bound for Sorting on Mesh-Connected Processor Arrays Is Tight (Preliminary Report) FOCS Yiming Ma, Sandeep Sen, Isaac D. Scherson