Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast Shlomi Dolev1 , Seth Gilbert2 , Majid Khabbazian3 , and Calvin Newport4 ? 1 Ben-Gurion University, Beersheba, Israel

First Page		Document Content
Date: 2011-11-17 23:45:03 Analysis of algorithms Information theory Probabilistic complexity theory Randomized algorithm Algorithm SL Time complexity Channel Theoretical computer science Computational complexity theory Applied mathematics		Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast Shlomi Dolev1 , Seth Gilbert2 , Majid Khabbazian3 , and Calvin Newport4 ? 1 Ben-Gurion University, Beersheba, Israel Add to Reading List Source URL: www.comp.nus.edu.sg Download Document from Source Website File Size: 278,42 KB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document