Song, Y., & Pike, S. M. (2010). The weakest failure detector for solving wait-free, eventually bounded-fair dining philosophers. [Texas A&M University].
Chicago Style (17th ed.) CitationSong, Yantao, and Scott M. Pike. The Weakest Failure Detector for Solving Wait-free, Eventually Bounded-fair Dining Philosophers. [College Station, Tex.]: [Texas A&M University], 2010.
MLA (9th ed.) CitationSong, Yantao, and Scott M. Pike. The Weakest Failure Detector for Solving Wait-free, Eventually Bounded-fair Dining Philosophers. [Texas A&M University], 2010.
Warning: These citations may not always be 100% accurate.