scientific article; zbMATH DE number 1754593

zbMATH Open0986.68953MaRDI QIDQ4535018FDOQ4535018

Authors: Alexander Tiskin 

Publication date: 12 June 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760178

Title of this publication is not available (Why is that?)

Recommendations

• Efficient algorithms for the shortest paths and minimum spanning tree on the BSP model
• The bulk-synchronous parallel random access machine
• Direct bulk-synchronous parallel algorithms
• Memory-efficient matrix multiplication in the BSP model
• Communication efficient BSP algorithm for all nearest smaller values problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Parallel algorithms in computer science (68W10)

Cited In (4)

• Delta-stepping synchronous parallel model
• Communication efficient BSP algorithm for all nearest smaller values problem
• Sparse matrix multiplication and triangle listing in the congested clique model
• Efficient algorithms for the shortest paths and minimum spanning tree on the BSP model

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4535018)