Back to Results
First PageMeta Content
Graph / Neighbourhood / Signed graph / Matching / Degree / Minor / Covering graph / Path decomposition / Graph theory / Mathematics / Theoretical computer science


A Tight Lower Bound for k-Set Agreement Soma Chaudhuri Maurice Herlihyy Abstract: We prove tight bounds on the time needed
Add to Reading List

Document Date: 2007-04-26 00:00:00

Open Document

File Size: 214,62 KB

Share Result on Facebook

City

New York / Cambridge / Reading / Ames / /

Company

Addison-Wesley Publishing Company / SIAM Journal / Database Systems / MIT Laboratory / /

/

Event

FDA Phase / Product Issues / Person Communication and Meetings / /

Facility

Atanaso Hall / Technology Square / Iowa State University / Harvard University / /

IndustryTerm

deterministic protocol / rk processors / unreliable distributed systems / concurrent and distributed computing / r-round full-information protocol / faulty processor / trivial solutions / node representing processor / r-round protocol / adjacent processor / fail-stop processors / adjacent processors / distinct processors / nonfaulty processors / arbitrary protocols / middle processor / nonfaulty processor / asynchronous systems / communication network / connected network / consensus protocol / /

Organization

Harvard University / National Science Foundation / MIT / Yale / Iowa State University / /

Person

Vassos Hadzilacos / Maurice P. Herlihy / Yoram Moses / Nancy A. Lynch / Marshall Pease / Michael S. Paterson / Philip A. Bernstein / Robert Shostak / Michael J. Fischer / Nathan Goodman / Nir Shavit / Mark R. Tuttlex / Mark R. Tuttle / Michael Merritt / Danny Dolev / Leslie Lamport / Cynthia Dwork / Soma Chaudhuri / H. Raymond Strong / /

/

Position

rst author / editor / number mp / mp / /

Product

Pentax K-x Digital Camera / Sperner / processor / MT88 / Cha91 / /

ProvinceOrState

New York / Iowa / Massachusetts / /

PublishedMedium

Journal of the ACM / SIAM Journal on Computing / Theory of Computing / /

Region

Bermuda Triangle / /

Technology

7.2 Processor / 1 processors / one faulty processor / adjacent processor / live processors / two processors / nonfaulty processor / second processor / 1-round protocol / 5 processors / 7.1 Live processors / last two processors / fail-stop processors / consensus protocol / node representing processor / one processor / deterministic protocol / last processor / covered processors / nonfaulty processors / rk processors / middle processor / r-round protocol / 7 Processor / 545 Technology / local processor / /

SocialTag