This paper provides analysis to a generalized version of the coupon collector problem, in which the collector gets d coupons each run and he chooses the one that he has the least ...
: This work deals with a classic problem: "Given a set of coins among which there is a counterfeit coin of a different weight, find this counterfeit coin using ordinary balanc...
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...
This paper defines a framework in which one can formalize a variety of authorization and policy issues that arise in access control of shared computing resources. Instantiations ...
Stefan Schwoon, Somesh Jha, Thomas W. Reps, Stuart...
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...