Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
19
click to vote
JACM
2000
favorite
Email
discuss
report
50
views
more
JACM 2000
»
Tight bounds for k-set agreement
13 years 8 months ago
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
more »
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)
Researcher Info
JACM 2008 Study Group
Computer Vision