1999•Unpublished venueRequires access
Sequentially consistent versus linearizable counting networks
Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld
Open publisher page 8 citations
Abstract
Article Sequentially consistent versus linearizable counting networks Share on Authors: Marios Mavronicolas Department of Computer Science and Engineering, University of Connecticut, Storrs, CT Department of Computer Science and Engineering, University of Connecticut, Storrs, CTView Profile , Michael Merritt AT&T Labs - Research, 180 Park Avenue, Florham Park, NJ AT&T Labs - Research, 180 Park Avenue, Florham Park, NJView Profile , Gadi Taubenfeld The Open University, 16 Klausner St., Tel-Aviv 61392, Israel The Open University, 16 Klausner St., Tel-Aviv 61392, IsraelView Profile Authors Info & Claims PODC '99: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computingMay 1999 Pages 133–142https://doi.org/10.1145/301308.301342Online:01 May 1999Publication History 5citation224DownloadsMetricsTotal Citations5Total Downloads224Last 12 Months1Last 6 weeks0 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