Distributed Computing FS 2012 Prof. R. Wattenhofer Stephan Holzer

First Page		Document Content
Date: 2014-09-26 08:28:47 NP-complete problems Dominating set Chernoff bound Tango tree Theoretical computer science Mathematics Computational complexity theory		Distributed Computing FS 2012 Prof. R. Wattenhofer Stephan Holzer Add to Reading List Source URL: dcg.ethz.ch Download Document from Source Website File Size: 377,04 KB Share Document on Facebook

	Reconstructive Dispersers and Hitting Set Generators Christopher Umans? Computer Science Department California Institute of Technology Pasadena CA 91125 DocID: 1pzAr - View Document
	Spectral Graph Theory Lecture 17 Sparsification by Effective Resistance Sampling Daniel A. Spielman DocID: 1psXs - View Document
	JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Faster Algorithms for Testing under Conditional Sampling Moein Falahatgar Ashkan Jafarpour Alon Orlitsky DocID: 1pgGZ - View Document
	Tight Bounds for Parallel Randomized Load Balancing Christoph Lenzen, Roger Wattenhofer {lenzen,wattenhofer}@tik.ee.ethz.ch arXiv:1102.5425v1 [cs.CC] 26 Feb 2011 DocID: 1p7SC - View Document
	Efficient Sampling Methods for Discrete Distributions Karl Bringmann and Konstantinos Panagiotou Max Planck Institute for Informatics Campus E1.4, 66123 Saarbr¨ ucken, Germany DocID: 1oabV - View Document