A unified framework to obtain all known lower bounds (random coding, typical random coding and expurgated bound) on the reliability function of a point-to-point discrete memoryles...
Ali Nazari, Achilleas Anastasopoulos, S. Sandeep P...
A new method for obtaining lower bounds for spherical t-designs is proposed. Applications and new bounds are given for t = 9, 10. Some restrictions on the distribution of the inne...
A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e., s...
This paper addresses the issue of computing the asymptotic worst-case of lower bounds for the Bin Packing Problem. We introduce a general result that allows to bound the asymptoti...
Teodor Gabriel Crainic, Guido Perboli, Miriam Pezz...