Distinguished Lecture Series

 

"Randomized Shellsort: A Simple Oblivious Sorting Algorithm"

Michael Goodrich, University of California, Irvine

Tuesday, October 20, 2009 at 4:00 P.M.

Room 368 (CIT 3rd floor)

In this paper, we describe randomized Shellsort--a simple, randomized, data-oblivious version of the Shellsort algorithm that always runs in O(n log n) time and, as we show, succeeds in sorting any given input permutation with very high probability. Thus, randomized Shellsort is simultaneously simple, time-optimal, and data-oblivious. Taken together, these properties imply applications in the design of new efficient privacy-preserving computations based on the secure multi-party computation (SMC) paradigm. In addition, by a trivial conversion of this Monte Carlo algorithm to its Las Vegas equivalent, one gets the first version of Shellsort with a running time that is provably O(n log n) with very high probability.

A reception will follow in the atrium.

Host: Roberto Tamassia

To watch part one of this lecture, please click here.

To watch part two of this lecture, please click here.

To watch part three of this lecture, please click here.

To watch part four of this lecture, please click here.

To watch part five of this lecture, please click here.

To watch part six of this lecture, please click here.