Madhu Sudan Principal Researcher, Microsoft Research Areas of Special Interests Theory of Computer Science, Algorithms, Computational Complexity, Reliable Communication, Optimization. Ph.D. Title Efficient Checking of Po

First Page		Document Content
Date: 2014-11-22 15:21:13 Symposium on Foundations of Computer Science Symposium on Theory of Computing Madhu Sudan Venkatesan Guruswami Sanjeev Arora Carsten Lund Ran Raz ACM SIGACT Applied mathematics Computer science Mathematical sciences		Madhu Sudan Principal Researcher, Microsoft Research Areas of Special Interests Theory of Computer Science, Algorithms, Computational Complexity, Reliable Communication, Optimization. Ph.D. Title Efficient Checking of Po Add to Reading List Source URL: people.csail.mit.edu Download Document from Source Website File Size: 78,44 KB Share Document on Facebook

	2008 49th Annual IEEE Symposium on Foundations of Computer Science (Acyclic) Job Shops are Hard to Approximate Monaldo Mastrolilli and Ola Svensson IDSIA Lugano, Switzerland, DocID: 1u8I9 - View Document
	A Preliminary version of this paper appeared in Proceedings of the 31st Annual IEEE Symposium on the Foundations of Computer Science, IEEERandomness in Interactive Proofs Mihir Bellare DocID: 1tSZ2 - View Document
	T The Κ 50th Annual Symposium on Foundations of Computer Science, FOCSIEEE Computer Society, pp. 629–638, 2009. DocID: 1t4Ps - View Document
	2016 IEEE 57th Annual Symposium on Foundations of Computer Science Approximate Gaussian Elimination for Laplacians – Fast, Sparse, and Simple Rasmus Kyng, Sushant Sachdeva Department of Computer Science DocID: 1t1ua - View Document
	Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing. DocID: 1rgOi - View Document