Back to Results
First PageMeta Content
Search algorithms / Discrete geometry / Computational geometry / Sorting algorithms / Analysis of algorithms / Binary logarithm / Voronoi diagram / Point location / Nearest neighbor search / Mathematics / Information science / Geometry


Document Date: 2008-09-23 18:57:51

Open Document

File Size: 293,73 KB

Share Result on Facebook

City

Waterloo / Cambridge / /

Company

Artificial Intelligence Laboratory / /

Country

Canada / United States / /

/

Facility

University of Waterloo / /

IndustryTerm

theoretical algorithms / faster solutions / exponential search trees / multiway search / binary search / Internet routers / approximate nearest neighbor search / subsequent applications / comparison-based algorithms / search strategy / minimum spanning tree algorithm / integer search rising / linear-space deterministic and randomized algorithms / faster exact transdichotomous algorithms / b-ary search / predecessor search / nearest neighbor search / /

Organization

School of Computer Science / MIT / University of Waterloo / /

Person

Rabin / Jonathan Shewchuk / Van Emde Boas / /

Position

first author / second author / model for bounded precision / /

ProgrammingLanguage

C / /

ProvinceOrState

Illinois / Ontario / Massachusetts / /

Technology

RAM / word-RAM algorithms / RAM algorithms / Internet routers / 3-d / time algorithm / comparison-based algorithms / 2-d approximate Euclidean minimum spanning tree algorithm / linear-space deterministic and randomized algorithms / Random Access / 4 2.2 RAM Algorithms / faster word-RAM algorithms / /

SocialTag