We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1, . . . , fk and ...
Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevit...
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
Students need to learn testing skills, and using test-driven development on assignments is one way to help students learn. We use a flexible automated grading system called Web-CA...
Modern software development companies that have a quality assurance program use measurements and standards to improve product quality as perceived by the users of these products. H...