| Document Date: 2011-08-06 04:11:13
Open Document File Size: 208,34 KBShare Result on Facebook
City Berlin / Kolkata / Toronto / / Country Canada / India / / / Facility Carleton University / Indian Statistical Institute / / IndustryTerm in-place algorithms / inplace min-max priority search tree / inplace algorithm / low memory algorithms / sensor network applications / Space-efficient planar convex hull algorithms / Constant working-space algorithms / binary search / space algorithm / lowmemory algorithms / Space-efficient geometric divide-and-conquer algorithms / verification algorithms / in-place geometric algorithms / priority search tree / in-place algorithm / space-efficient algorithm / physical design applications / / Organization Carleton University / Indian Statistical Institute / / PublishedMedium Theoretical Computer Science / / Technology low memory algorithms / VLSI chip / 3-D / in-place algorithms / verification algorithms / Constant working-space algorithms / time algorithm / inplace algorithm / GPS / J. Algorithms / proposed algorithms / planar convex hull algorithms / extra space algorithm / 2.1 Algorithm / geometric divide-and-conquer algorithms / two algorithms / in-place geometric algorithms / in-place algorithm / /
SocialTag |
CCCG 2011, Toronto ON, August 10–12, 2011 Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D Minati De∗†