Mike Burmester, Yvo Desmedt, Yongge Wang. Using Approximation Hardness to Achieve Dependable Computation. In Michael Luby, José D. P. Rolim, Maria J. Serna, editors, Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM 98, Barcelona, Spain, October 8-10, 1998, Proceedings. Volume 1518 of Lecture Notes in Computer Science, pages 172-186, Springer, 1998. [doi]
@inproceedings{BurmesterDW98,
title = {Using Approximation Hardness to Achieve Dependable Computation},
author = {Mike Burmester and Yvo Desmedt and Yongge Wang},
year = {1998},
url = {http://link.springer.de/link/service/series/0558/bibs/1518/15180172.htm},
researchr = {https://researchr.org/publication/BurmesterDW98},
cites = {0},
citedby = {0},
pages = {172-186},
booktitle = {Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM 98, Barcelona, Spain, October 8-10, 1998, Proceedings},
editor = {Michael Luby and José D. P. Rolim and Maria J. Serna},
volume = {1518},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-65142-X},
}