Abstract
For tournament scheduling, we consider scheduling of round robin home – away tournament where each team plays at most k consecutive home/away games. The hardness of this problem is discussed and some results for k = 2, 3 and greater than 3 are presented as separate cases.
For the secret sharing problem, we consider the ramp scheme where a secret is shared amongst n participants in such a way that k or more shares put together can reconstruct the secret while less than or equal to I shares cannot reconstruct, I < k. When I = k-1, it is the usual threshold (n, k) scheme. We provide new constructions for the ramp scheme.
Biography
Dr. Bimal Roy obtained B. Stat. and M. Stat. degrees from the Indian Statistical Institute, Kolkata, and a PhD degree from the University of Waterloo, Canada. He is currently a Professor at the Indian Statistical Institute, Kolkata, after having been its director during 2010-15, and was chairman of the National Statistical Commission during 2019-22. Dr. Roy has received the IBM Faculty Award, C.R. Rao Lifetime Achievement award, NASI – RELIANCE Platinum Jubilee Award and, in 2015, the Padma Shri award from the Government of India. His research interests include Cryptology, Combinatorics, Algorithms, and Statistical Methods.
Video/Pictures
