Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)

Hagit Brit, Shlomo Moran · 1994

Article Free Access Share on Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract) Authors: Hagit Brit View Profile , Shlomo Moran Computer Science Department, Technion, Haifa 32000, Israel Computer Science Department, Technion, Haifa 32000, IsraelView Profile Authors Info & Claims PODC '94: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computingAugust 1994 Pages 52–60https://doi.org/10.1145/197917.197950Online:14 August 1994Publication History 6citation196DownloadsMetricsTotal Citations6Total Downloads196Last 12 Months4Last 6 weeks1 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 SiteeReaderPDF

Read the paper · More papers on PaperTik