Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Work-Preserving Speed-Up of Parallel Matrix Computations

From MaRDI portal
Publication:4852625
Jump to:navigation, search

DOI10.1137/0224051zbMath0830.68059OpenAlexW2083322535MaRDI QIDQ4852625

Pan, Victor Y., Franco P. Preparata

Publication date: 1 November 1995

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0224051

zbMATH Keywords

fast parallel algorithmBrent's scheduling principle


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)


Related Items

Parallel computation of a Krylov matrix for a sparse and structured input, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, Efficient parallel algorithms for computing all pair shortest paths in directed graphs



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4852625&oldid=19199046"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 04:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki