default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSandeep Sen
Person information
- affiliation: ERNET, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[c50]Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen:
Efficient algorithms for decode efficient prefix codes. DCC 2021: 338- [c49]Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen:
Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings. FSTTCS 2021: 8:1-8:23 - 2020
- [c48]Shashwat Banchhor, Rishikesh R. Gajjala
, Yogish Sabharwal, Sandeep Sen:
Decode-Efficient Prefix Codes for Hierarchical Memory Models. DCC 2020: 360 - [i14]Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen:
Decode efficient prefix codes. CoRR abs/2010.05005 (2020)
2010 – 2019
- 2019
- [c47]Sandeep Sen:
A Unified Approach to Tail Estimates for Randomized Incremental Construction. STACS 2019: 58:1-58:16 - 2018
- [j44]Surender Baswana, Manoj Gupta, Sandeep Sen:
Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected Version). SIAM J. Comput. 47(3): 617-650 (2018) - [c46]Rameshwar Pratap, Sandeep Sen:
Faster Coreset Construction for Projective Clustering via Low-Rank Approximation. IWOCA 2018: 336-348 - [p2]Ragesh Jaiswal, Sandeep Sen:
Approximate Clustering. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [i13]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Sandeep Sen:
On the streaming complexity of fundamental geometric problems. CoRR abs/1803.06875 (2018) - [i12]Sandeep Sen:
On tail estimates for Randomized Incremental Construction. CoRR abs/1808.02356 (2018) - 2016
- [j43]Manoj Gupta, Yogish Sabharwal, Sandeep Sen:
The Update Complexity of Selection and Related Problems. Theory Comput. Syst. 59(1): 112-132 (2016) - [j42]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): 12:1-12:25 (2016) - [e2]Akash Lal, S. Akshay, Saket Saurabh, Sandeep Sen:
36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India. LIPIcs 65, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-027-9 [contents] - [r4]Surender Baswana, Manoj Gupta, Sandeep Sen:
Matching in Dynamic Graphs. Encyclopedia of Algorithms 2016: 1195-1199 - [r3]Surender Baswana, Sandeep Sen:
Simple Algorithms for Spanners in Weighted Graphs. Encyclopedia of Algorithms 2016: 1981-1986 - [i11]Rameshwar Pratap, Sandeep Sen:
Faster coreset construction for subspace and projective clustering. CoRR abs/1606.07992 (2016) - [i10]Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen:
Improvable Knapsack Problems. CoRR abs/1607.08338 (2016) - 2015
- [j41]Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, Sandeep Sen:
The robust knapsack problem with queries. Comput. Oper. Res. 55: 12-22 (2015) - [j40]Surender Baswana, Manoj Gupta, Sandeep Sen:
Fully Dynamic Maximal Matching in O(log n) Update Time. SIAM J. Comput. 44(1): 88-113 (2015) - [c45]Arijit Bishnu, Amit Chakrabarti, Subhas C. Nandy, Sandeep Sen:
On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model. FSTTCS 2015: 336-349 - [i9]Dhiraj Madan, Sandeep Sen:
Randomised Rounding with Applications. CoRR abs/1507.08501 (2015) - 2014
- [j39]Ragesh Jaiswal, Amit Kumar, Sandeep Sen:
A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems. Algorithmica 70(1): 22-46 (2014) - [c44]Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen:
Approximation Algorithms for the Weight-Reducible Knapsack Problem. TAMC 2014: 203-215 - [i8]Debjyoti Saharoy, Sandeep Sen:
Approximation Algorithms for Budget Constrained Network Upgradeable Problems. CoRR abs/1412.3721 (2014) - 2012
- [j38]Subhas C. Nandy, Sandeep Sen:
Preface. Theor. Comput. Sci. 442: 1 (2012) - [c43]Ragesh Jaiswal, Amit Kumar, Sandeep Sen:
A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems. COCOON 2012: 13-24 - [c42]Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen:
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs. FSTTCS 2012: 257-266 - [c41]Neeraj Sharma, Sandeep Sen:
Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model. SPAA 2012: 74-76 - [i7]Ragesh Jaiswal, Amit Kumar, Sandeep Sen:
A simple D^2-sampling based PTAS for k-means and other Clustering Problems. CoRR abs/1201.4206 (2012) - [i6]Sandeep Sen, V. N. Muralidhara:
The covert set-cover problem with application to Network Discovery. CoRR abs/1202.1090 (2012) - [i5]Neeraj Sharma, Sandeep Sen:
Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model. CoRR abs/1204.6508 (2012) - [i4]Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen:
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs. CoRR abs/1207.3976 (2012) - 2011
- [c40]Surender Baswana, Manoj Gupta, Sandeep Sen:
Fully Dynamic Maximal Matching in O (log n) Update Time. FOCS 2011: 383-392 - [c39]Manoj Gupta, Yogish Sabharwal, Sandeep Sen:
The update complexity of selection and related problems. FSTTCS 2011: 325-338 - [i3]Surender Baswana, Manoj Gupta, Sandeep Sen:
Fully dynamic maximal matching in O(log n) update time. CoRR abs/1103.1109 (2011) - [i2]Manoj Gupta, Yogish Sabharwal, Sandeep Sen:
The update complexity of selection and related problems. CoRR abs/1108.5525 (2011) - 2010
- [j37]Amit Kumar, Yogish Sabharwal, Sandeep Sen:
Linear-time approximation schemes for clustering problems in any dimensions. J. ACM 57(2): 5:1-5:32 (2010) - [c38]Sandeep Sen, V. N. Muralidhara:
The Covert Set-Cover Problem with Application to Network Discovery. WALCOM 2010: 228-239
2000 – 2009
- 2009
- [j36]V. N. Muralidhara, Sandeep Sen:
Improvements on the Johnson bound for Reed-Solomon codes. Discret. Appl. Math. 157(4): 812-818 (2009) - [j35]Surender Baswana, Vishrut Goyal, Sandeep Sen:
All-pairs nearly 2-approximate shortest paths in I time. Theor. Comput. Sci. 410(1): 84-93 (2009) - [c37]Sandeep Sen:
Approximating Shortest Paths in Graphs. WALCOM 2009: 32-43 - 2008
- [j34]Sanguthevar Rajasekaran, Sandeep Sen:
Optimal and Practical Algorithms for Sorting on the PDM. IEEE Trans. Computers 57(4): 547-561 (2008) - [j33]Akshat Verma, Sandeep Sen:
Combating I-O bottleneck using prefetching: model, algorithms, and ramifications. J. Supercomput. 45(2): 205-235 (2008) - [c36]Surender Baswana, Akshay Gaur, Sandeep Sen, Jayant Upadhyay:
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error. ICALP (1) 2008: 609-621 - [r2]Surender Baswana, Sandeep Sen:
Algorithms for Spanners in Weighted Graphs. Encyclopedia of Algorithms 2008 - 2007
- [j32]Pratik Worah, Sandeep Sen:
A linear time deterministic algorithm to find a small subset that approximates the centroid. Inf. Process. Lett. 105(1): 17-19 (2007) - [j31]Surender Baswana, Ramesh Hariharan, Sandeep Sen:
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. J. Algorithms 62(2): 74-92 (2007) - [j30]Surender Baswana, Sandeep Sen:
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Struct. Algorithms 30(4): 532-563 (2007) - [c35]V. N. Muralidhara, Sandeep Sen:
A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography. INDOCRYPT 2007: 48-57 - 2006
- [j29]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): 955-977 (2006) - [j28]Surender Baswana, Sandeep Sen:
Approximate distance oracles for unweighted graphs in expected O(n2) time. ACM Trans. Algorithms 2(4): 557-577 (2006) - [c34]Akshat Verma, Sandeep Sen:
Algorithmic Ramifications of Prefetching in Memory Hierarchy. HiPC 2006: 9-21 - 2005
- [j27]Yogish Sabharwal, Sandeep Sen:
A linear time algorithm for approximate 2-means clustering. Comput. Geom. 32(2): 159-172 (2005) - [j26]Sanguthevar Rajasekaran, Sandeep Sen:
A generalization of the 0-1 principle for sorting. Inf. Process. Lett. 94(1): 43-47 (2005) - [c33]Amit Kumar, Yogish Sabharwal, Sandeep Sen:
Linear Time Algorithms for Clustering Problems in Any Dimensions. ICALP 2005: 1374-1385 - [c32]Sanguthevar Rajasekaran, Sandeep Sen:
PDM Sorting Algorithms That Take A Small Number of Passes. IPDPS 2005 - [c31]Sanguthevar Rajasekaran, Sandeep Sen:
A Simple Optimal Randomized Algorithm for Sorting on the PDM. ISAAC 2005: 543-552 - [c30]Surender Baswana, Vishrut Goyal, Sandeep Sen:
All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time. STACS 2005: 666-679 - [e1]Ramaswamy Ramanujam, Sandeep Sen:
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings. Lecture Notes in Computer Science 3821, Springer 2005, ISBN 3-540-30495-9 [contents] - 2004
- [j25]Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey:
Fair adaptive bandwidth allocation: a rate control based active queue management discipline. Comput. Networks 44(2): 135-152 (2004) - [c29]Amit Kumar, Yogish Sabharwal, Sandeep Sen:
A Simple Linear Time (1+έ)-Approximation Algorithm for k-Means Clustering in Any Dimensions. FOCS 2004: 454-462 - [c28]Surender Baswana, Sandeep Sen:
Approximate distance oracles for unweighted graphs in Õ(n2) time. SODA 2004: 271-280 - [r1]Surender Baswana, Sandeep Sen:
Randomized Graph Data-Structures for Approximate Shortest Paths. Handbook of Data Structures and Applications 2004 - 2003
- [j24]Neelima Gupta, Sandeep Sen:
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima. J. Parallel Distributed Comput. 63(4): 488-500 (2003) - [c27]Surender Baswana, Sandeep Sen:
A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs. ICALP 2003: 384-296 - [c26]Surender Baswana, Ramesh Hariharan, Sandeep Sen:
Maintaining all-pairs approximate shortest paths under deletion of edges. SODA 2003: 394-403 - 2002
- [j23]Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen:
Improved Algorithms for Uniform Partitions of Points. Algorithmica 32(4): 521-539 (2002) - [j22]Surender Baswana, Sandeep Sen:
Planar Graph Blocking for External Searching. Algorithmica 34(3): 298-308 (2002) - [j21]Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir:
Towards a theory of cache-efficient algorithms. J. ACM 49(6): 828-858 (2002) - [c25]Yogish Sabharwal, Nishant Sharma, Sandeep Sen:
Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions. FSTTCS 2002: 311-323 - [c24]Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey:
Fair Adaptive Bandwidth Allocation: A Rate Control Based Active Queue Management Discipline. NETWORKING 2002: 838-849 - [c23]Surender Baswana, Ramesh Hariharan, Sandeep Sen:
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. STOC 2002: 117-123 - 2001
- [j20]Neelima Gupta, Sandeep Sen:
An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. Algorithmica 31(2): 179-207 (2001) - [c22]Neelima Gupta, Sumit Chopra, Sandeep Sen:
Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel. FSTTCS 2001: 183-194 - 2000
- [j19]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): 1443-1461 (2000) - [c21]Surender Baswana, Sandeep Sen:
Planar Graph Blocking for External Searching. FSTTCS 2000: 252-263 - [c20]Siddhartha Chatterjee, Sandeep Sen:
Cache-Efficient Matrix Transposition. HPCA 2000: 195-205 - [c19]Sandeep Sen, Siddhartha Chatterjee:
Towards a theory of cache-efficient algorithms. SODA 2000: 829-838 - [p1]John H. Reif, Sandeep Sen:
Parallel Computational Geometry: An Approach using Randomization. Handbook of Computational Geometry 2000: 765-828 - [i1]Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir:
Towards a Theory of Cache-Efficient Algorithms. CoRR cs.AR/0010007 (2000)
1990 – 1999
- 1999
- [j18]Sandeep Sen, Neelima Gupta:
Distribution-Sensitive Algorithms. Nord. J. Comput. 6(2): 194- (1999) - [c18]Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen:
Output-Sensitive Algorithms for Uniform Partitions of Points. ISAAC 1999: 403-414 - 1998
- [c17]Neelima Gupta, Sandeep Sen:
An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. IPPS/SPDP 1998: 215-219 - [c16]Sandeep Sen, Neelima Gupta:
Distribution-Sensitive Algorithms. SWAT 1998: 335-346 - 1997
- [j17]Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen:
Parallel Searching in Generalized Monge Arrays. Algorithmica 19(3): 291-317 (1997) - [j16]Neelima Gupta, Sandeep Sen:
Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel. Comput. Geom. 8: 151-166 (1997) - [j15]Binay K. Bhattacharya, Sandeep Sen:
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm. J. Algorithms 25(1): 177-193 (1997) - [j14]Sandeep Sen:
Lower Bounds for Parallel Algebraic Decision Trees, Parallel Complexity of Convex Hulls and Related Problems. Theor. Comput. Sci. 188(1-2): 59-78 (1997) - 1996
- [j13]Pankaj K. Agarwal, Sandeep Sen:
Selection in Monotone Matrices and Computing kth Nearest Neighbors. J. Algorithms 20(3): 581-601 (1996) - [c15]Neelima Gupta, Sandeep Sen:
Faster Output-Sensitive Parallel Convex Hulls for d<=3: Optimal Sublogarithmic Algorithms for Small Outputs. SCG 1996: 176-185 - [c14]Sandeep Sen:
Parallel Multidimensional Search Using Approximation Algorithms: With Applications to Linear-Programming and Related Problems. SPAA 1996: 251-260 - 1995
- [j12]Sandeep Sen:
Fractional Cascading Revisited. J. Algorithms 19(2): 161-172 (1995) - 1994
- [j11]John H. Reif, Sandeep Sen:
Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. SIAM J. Comput. 23(2): 447-448 (1994) - [j10]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): 633-651 (1994) - [c13]Sandeep Sen:
Lower Bounds for Parallel Algebraic Decision Trees, Complexity of Convex Hulls and Related Problems. FSTTCS 1994: 193-204 - [c12]Pankaj K. Agarwal, Sandeep Sen:
Selection in Monotone Matrices and Computing kth Nearest Neighbors. SWAT 1994: 13-24 - 1993
- [j9]Yishay Mansour, James K. Park, Baruch Schieber, Sandeep Sen:
Improved selection in totally monotone arrays. Int. J. Comput. Geom. Appl. 3(2): 115-132 (1993) - 1992
- [j8]Sanguthevar Rajasekaran, Sandeep Sen:
On Parallel Integer Sorting. Acta Informatica 29(1): 1-15 (1992) - [j7]John H. Reif, Sandeep Sen:
Optimal Randomized Parallel Algorithms for Computational Geometry. Algorithmica 7(1): 91-117 (1992) - [j6]Ketan Mulmuley, Sandeep Sen:
Dynamic Point Location in Arrangement of Hyperplanes. Discret. Comput. Geom. 8: 335-360 (1992) - [j5]John H. Reif, Sandeep Sen:
Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. SIAM J. Comput. 21(3): 466-485 (1992) - [c11]Sandeep Sen:
Fractional Cascading Simplified. SWAT 1992: 212-220 - 1991
- [j4]Sandeep Sen:
Some Observations on Skip-Lists. Inf. Process. Lett. 39(4): 173-176 (1991) - [c10]Ketan Mulmuley, Sandeep Sen:
Dynamic Point Location in Arrangements of Hyperplanes. SCG 1991: 132-141 - 1990
- [j3]Sandeep Sen:
Finding an Approximate Median with High Probability in Constant Parallel Time. Inf. Process. Lett. 34(2): 77-80 (1990) - [c9]Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen:
Parallel Searching in Generalized Monge Arrays with Applications. SPAA 1990: 259-268 - [c8]John H. Reif, Sandeep Sen:
Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications. SPAA 1990: 327-339
1980 – 1989
- 1989
- [j2]Isaac D. Scherson, Sandeep Sen, Yiming Ma:
Two Nearly Optimal Sorting Algorithms for Mesh-Connected Processor Arrays Using Shear-Sort. J. Parallel Distributed Comput. 6(1): 151-165 (1989) - [j1]Isaac D. Scherson, Sandeep Sen:
Parallel Sorting in Two-Dimensional VLSI Models of Computation. IEEE Trans. Computers 38(2): 238-249 (1989) - [c7]John H. Reif, Sandeep Sen:
Randomized Parallel Algorithms. IFIP Congress 1989: 455-458 - [c6]John H. Reif, Sandeep Sen:
Randomization in Parallel Algorithms and its Impact on Computational Geometry. Optimal Algorithms 1989: 1-8 - [c5]John H. Reif, Sandeep Sen:
Polling: A New Randomized Sampling Technique for Computational Geometry. STOC 1989: 394-404 - 1988
- [c4]John H. Reif, Sandeep Sen:
An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization. SCG 1988: 193-200 - 1987
- [c3]John H. Reif, Sandeep Sen:
Optimal Randomized Parallel Algorithms for Computational Geometry. ICPP 1987: 270-277 - 1986
- [c2]Yiming Ma, Sandeep Sen, Isaac D. Scherson:
The Distance Bound for Sorting on Mesh-Connected Processor Arrays Is Tight (Preliminary Report). FOCS 1986: 255-263 - [c1]Sandeep Sen, Isaac D. Scherson, Adi Shamir:
Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks. ICPP 1986: 903-908
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
