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

First Page		Document Content
Date: 2015-04-30 10:33:59 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Consensus Algorithm Time complexity Adversary model Logarithm Theoretical computer science Computational complexity theory Applied mathematics		Sub-Logarithmic Test-and-Set Against a Weak Adversary? Dan Alistarh1 and James Aspnes2 1 2 Add to Reading List Source URL: cs-www.cs.yale.edu Download Document from Source Website File Size: 305,90 KB Share Document on Facebook

	Competitive Online Algorithms Susanne Albers Overview arrive one by one and must be scheduled immediately DocID: 1ri9G - View Document
	Charles University in Prague Faculty of Mathematics and Physics DOCTORAL THESIS Jan Bul´anek DocID: 1r6w8 - View Document
	Online Algorithms: A Study of Graph-Theoretic Concepts Susanne Albers Max-Planck-Institut fur Informatik, Im Stadtwald, 66123 Saarbrucken, Germany. , http://www.mpi-sb.mpg.de/~ albers/ DocID: 1r4RN - View Document
	C:/Users/Bin Zan/Dropbox/typeinst/IEEE6page.dvi DocID: 1qYAD - View Document
	The 2011 Military Communications Conference - Track 3 - Cyber Security and Network Operations Multi-node Coordinated Jamming for Location Privacy Protection Sangho Oh DocID: 1qr3M - View Document