Robust algorithms for constructing strongly convex hulls in parallel

Author： Chen W.   Wada K.   Kawaguchi K.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 277-295

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Efficient parallel algorithms for doubly convex-bipartite graphs

By Chang-Wu Y.   Gen-Huey C.  

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 249-265

Elsevier

Access to resources Recommend Favorite

Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems

By Sen S.  

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 59-78

Elsevier

Access to resources Recommend Favorite

Localised convex hulls to identify boundary nodes in sensor networks

By Fayed Marwan   Mouftah Hussein T.  

International Journal of Sensor Networks, Vol. 5, Iss. 2, 2009-04 ,pp. : 112-125

Inderscience Publishers

Access to resources Recommend Favorite

Robust Algorithms for Preemptive Scheduling

By Epstein Leah   Levin Asaf  

Algorithmica, Vol. 69, Iss. 1, 2014-05 ,pp. : 26-57

Springer Publishing Company

Access to resources Recommend Favorite

On constructing quasi-optimal robust systems

By Zotov M.  

Journal of Computer and Systems Sciences International, Vol. 52, Iss. 5, 2013-09 ,pp. : 677-685

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite