Sandeep Sen

	2012
85		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)
84		Sandeep Sen, V. N. Muralidhara: The covert set-cover problem with application to Network Discovery CoRR abs/1202.1090: (2012)
83		Neeraj Sharma, Sandeep Sen: Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model CoRR abs/1204.6508: (2012)
	2011
82		Surender Baswana, Manoj Gupta, Sandeep Sen: Fully Dynamic Maximal Matching in O (log n) Update Time. FOCS 2011: 383-392
81		Manoj Gupta, Yogish Sabharwal, Sandeep Sen: The update complexity of selection and related problems. FSTTCS 2011: 325-338
80		Surender Baswana, Manoj Gupta, Sandeep Sen: Fully dynamic maximal matching in O(log n) update time CoRR abs/1103.1109: (2011)
79		Manoj Gupta, Yogish Sabharwal, Sandeep Sen: The update complexity of selection and related problems CoRR abs/1108.5525: (2011)
	2010
78		Sandeep Sen, V. N. Muralidhara: The Covert Set-Cover Problem with Application to Network Discovery. WALCOM 2010: 228-239
77		Amit Kumar, Yogish Sabharwal, Sandeep Sen: Linear-time approximation schemes for clustering problems in any dimensions. J. ACM 57(2): (2010)
	2009
76		Sandeep Sen: Approximating Shortest Paths in Graphs. WALCOM 2009: 32-43
75		V. N. Muralidhara, Sandeep Sen: Improvements on the Johnson bound for Reed-Solomon codes. Discrete Applied Mathematics 157(4): 812-818 (2009)
74		Surender Baswana, Vishrut Goyal, Sandeep Sen: All-pairs nearly 2-approximate shortest paths in I time. Theor. Comput. Sci. 410(1): 84-93 (2009)
	2008
73		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
72		Surender Baswana, Sandeep Sen: Algorithms for Spanners in Weighted Graphs. Encyclopedia of Algorithms 2008
71		Sanguthevar Rajasekaran, Sandeep Sen: Optimal and Practical Algorithms for Sorting on the PDM. IEEE Trans. Computers 57(4): 547-561 (2008)
70		Akshat Verma, Sandeep Sen: Combating I-O bottleneck using prefetching: model, algorithms, and ramifications. The Journal of Supercomputing 45(2): 205-235 (2008)
	2007
69		V. N. Muralidhara, Sandeep Sen: A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography. INDOCRYPT 2007: 48-57
68		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)
67		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)
66		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)
	2006
65		Akshat Verma, Sandeep Sen: Algorithmic Ramifications of Prefetching in Memory Hierarchy. HiPC 2006: 9-21
64		Surender Baswana, Sandeep Sen: Approximate distance oracles for unweighted graphs in expected O(n2) time. ACM Transactions on Algorithms 2(4): 557-577 (2006)
63		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)
	2005
62		Ramaswamy Ramanujam, Sandeep Sen: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings Springer 2005
61		Amit Kumar, Yogish Sabharwal, Sandeep Sen: Linear Time Algorithms for Clustering Problems in Any Dimensions. ICALP 2005: 1374-1385
60		Sanguthevar Rajasekaran, Sandeep Sen: PDM Sorting Algorithms That Take A Small Number of Passes. IPDPS 2005
59		Sanguthevar Rajasekaran, Sandeep Sen: A Simple Optimal Randomized Algorithm for Sorting on the PDM. ISAAC 2005: 543-552
58		Surender Baswana, Vishrut Goyal, Sandeep Sen: All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time. STACS 2005: 666-679
57		Yogish Sabharwal, Sandeep Sen: A linear time algorithm for approximate 2-means clustering. Comput. Geom. 32(2): 159-172 (2005)
56		Sanguthevar Rajasekaran, Sandeep Sen: A generalization of the 0-1 principle for sorting. Inf. Process. Lett. 94(1): 43-47 (2005)
	2004
55		Amit Kumar, Yogish Sabharwal, Sandeep Sen: A Simple Linear Time (1+έ)-Approximation Algorithm for k-Means Clustering in Any Dimensions. FOCS 2004: 454-462
54		Surender Baswana, Sandeep Sen: Approximate distance oracles for unweighted graphs in Õ(n2) time. SODA 2004: 271-280
53		Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey: Fair adaptive bandwidth allocation: a rate control based active queue management discipline. Computer Networks 44(2): 135-152 (2004)
	2003
