Exact time bounds for computing boolean functions on PRAMs without simultaneous writes
Martin Dietzfelbinger, Mirosław Kutyłowski, R. Reischuk · 1990
Article Free Access Share on Exact time bounds for computing boolean functions on PRAMs without simultaneous writes Authors: M. Dietzfelbinger Universität-GH-Paderborn, F.R.G. Universität-GH-Paderborn, F.R.G.View Profile , M. Kutylowski University of Wroclaw, Poland University of Wroclaw, PolandView Profile , R. Reischuk Technische Hochschule Darmstadt, F.R.G. Technische Hochschule Darmstadt, F.R.G.View Profile Authors Info & Claims SPAA '90: Proceedings of the second annual ACM symposium on Parallel algorithms and architecturesMay 1990 Pages 125–135https://doi.org/10.1145/97444.97678Published:01 May 1990Publication History 14citation271DownloadsMetricsTotal Citations14Total Downloads271Last 12 Months10Last 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 SiteeReaderPDF