Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Judit Bar‐Ilan, Donald Beaver · 1989
Article Non-cryptographic fault-tolerant computing in constant number of rounds of interaction Share on Authors: J. Bar-Ilan Hebrew University Hebrew UniversityView Profile , D. Beaver Harvard University Harvard UniversityView Profile Authors Info & Claims PODC '89: Proceedings of the eighth annual ACM Symposium on Principles of distributed computingJune 1989 Pages 201–209https://doi.org/10.1145/72981.72995Online:01 June 1989Publication History 163citation1,190DownloadsMetricsTotal Citations163Total Downloads1,190Last 12 Months94Last 6 weeks18 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access