We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
Paul Christiano, Jonathan A. Kelner, Aleksander Ma...
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriļ...
"Java for the Beginning Programmer teaches Java to someone with absolutely no programming background. This book focuses on core programming topics such as variables, looping, ...
We develop a new approach to image denoising based on complexity regularization. This technique presents a flexible alternative to the more conventional l2 , l1 , and Besov regula...
Taitās method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed Ī»-calculi. Histo...