( en | de | ru )

 

Disambiguation of "Sen, Sandeep"

Author of the publication

copydeleteadd this publication to your clipboard
On parallel integer sorting

, and . Acta Informatica, 29 (1): 1--15 (1992)
DOI: 10.1007/BF01178563

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sandeep Sadanandan

Sandeep Nambiar

Sandeep Kumar

Sandeep Ameta

Sandeep Pal

 

Other publications of authors with the same name

Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems., and . SIAM J. Comput., 21 (3): 466-485 (1992)Erratum: SIAM J. Comput. 23(2): 447-448 (1994).Parallel Searching in Generalized Monge Arrays., , , and . Algorithmica, 19 (3): 291-317 (1997)On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm., and . J. Algorithms, 25 (1): 177-193 (1997)Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model., and . SPAA, page 74-76. ACM, (2012)Approximation Algorithms for Budget Constrained Network Upgradeable Problems., and . CoRR, (2014)The covert set-cover problem with application to Network Discovery, and . CoRR, (2012)Approximate Clustering., and . Handbook of Approximation Algorithms and Metaheuristics (2), Chapman and Hall/CRC, (2018)The update complexity of selection and related problems., , and . FSTTCS, volume 13 of LIPIcs, page 325-338. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs., , , and . FSTTCS, volume 18 of LIPIcs, page 257-266. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Simple Algorithms for Spanners in Weighted Graphs., and . Encyclopedia of Algorithms, (2016)