Sen, Sandeep - Department of Computer Science and Engineering, Indian Institute of Technology, Delhi

Advanced Search

Sen, Sandeep - Department of Computer Science and Engineering, Indian Institute of Technology, Delhi

Distance oracles for unweighted graphs : breaking the quadratic barrier with constant
A Simple and Linear Time Randomized Algorithm for Computing Sparse Spanners in Weighted Graphs
Dynamic Point Location in Arrangements of Hyperplanes.
A Simple and Efficient Algorithm for Spanners in Weighted (2003; Baswana, Sen)
Distributionsensitive algorithms \Lambda Sandeep Sen and Neelima Gupta
DOI: 10.1007/s00453-002-0969-2 Algorithmica (2002) 34: 298308
ARTICLE IN PRESS UNCORRECTEDPROOF
Algorithmic Ramifications of Prefetching in Memory Hierarchy
Optimal and Practical Algorithms for Sorting on the PDM1
Combating I-O bottleneck using prefetching: model, algorithms and ramifications
Information Processing Letters 105 (2007) 1719 www.elsevier.com/locate/ipl
Approximate Distance Oracles for Unweighted Graphs in time
The hardness of speedingup Knapsack Sandeep Sen \Lambda
238 IEEE TRANSACTIONS ON COMPUTERS, VOL. 38, NO. 2, FEBRUARY 1989 Parallel Sorting in Two-Dimensional VLSI Models
Z .JOURNAL OF ALGORITHMS 20, 581 601 1996 ARTICLE NO. 0028
Theoretical Computer Science
Algorithmica (1997) 19: 291317 Algorithmica
DOI: 10.1007/s00453-001-0084-9 Algorithmica (2002) 32: 521539
Towards a Theory of Cache-Efficient Algorithms SANDEEP SEN
Fair adaptive bandwidth allocation: a rate control based active queue management discipline q
Information Processing Letters 94 (2005) 4347 www.elsevier.com/locate/ipl
Improvements on the Johnson bound for Reed-Solomon Codes
Linear-Time Approximation Schemes for Clustering Problems in any Dimensions
A Simple Linear Time (1 + )-Approximation Algorithm for k-Means Clustering in Any Dimensions
PDM Sorting Algorithms That Take A Small Number Of Passes Sanguthevar Rajasekaran
All-Pairs Nearly 2-Approximate Shortest-Paths polylog n) Time
A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography
The covert set-cover problem with application to Network Discovery