The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers

Yantao Song. The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers. PhD thesis, Texas A&M University, College Station, USA, 2010. [doi]

@phdthesis{basesearch-2582,
  title = {The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers},
  author = {Yantao Song},
  year = {2010},
  url = {https://www.base-search.net/Record/4d2f506e785721fd05b775a0b880c72d2dbc99dac6aaa3f1109a68a647d33648},
  note = {base-search.net (fttexasamuniv:oai:oaktrust.library.tamu.edu:1969.1/ETD-TAMU-2008-12-112)},
  researchr = {https://researchr.org/publication/basesearch-2582},
  cites = {0},
  citedby = {0},
  school = {Texas A&M University, College Station, USA},
}