Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
In many modern data management settings, data is queried from a central node or nodes, but is stored at remote sources. In such a setting it is common to perform "pushstyle&qu...
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Ni...
We describe a method of representing human activities that allows a collection of motions to be queried without examples, using a simple and effective query language. Our approach...
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...