Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

JACM
2000

favoriteEmaildiscussreport

50views more JACM 2000»

Tight bounds for k-set agreement

13 years 4 months ago

Tight bounds for k-set agreement

Download www.markrtuttle.com

Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M

Real-time Traffic

JACM 2000 |

claim paper

Related Content

» A Tight Lower Bound for kSet Agreement

» Solving kSet Agreement with Stable Skeleton Graphs

» The Bare BoundedStorage Model The Tight Bound on the Storage Requirement for Key Agreement

» Key agreement from weak bit agreement

» Complexity versus Agreement for Many Views

» Of Choices Failures and Asynchrony The Many Faces of Set Agreement

» Lower Bounds on Implementing Robust and Resilient Mediators

» Competitive minimax universal decoding for several ensembles of random codes

» Optimal Efficiency of Optimistic Contract Signing

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	JACM
Authors	Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle

Comments (0)