A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Declarative languages have recently been proposed for many new applications outside of traditional data management. Since these are relatively early research efforts, it is import...
Tyson Condie, David Chu, Joseph M. Hellerstein, Pe...
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
Abstract—We investigate the design of declarative, domain-specific languages for constructing interactive visualizations. By separating specification from execution, declarativ...