( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization.

, и . SCG, стр. 193-200. ACM, (1988)

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.

Sandeep Sadanandan

Sandeep Kumar

Sandeep Nambiar

Sandeep Ameta

Sandeep Pal

 

Другие публикации лиц с тем же именем

Fair adaptive bandwidth allocation: a rate control based active queue management discipline., , , и . Comput. Networks, 44 (2): 135-152 (2004)The update complexity of selection and related problems., , и . FSTTCS, том 13 из LIPIcs, стр. 325-338. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs., , , и . FSTTCS, том 18 из LIPIcs, стр. 257-266. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Simple Algorithms for Spanners in Weighted Graphs., и . Encyclopedia of Algorithms, (2016)Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model., и . SPAA, стр. 74-76. ACM, (2012)The covert set-cover problem with application to Network Discovery, и . CoRR, (2012)Approximation Algorithms for Budget Constrained Network Upgradeable Problems., и . CoRR, (2014)Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems., и . SIAM J. Comput., 21 (3): 466-485 (1992)Erratum: SIAM J. Comput. 23(2): 447-448 (1994).Parallel Searching in Generalized Monge Arrays., , , и . Algorithmica, 19 (3): 291-317 (1997)On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm., и . J. Algorithms, 25 (1): 177-193 (1997)