A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
One of the crucial elements in the Internet’s success is its ability to adequately control congestion. This paper defines and solves several optimization problems related to In...
Richard M. Karp, Elias Koutsoupias, Christos H. Pa...
We prove that Best Fit bin packing has linear waste on the discrete distribution Ufj kg (where items are drawn uniformly from the set f1=k 2=3 j=kg) for sufficiently large k when...
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...