Browse by Fellow

Baswana, Surender ; Gupta, Manoj ; Sen, Sandeep (2011) Fully dynamic maximal matching in O(log n) update time Proceedings - Annual Symposium on Foundations of Computer Science . pp. 383-392. ISSN 0272-5428

Gupta, Manoj ; Sabharwal, Yogish ; Sen, Sandeep (2011) The update complexity of selection and related problems Foundations of Software Technology and Theoretical Computer Science . pp. 1-16.

Kumar, Amit ; Sabharwal, Yogish ; Sen, Sandeep (2010) Linear-time approximation schemes for clustering problems in any dimensions Journal of the ACM, 57 (2). No pp. given. ISSN 0004-5411

Sen, Sandeep ; Muralidhara, V. N. (2010) The covert set cover problem with application to network discovery Workshop on Algorithms and Computation - 2011 . pp. 228-239.

Muralidhara, V. N. ; Sen, Sandeep (2009) Improvements on the Johnson bound for Reed-Solomon codes Discrete Applied Mathematics, 157 (4). pp. 812-818. ISSN 0166-218X

Baswana, Surender ; Goyal, Vishrut ; Sen, Sandeep (2009) All-pairs nearly 2-approximate shortest paths in O(n²polylog n) time Theoretical Computer Science, 410 (1). pp. 84-93. ISSN 0304-3975

Rajasekaran, Sanguthevar ; Sen, Sandeep (2008) Optimal and practical algorithms for sorting on the PDM IEEE Transactions on Computers, 57 (4). pp. 547-561. ISSN 0018-9340

Verma, Akshat ; Sen, Sandeep (2008) Combating I-O bottleneck using prefetching: model, algorithms, and ramifications The Journal of Supercomputing, 45 (2). pp. 205-235. ISSN 0920-8542

Baswana, Surender ; Gaur, Akshay ; Sen, Sandeep ; Upadhyay, Jayant (2008) Distance oracles for unweighted graphs: breaking the quadratic barrier with constant additive error 35th International Colloquium on Automata, Languages and Programming .

Worah, Pratik ; Sen, Sandeep (2007) A linear time deterministic algorithm to find a small subset that approximates the centroid Information Processing Letters, 105 (1). pp. 17-19. ISSN 0020-0190

Baswana, Surender ; Hariharan, Ramesh ; Sen, Sandeep (2007) Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths Journal of Algorithms, 62 (2). pp. 74-92. ISSN 0196-6774

Muralidhara, V. N. ; Sen, Sandeep (2007) A result on the distribution of quadratic residues with applications to elliptic curve cryptography INDOCRYPT 2007, 8th International Conference on Cryptology in India .

Baswana, Surender ; Sen, Sandeep (2007) A simple linear time algorithm for computing a (2k-1)-spanner of O( n^{1+ 1/k}) size in weighted graphs Random Structures and Algorithms, 30 (4). 532- 563. ISSN 1042-9832

Baswana, Surender ; Sen, Sandeep (2006) Approximate distance oracles for unweighted graphs in expected O(n²) time ACM Transactions on Algorithms, 2 (4). No pp. given. ISSN 1549-6325

Sabharwal, Yogish ; Sharma, Nishant ; Sen, Sandeep (2006) Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions Journal of Computer and System Sciences, 72 (6). pp. 955-977. ISSN 0022-0000

Verma, Akshat ; Sen, Sandeep (2006) Algorithmic ramifications of prefetching in memory hierarchy 19th High Performance Computing Symposium .

Sabharwal, Yogish ; Sen, Sandeep (2005) A linear time algorithm for approximate 2-means clustering Computational Geometry, 32 (2). pp. 159-172. ISSN 0925-7721

Rajasekaran, Sanguthevar ; Sen, Sandeep (2005) A generalization of the 0-1 principle for sorting Information Processing Letters, 94 (1). pp. 43-47. ISSN 0020-0190

Kumar, Amit ; Sabharwal, Yogish ; Sen, Sandeep (2005) Linear time algorithms for clustering problems in any dimensions International Colloquium on Automata, Languages and Programming . pp. 1374-1385.

Rajasekaran, Sanguthevar ; Sen, Sandeep (2005) PDM sorting algorithms that take a small number of passes 19th IEEE International Proceedings on Parallel and Distributed Processing Symposium . 10 - 10.

Rajasekaran, Sanguthevar ; Sen, Sandeep (2005) A simple optimal randomized algorithm for sorting on the PDM Proceedings of International Society for Analysis, its Applications and Computation, 3827 . pp. 543-552. ISSN 0302-9743

