Sub-Logarithmic Test-and-Set Against a Weak Adversary? Dan Alistarh1 and James Aspnes2 1 2 - Probabilistic analysis of algorithms - Document - PDFSEARCH.IO

First Page	Meta Content
	Sub-Logarithmic Test-and-Set Against a Weak Adversary? Dan Alistarh1 and James Aspnes2 1 2 Add to Reading List Document Date: 2015-04-30 10:33:59 Open Document File Size: 305,90 KB Share Result on Facebook IndustryTerm consensus algorithms / distributed computing problems / adaptive test-andset protocol / read-write algorithms / test-and-set algorithm / randomized consensus protocols / multi-use test-and-set algorithm / randomized test-and-set algorithm / / Organization National Science Foundation / Yale University / / Person James Aspnes / Dan Alistarh / / Position scheduler / / Technology read-write algorithms / 2-process randomized consensus protocols / RatRace protocol / consensus algorithms / randomized read-write algorithms / adaptive test-andset protocol / randomized test-and-set algorithm / Sift algorithm / shared memory / 4 Test-and-Set Algorithm / test-and-set algorithm / multi-use test-and-set algorithm / / SocialTag Analysis of algorithms Probabilistic complexity theory Randomized algorithm Consensus Algorithm Time complexity Adversary model Logarithm Theoretical computer science Computational complexity theory

Sub-Logarithmic Test-and-Set Against a Weak Adversary? Dan Alistarh1 and James Aspnes2 1 2Add to Reading List