Michael Anderson CommunicationAvoiding Algorithms CS294 Fall 2011 Sources J W Hong and H T Kung IO complexity The redblue pebble game In STOC 81 Proceedings of the thirteenth annual ACM symposium on Theory of computing pages 326333 New York NY USA 1981 ACM ID: 362291
Download Presentation The PPT/PDF document "Communication Lower Bound for the Fast F..." 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.
