Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.

First Page		Document Content
Date: 2014-04-12 08:04:57 Theoretical computer science Lance Fortnow Probabilistic complexity theory Carsten Lund Computer science IP BPP Probabilistically checkable proof Symposium on Foundations of Computer Science Mathematics		Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing. Add to Reading List Source URL: people.cs.uchicago.edu Download Document from Source Website File Size: 94,00 KB Share Document on Facebook

	Method for High Accuracy Multiplicity Correlation Measurements Carsten Søgaard Lund University, Sweden DocID: 1uf8d - View Document
	Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing. DocID: 1rgOi - View Document
	Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192. DocID: 1oP1q - View Document
	FlowRoute: Inferring Forwarding Table Updates Using Passive Flow-level Measurements Amogh Dhamdhere Lee Breslau, Nick Duffield, Cheng Ee, Alexandre Gerber, Carsten Lund, DocID: 1leQR - View Document
	Scalable VPN Routing via Relaying Changhoon Kim Alexandre Gerber Carsten Lund DocID: 1lcn9 - View Document