We present a distributed index data structure and algorithms devised to support parallel query processing of multimedia content in search engines. We present a comparative study wi...
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
We study the classic mathematical economics problem of Bayesian optimal mechanism design where a principal aims to optimize expected revenue when allocating resources to self-inte...
Shuchi Chawla, Jason Hartline, David Malec and Bal...
Although unstructured mesh algorithms are a popular means of solving problems across a broad range of disciplines—from texture mapping to computational fluid dynamics—they ar...
Brian S. White, Sally A. McKee, Bronis R. de Supin...