Making proof-based verified computation almost practical Michael Walfish The University of Texas at Austin.
Probabilistically Checkable Proofs (and inapproximability) Irit Dinur, Weizmann open day, May 1 st 2009.
Making argument systems for outsourced computation practical (sometimes) Srinath Setty, Richard McPherson, Andrew J. Blumberg, and Michael Walfish The.
Making argument systems for outsourced computation practical (sometimes)
Making proof-based verified computation almost practical