52		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
51		Surender Baswana, Ramesh Hariharan, Sandeep Sen: Maintaining all-pairs approximate shortest paths under deletion of edges. SODA 2003: 394-403
50		Neelima Gupta, Sandeep Sen: Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima. J. Parallel Distrib. Comput. 63(4): 488-500 (2003)
	2002
49		Yogish Sabharwal, Nishant Sharma, Sandeep Sen: Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions. FSTTCS 2002: 311-323
48		Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey: Fair Adaptive Bandwidth Allocation: A Rate Control Based Active Queue Management Discipline. NETWORKING 2002: 838-849
47		Surender Baswana, Ramesh Hariharan, Sandeep Sen: Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. STOC 2002: 117-123
46		Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen: Improved Algorithms for Uniform Partitions of Points. Algorithmica 32(4): 521-539 (2002)
45		Surender Baswana, Sandeep Sen: Planar Graph Blocking for External Searching. Algorithmica 34(3): 298-308 (2002)
44		Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir: Towards a theory of cache-efficient algorithms. J. ACM 49(6): 828-858 (2002)
	2001
43		Neelima Gupta, Sumit Chopra, Sandeep Sen: Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel. FSTTCS 2001: 183-194
42		Neelima Gupta, Sandeep Sen: An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. Algorithmica 31(2): 179-207 (2001)
	2000
41		Surender Baswana, Sandeep Sen: Planar Graph Blocking for External Searching. FSTTCS 2000: 252-263
40		Siddhartha Chatterjee, Sandeep Sen: Cache-Efficient Matrix Transposition. HPCA 2000: 195-205
39		Sandeep Sen, Siddhartha Chatterjee: Towards a theory of cache-efficient algorithms. SODA 2000: 829-838
38		Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir: Towards a Theory of Cache-Efficient Algorithms CoRR cs.AR/0010007: (2000)
37		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)
	1999
36		Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen: Output-Sensitive Algorithms for Uniform Partitions of Points. ISAAC 1999: 403-414
35		Sandeep Sen, Neelima Gupta: Distribution-Sensitive Algorithms. Nord. J. Comput. 6(2): 194- (1999)
	1998
34		Neelima Gupta, Sandeep Sen: An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. IPPS/SPDP 1998: 215-219
33		Sandeep Sen, Neelima Gupta: Distribution-Sensitive Algorithms. SWAT 1998: 335-346
	1997
32		Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen: Parallel Searching in Generalized Monge Arrays. Algorithmica 19(3): 291-317 (1997)
31		Neelima Gupta, Sandeep Sen: Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel. Comput. Geom. 8: 151-166 (1997)
30		Binay K. Bhattacharya, Sandeep Sen: On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm. J. Algorithms 25(1): 177-193 (1997)
29		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
28		Sandeep Sen: Parallel Multidimensional Search Using Approximation Algorithms: With Applications to Linear-Programming and Related Problems. SPAA 1996: 251-260
27		Neelima Gupta, Sandeep Sen: Faster Output-Sensitive Parallel Convex Hulls for d<=3: Optimal Sublogarithmic Algorithms for Small Outputs. Symposium on Computational Geometry 1996: 176-185
26		Pankaj K. Agarwal, Sandeep Sen: Selection in Monotone Matrices and Computing kth Nearest Neighbors. J. Algorithms 20(3): 581-601 (1996)
	1995
25		Sandeep Sen: Fractional Cascading Revisited. J. Algorithms 19(2): 161-172 (1995)
	1994
24		Sandeep Sen: Lower Bounds for Parallel Algebraic Decision Trees, Complexity of Convex Hulls and Related Problems. FSTTCS 1994: 193-204
23		Pankaj K. Agarwal, Sandeep Sen: Selection in Monotone Matrices and Computing kth Nearest Neighbors. SWAT 1994: 13-24
22		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)
21		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)
	1993
20		Yishay Mansour, James K. Park, Baruch Schieber, Sandeep Sen: Improved selection in totally monotone arrays. Int. J. Comput. Geometry Appl. 3(2): 115-132 (1993)
	1992
