Back to Results
First PageMeta Content
Spanning tree / NP-complete problems / Analysis of algorithms / Graph coloring / Computational complexity theory / Minimum spanning tree / Property testing / Time complexity / Connectivity / Theoretical computer science / Graph theory / Mathematics


Document Date: 2005-09-06 20:30:35

Open Document

File Size: 160,50 KB

Share Result on Facebook

City

Geneva / Dordrecht / New York / Philadelphia / Berlin / /

Company

Cambridge University Press / Cdw / /

Country

Netherlands / Sudan / United Kingdom / /

/

Facility

Princeton University / University of California / NEC Research Institute / /

IndustryTerm

oblivious algorithm / probabilistic algorithm / even constant time algorithms / approximation algorithm / adaptive algorithm / connected-components algorithm / minimum spanning tree algorithm / randomized linear-time algorithm / above algorithm / rst search / approximation algorithms / sublinear time algorithms / linear time algorithm / Property testing algorithms / deterministic algorithm / /

Organization

Cambridge University / University of California / National Science Foundation / MIT / Princeton University / Department of Electrical Engineering and Computer Science / Computer Science Division / Department of Computer Science / Society for Industrial / NEC Research Institute / /

Person

LUCA TREVISAN / David Silver / /

/

Position

author / /

ProgrammingLanguage

D / /

ProvinceOrState

New Jersey / New York / California / Massachusetts / /

Technology

Trans-dichotomous algorithms / above algorithm / randomized algorithm / even constant time algorithms / sublinear time algorithms / MST algorithm / Monte-Carlo algorithms / probabilistic algorithm / minimum spanning tree algorithm / main algorithm / Property testing algorithms / approximation algorithm / connected-components algorithm / approximation algorithms / linear time algorithm / oblivious algorithm / adaptive algorithm / randomized linear-time algorithm / G. Our algorithm / /

URL

http /

SocialTag