Kamra, Abhinav ; Saran, Huzur ; Sen, Sandeep ; Shorey, Rajeev (2004) Fair adaptive bandwidth allocation: a rate control based active queue management discipline Computer Networks, 44 (2). pp. 135-152. ISSN 1389-1286

Kamra, Abhinav ; Sarana, Huzur ; Sen, Sandeep ; Shorey, Rajeev (2004) Fair adaptive bandwidth allocation: a rate control based active queue management discipline q Computer Networks, 44 (2). pp. 135-152. ISSN 1389-1286

Kumar, Amit ; Sabharwal, Yogish ; Sen, Sandeep (2004) A simple linear time ( 1+ ε)- approximation algorithm for geometric k-means clustering in any dimensions Proceedings - Annual Symposium on Foundations of Computer Science . pp. 454-462. ISSN 0272-5428

Gupta, Neelima ; Sen, Sandeep (2003) Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima Journal of Parallel and Distributed Computing, 63 (4). pp. 488-500. ISSN 0743-7315

Baswana, Surender ; Hariharan, Ramesh ; Sen, Sandeep (2003) Maintaining approximate all-pair-shortest-paths under deletion ACM Proceedings - Annual Symposium on Discrete Algorithms . pp. 394-403. ISSN 1071-9040

Sen, Sandeep ; Chatterjee, Siddartha ; Dumir, Neeraj (2002) Towards a theory of cache-efficient algorithms Journal of the ACM, 49 (6). pp. 828-858. ISSN 0004-5411

Adhya, Samit ; Hassan, Md. Quamarul ; Mukherjee, Sandeep ; Manna, Partha Pratim ; Basu, Anirban ; Sen, Sandeep ; Bandopadhyay, Santu (2002) Visceral leishmaniasis in India: promises and pitfalls of a PCR-based blood testisceral leishmaniasis in india: promises and pitfalls of a PCR-based blood test Transactions of the Royal Society of Tropical Medicine and Hygiene, 96 (Supp.1). S179-S183. ISSN 0035-9203

Agarwal, P. K. ; Bhattacharya, B. K. ; Sen, S. (2002) Improved algorithms for uniform partitions of points Algorithmica, 32 (4). pp. 521-539. ISSN 0178-4617

Baswana, Surender ; Hariharan, Ramesh ; Sen, Sandeep (2002) Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing . 117 - 123.

Baswana, Surender ; Sen, Sandeep (2002) Planar graph blocking for external searching Algorithmica, 34 (3). pp. 298-308. ISSN 0178-4617

Gupta, Neelima ; Chopra, Sumit ; Sen, Sandeep (2001) Optimal, output-sensitive algorithms for constructing upper envelope of line segments in parallel Lecture Notes in Computer Science, 2245 . pp. 183-194. ISSN 0302-9743

Gupta, N. ; Sen, S. (2001) An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains Algorithmica, 31 (2). pp. 179-207. ISSN 0178-4617

Chatterjee, S. ; Sen, Sandeep (2000) Cache-efficient matrix transposition Proceedings. Sixth International Symposium on High-Performance Computer Architecture, 2000. HPCA-6 . 195 - 205.

Dyer, Martin E. ; Sen, Sandeep (2000) Fast and optimal parallel multidimensional search in PRAMs with applications to linear programming and related problems SIAM Journal on Computing, 30 (5). pp. 1443-1461. ISSN 0097-5397

Baswana, Surender ; Sen, Sandeep (2000) Planar graph blocking for external searching Lecture Notes in Computer Science, 1974 . pp. 252-263. ISSN 0302-9743

Sen, Sandeep ; Chatterjee, Siddhartha (2000) Towards a theory of cache-efficient algorithms Proceedings of the eleventh annual SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms . pp. 829-838.

Agarwal, Pankaj K. ; Bhattacharya, Binay K. ; Sen, Sandeep (1999) Output-sensitive algorithms for uniform partitions of points Lecture Notes in Computer Science, 1741 . pp. 403-414. ISSN 0302-9743

Sen, Sandeep ; Gupta, Neelima (1998) Distribution-sensitive algorithms Lecture Notes in Computer Science, 1432 . pp. 335-346. ISSN 0302-9743

Reif, John H. ; Sen, S. (1998) An efficient output-sensitive hidden surface removal algorithm and its parallelization ACM Proceedings - Annual Symposium on Computational Geometry . pp. 193-201. ISSN 1055-6257

Gupta, Neelima ; Sen, Sandeep (1998) An improved output-size sensitive parallel algorithm for hidden-surface removal for terrains ACM Int'l Parallel Processing Symp . No pp. given.

Sen, Sandeep (1997) Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems Theoretical Computer Science, 188 (1-2). pp. 59-78. ISSN 0304-3975

