1988 · 26 citations · 20 references
ComputingComputer ScienceDistributed SystemsParallel AlgorithmsParallel ComputingData ParallelismParallel ArchitecturesParallel ComputationParallel Performance AnalysisTask ParallelismParallel Algorithm AnalysisParallel Performance OptimizationParallel Speedup Analysis
Article Free Access Share on Using smoothness to achieve parallelism Authors: Leonard Adleman Department of Computer Science, University of Southern California Department of Computer Science, University of Southern CaliforniaView Profile , Kireeti Kompella Department of Computer Science, University of Southern California Department of Computer Science, University of Southern CaliforniaView Profile Authors Info & Claims STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computingJanuary 1988 Pages 528–538https://doi.org/10.1145/62212.62264Published:01 January 1988Publication History 12citation435DownloadsMetricsTotal Citations12Total Downloads435Last 12 Months32Last 6 weeks6 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
20
Riemann's hypothesis and tests for primality
Gary L. Miller · Journal of Computer and System Sciences · 1976 · 717 citations
Sorting inc logn parallel steps
Miklós Ajtai, János Komlós, Endre Szemerédi · COMBINATORICA · 1983 · 513 citations
Walter L. Ruzzo · Journal of Computer and System Sciences · 1981 · 434 citations
Fast Parallel Matrix Inversion Algorithms
L. Csanky · SIAM Journal on Computing · 1976 · 403 citations