Back to Results
First PageMeta Content
Soft heap / Binomial heap / Binary trees / Heap / Priority queue / D-ary heap / Tree / Minimum spanning tree / Nim / Graph theory / Mathematics / Data structures


Document Date: 2009-02-20 14:49:07

Open Document

File Size: 388,51 KB

Share Result on Facebook

Company

SIAM Journal / Cambridge University Press / MIT Press / /

Country

Israel / /

/

Facility

Tel Aviv University / /

IndustryTerm

deterministic comparison-based algorithm / minimum spanning tree algorithm / car-pool / linear-time median selection algorithm / minimum spanning tree algorithms / car-pooling / randomized linear time algorithm / nd additional applications / /

Organization

School of Computer Science / Cambridge University / MIT / Tel Aviv University / Tel Aviv / /

Person

Haim Kaplan / Uri Zwick Abstract Chazelle / R.W. Floyd / V / Bob Tarjan / /

/

Product

k + 8 / /

PublishedMedium

SIAM Journal on Computing / Journal of the ACM / Communications of the ACM / /

Technology

Randomized minimum spanning tree algorithms / deterministic comparison-based algorithm / randomized linear time algorithm / linear-time median selection algorithm / known deterministic comparison-based algorithm / pdf / minimum spanning tree algorithm / /

URL

http /

SocialTag