Bhattacharya, Binay K. ; Sen, Sandeep (1997) On a simple, practical optimal output-sensitive randomized planar convex hull algorithm Journal of Algorithms, 25 (1). pp. 177-193. ISSN 0196-6774

Gupta, Neelima ; Sen, Sandeep (1997) Optimal, output-sensitive algorithms for constructing planar hulls in parallel Computational Geometry, 8 (3). pp. 151-166. ISSN 0925-7721

Agarwal, Pankaj K. ; Sen, Sandeep (1996) Selection in monotone matrices and computing kth nearest neighbors Journal of Algorithms, 20 (3). pp. 581-601. ISSN 0196-6774

Gupta, Neelima ; Sen, Sandeep (1996) Faster output-sensitive parallel convex hulls for d≤3: Optimal sublogarithmic algorithms for small outputs ACM Proceedings - Annual Symposium on Computational Geometry . 176 - 185. ISSN 1055-6257

Sen, Sandeep (1996) Parallel multidimensional searching using approximation algorithms with applications to linear programming and related problems Proceedings of the International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN) . 251 - 260.

Adhya, Samit ; Chatterjee, Mitali ; Hassan, Md. Quamarul ; Mukherjee, Sandeep ; Sen, Sandeep (1995) Detection of Leishmania in the blood of early kala-azar patients with the aid of the polymerase chain reaction Transactions of the Royal Society of Tropical Medicine and Hygiene, 89 (6). pp. 622-624. ISSN 0035-9203

Sen , S. D. (1995) Fractional cascading revisited Journal of Algorithms, 19 (2). pp. 161-172. ISSN 0196-6774

Sen, Sandeep (1994) Lower bounds for parallel algebraic decision trees, complexity of convex hulls and related problems Lecture Notes in Computer Science, 880 . pp. 193-204. ISSN 0302-9743

Mulmuley, Ketan ; Sen, Sandeep (1992) Dynamic point location in arrangements of hyperplanes Discrete & Computational Geometry, 8 (1). pp. 335-360. ISSN 0179-5376

Sen , Sandeep (1992) Fractional cascading simplified Lecture Notes in Computer Science, 621 . pp. 212-220. ISSN 0302-9743

Rajasekaran, Sanguthevar ; Sen, Sandeep (1992) On parallel integer sorting Acta Informatica, 29 (1). pp. 1-15. ISSN 0001-5903

Reif, John H. ; Sen, Sandeep (1992) Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems SIAM Journal on Computing, 21 (3). pp. 466-485. ISSN 0097-5397

Reif, John H. ; Sen, Sandeep (1992) Optimal randomized parallel algorithms for computational geometry Proceedings - International Conference on Parallel Processing, 7 (1-6). pp. 91-117. ISSN 0190-3918

Sen , Sandeep (1991) Some observations on skip-lists Information Processing Letters, 39 (4). pp. 173-176. ISSN 0020-0190

Mansour, Yishay ; Park, James K. ; Schieber, Baruch ; Sen, Sandeep (1991) Improved selection in totally monotone arrays Foundations of software technology and theoretical computer science : 11th conference, 560 . pp. 347-359. ISSN 0302-9743

Sen, Sandeep (1990) Finding an approximate median with high probability in constant parallel time Information Processing Letters, 34 (2). pp. 77-80. ISSN 0020-0190

Aggarwal, A. ; Kravets, D. ; Park, J. ; Sen, S. (1990) Parallel searching in generalized Monge arrays with applications Proceedings of the second annual ACM symposium on Parallel algorithms and architectures . 259 - 268.

Scherson, I. D. (1989) Parallel sorting in two-dimensional VLSI models of computation IEEE Transaction on Computers, 38 (2). pp. 238-249. ISSN 0018-9340

Scherson, Isaac D. ; Sen, Sandeep ; Ma, Yiming (1989) Two nearly optimal sorting algorithms for mesh-connected processor arrays using shear-sort Journal of Parallel and Distributed Computing, 6 (1). pp. 151-165. ISSN 0743-7315

Reif, John H. ; Sen, Sandeep (1989) Polling: a new randomized sampling technique for computational geometry ACM Proceedings - Annual ACM Symposium on Theory of Computing . No pp. given. ISSN 0734-9025

Isaacd, Scherson ; Sandeep, Sen ; Shamir, A. D. (1986) Shear sort - a true two-dimensional sorting technique for VLSI networks International Conference on Parallel Processing . pp. 903-908.

Ma, Yiming ; Sen, Sandeep ; Scherson, Isaac D. (1986) The distance bound for sorting on mesh-connected processor arrays is tight Proceedings of the 25th Annual IEEE Symposium on foundations of Computer Science (FOCS) . No pp. given.