We introduce the notion of a rational convex program (RCP) and we classify the known RCPs into two classes: quadratic and logarithmic. The importance...
Informally, an obfuscator O is an (efficient, probabilistic) "compiler" that takes as input a program (or circuit) P and produces a new program O(P) t...
We construct finite groups whose Cayley graphs have large girth even with respect to a discounted distance measure that contracts arbitrarily long seq...
In the renaming task, n+ 1 processes start with unique input names from a large space and must choose unique output names taken from a smaller name sp...
This article presents constructions of useful concurrent data structures, including max registers and counters, with step complexity that is sublinear...
