Indian Statistical Institute / College of Judea / Simon Fraser University / University of Lethbridge / University Drive / /
IndustryTerm
space solution / search process / transportation / parametric search technique / polygonal chain / serial algorithms / divide-and-conquer algorithm / feasibility test algorithm / sequential algorithm / computing / parallel algorithm / parallel computation algorithms / /
Organization
Computing and Microelectronics Unit / School of Computing Science / College of Judea and Samaria / Department of Computer Science / University of Lethbridge / Simon Fraser University / Indian Statistical Institute / /
Person
M. Smid / J. Sellen / Boaz Ben-Moshe / Int / Sandip Das‡ Daya / Christian Thiel / / /
Position
representative / /
ProvinceOrState
Alberta / British Columbia / Ontario / /
Technology
sequential algorithm / parallel computation algorithms / 9 The feasibility test algorithm / time algorithm / parallel algorithm / time algorithms / divide-and-conquer algorithm / /
CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Computing a planar widest empty α-siphon in o(n3) time Boaz Ben-Moshe∗ Binay K. Bhattacharya† Sandip Das‡ Daya R Gaur§ and Qiaosheng Shi¶ Abstract