Travelled to:
1 × Canada
1 × France
1 × Iceland
1 × Portugal
1 × The Netherlands
1 × USA
Collaborated with:
S.Baswana S.Chatterjee J.H.Reif A.Kumar Y.Sabharwal R.Hariharan A.Gaur J.Upadhyay
Talks about:
algorithm (3) linear (2) comput (2) graph (2) time (2) transposit (1) decrement (1) unweight (1) techniqu (1) shortest (1)
Person: Sandeep Sen
DBLP: Sen:Sandeep
Contributed to:
Wrote 6 papers:
- ICALP-A-2008-BaswanaGSU #constant #distance #fault #graph #polynomial
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error (SB, AG, SS, JU), pp. 609–621.
- ICALP-2005-KumarSS #algorithm #clustering #linear #problem
- Linear Time Algorithms for Clustering Problems in Any Dimensions (AK, YS, SS), pp. 1374–1385.
- ICALP-2003-BaswanaS #algorithm #graph #linear
- A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs (SB, SS), pp. 384–296.
- STOC-2002-BaswanaHS #algorithm #maintenance #transitive
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (SB, RH, SS), pp. 117–123.
- HPCA-2000-ChatterjeeS #matrix
- Cache-Efficient Matrix Transposition (SC, SS), pp. 195–205.
- STOC-1989-ReifS #geometry #named #random
- Polling: A New Randomized Sampling Technique for Computational Geometry (JHR, SS), pp. 394–404.