/
Lower Bounds on the Communication of Distributed Graph Algo Lower Bounds on the Communication of Distributed Graph Algo

Lower Bounds on the Communication of Distributed Graph Algo - PowerPoint Presentation

ellena-manuel
ellena-manuel . @ellena-manuel
Follow
412 views
Uploaded On 2016-03-07

Lower Bounds on the Communication of Distributed Graph Algo - PPT Presentation

Progress and Obstacles Rotem Oshman ADGA 2013 Overview Network Models CONGESTED CLIQUE ASYNC MESSAGEPASSING LOCAL CONGEST general network X Talk Overview Lower bound techniques CONGEST general networks reductions from 2party communication complexity ID: 246041

communication partition message layer partition communication layer message information circuit complexity tree congested bound passing clique cost disj diameter

Share:

Link:

Embed:

Download Presentation from below link

Download Presentation The PPT/PDF document "Lower Bounds on the Communication of Dis..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.


Presentation Transcript