Back to Results
First PageMeta Content
Computational complexity theory / Probabilistic complexity theory / Randomized algorithm / Algorithm / SL / Immerman–Szelepcsényi theorem / In-place algorithm / Theoretical computer science / Applied mathematics / Analysis of algorithms


Efficient Adaptive Collect using Randomization Hagit Attiya1 , Fabian Kuhn2 , Mirjam Wattenhofer2 , and Roger Wattenhofer2 1 2 Department of Computer Science, Technion
Add to Reading List

Document Date: 2004-08-13 15:01:47


Open Document

File Size: 138,41 KB

Share Result on Facebook

Currency

pence / GBP / /

IndustryTerm

randomized collect algorithms / deterministic algorithms / actual algorithm / matrix algorithm / collect algorithm / wait-free collect algorithms / adaptive algorithms / adaptive algorithm / linear collect algorithm / deterministic collect algorithm / cascaded-trees algorithm / basic collect algorithm / adaptive collect algorithms / cascaded trees algorithm / deterministic algorithm / polynomial-memory algorithms / collect algorithms / wait-free algorithms / typical indulgent consensus algorithm / adaptive shared-memory algorithms / /

Organization

Department of Computer Science / Technion Department of Computer Science / V (pi ) / /

Position

adversarial scheduler / /

Product

Pentax K-x Digital Camera / /

Technology

randomized collect algorithms / adaptive shared-memory algorithms / linear collect algorithm / matrix algorithm / randomized algorithms / cascaded-trees algorithm / adaptive collect algorithms / deterministic algorithm / collect algorithm / known collect algorithms / basic collect algorithm / known deterministic algorithms / typical indulgent consensus algorithm / Algorithm The algorithm / second algorithm / adaptive algorithm / previous polynomial-memory algorithms / deterministic collect algorithm / wait-free algorithms / cascaded trees algorithm / actual algorithm / adaptive / wait-free collect algorithms / two algorithms / /

SocialTag