19		Sandeep Sen: Fractional Cascading Simplified. SWAT 1992: 212-220
18		Sanguthevar Rajasekaran, Sandeep Sen: On Parallel Integer Sorting. Acta Inf. 29(1): 1-15 (1992)
17		John H. Reif, Sandeep Sen: Optimal Randomized Parallel Algorithms for Computational Geometry. Algorithmica 7(1): 91-117 (1992)
16		Ketan Mulmuley, Sandeep Sen: Dynamic Point Location in Arrangement of Hyperplanes. Discrete & Computational Geometry 8: 335-360 (1992)
15		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)
	1991
14		Ketan Mulmuley, Sandeep Sen: Dynamic Point Location in Arrangements of Hyperplanes. Symposium on Computational Geometry 1991: 132-141
13		Sandeep Sen: Some Observations on Skip-Lists. Inf. Process. Lett. 39(4): 173-176 (1991)
	1990
12		Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen: Parallel Searching in Generalized Monge Arrays with Applications. SPAA 1990: 259-268
11		John H. Reif, Sandeep Sen: Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications. SPAA 1990: 327-339
10		Sandeep Sen: Finding an Approximate Median with High Probability in Constant Parallel Time. Inf. Process. Lett. 34(2): 77-80 (1990)
	1989
9		John H. Reif, Sandeep Sen: Randomized Parallel Algorithms. IFIP Congress 1989: 455-458
8		John H. Reif, Sandeep Sen: Randomization in Parallel Algorithms and its Impact on Computational Geometry. Optimal Algorithms 1989: 1-8
7		John H. Reif, Sandeep Sen: Polling: A New Randomized Sampling Technique for Computational Geometry STOC 1989: 394-404
6		Isaac D. Scherson, Sandeep Sen: Parallel Sorting in Two-Dimensional VLSI Models of Computation. IEEE Trans. Computers 38(2): 238-249 (1989)
5		Isaac D. Scherson, Sandeep Sen, Yiming Ma: Two Nearly Optimal Sorting Algorithms for Mesh-Connected Processor Arrays Using Shear-Sort. J. Parallel Distrib. Comput. 6(1): 151-165 (1989)
	1988
4		John H. Reif, Sandeep Sen: An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization. Symposium on Computational Geometry 1988: 193-200
	1987
3		John H. Reif, Sandeep Sen: Optimal Randomized Parallel Algorithms for Computational Geometry. ICPP 1987: 270-277
	1986
2		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
1		Sandeep Sen, Isaac D. Scherson, Adi Shamir: Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks. ICPP 1986: 903-908

Coauthor Index

1	Pankaj K. Agarwal	[23] [26] [36] [46]
2	Alok Aggarwal	[12] [32]
3	Surender Baswana	[41] [45] [47] [51] [52] [54] [58] [64] [66] [67] [72] [73] [74] [80] [82]
4	Binay K. Bhattacharya	[30] [36] [46]
5	Siddhartha Chatterjee	[38] [39] [40] [44]
6	Sumit Chopra	[43]
7	Neeraj Dumir	[38] [44]
8	Martin E. Dyer	[37]
9	Akshay Gaur	[73]
10	Vishrut Goyal	[58] [74]
11	Manoj Gupta	[79] [80] [81] [82]
12	Neelima Gupta	[27] [31] [33] [34] [35] [42] [43] [50]
13	Ramesh Hariharan	[47] [51] [67]
14	Ragesh Jaiswal	[85]
15	Abhinav Kamra	[48] [53]
16	Dina Kravets	[12] [32]
17	Amit Kumar	[55] [61] [77] [85]
18	Yiming Ma	[2] [5]
19	Yishay Mansour	[20]
20	Ketan Mulmuley	[14] [16]
21	V. N. Muralidhara	[69] [75] [78] [84]
22	James K. Park	[12] [20] [32]
23	Sanguthevar Rajasekaran	[18] [56] [59] [60] [71]
24	Ramaswamy Ramanujam	[62]
25	John H. Reif	[3] [4] [7] [8] [9] [11] [15] [17] [21] [22]
26	Yogish Sabharwal	[49] [55] [57] [61] [63] [77] [79] [81]
27	Huzur Saran	[48] [53]
28	Isaac D. Scherson	[1] [2] [5] [6]
29	Baruch Schieber	[20]
30	Adi Shamir	[1]
31	Neeraj Sharma	[83]
32	Nishant Sharma	[49] [63]
33	Rajeev Shorey	[48] [53]
34	Jayant Upadhyay	[73]
35	Akshat Verma	[65] [70]
36	Pratik Worah	[68]

Colors in the list of coauthors

Last update Tue May 29 21:44:46 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page