Back to Results
First PageMeta Content
Theoretical computer science / Sorting algorithms / Operations research / Parallel computing / Quicksort / Science / Algorithm / Speedup / Divide and conquer algorithm / Mathematics / Convex hull algorithms / Applied mathematics


CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull Problem ∗ Stefan N¨ aher
Add to Reading List

Document Date: 2008-10-29 00:00:30


Open Document

File Size: 109,57 KB

Share Result on Facebook

Company

SUN Enterprise / Cambridge University Press / Intel / /

Country

Germany / /

/

Facility

Core Standard Template Library / MCSTL library / square GW / University of Trier / /

IndustryTerm

quad-core processor / random incremental construction algorithm / serial algorithm / incremental algorithms / quickhull algorithm / computing / development software / convex hull algorithm / convex hull algorithms / /

OperatingSystem

Linux / /

Organization

Cambridge University / University of Trier / /

Person

Grant Na / Johannes Singler / Felix Putze / Peter Sanders / Daniel Schmitt / /

/

Product

Quicksort / /

ProgrammingLanguage

C++ / /

RadioStation

Core / /

Technology

two convex hull algorithms / Incremental Convex Hull Algorithms / Linux / serial algorithm / Quickhull algorithm / D&C algorithms / random access / Gift Wrapping algorithm / shared memory / random incremental construction algorithm / convex hull algorithm / 4 Algorithms / three Sorting Algorithms / /

SocialTag