PPT-Computational and Communication Complexity in Massively Parallel
Computation Grigory Yaroslavtsev Indiana University Bloomington httpgrigoryus Cluster Computation a la BSP Input size n eg n billions of edges in a graph
Download Presentation
"Computational and Communication Complexity in Massively Par " is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.