{"id":137,"date":"2023-02-06T11:23:00","date_gmt":"2023-02-06T11:23:00","guid":{"rendered":"https:\/\/engineering.purdue.edu\/ECECompSeminar\/?p=137"},"modified":"2026-03-31T19:22:14","modified_gmt":"2026-03-31T19:22:14","slug":"some-recent-combinatorial-algorithms-in-tournament-scheduling-and-secret-sharing","status":"publish","type":"post","link":"https:\/\/engineering.purdue.edu\/ECECompSeminar\/2023\/02\/06\/some-recent-combinatorial-algorithms-in-tournament-scheduling-and-secret-sharing\/","title":{"rendered":"Some Recent Combinatorial Algorithms in Tournament Scheduling and Secret Sharing"},"content":{"rendered":"\n<h4 class=\"wp-block-heading\">Abstract<\/h4>\n\n\n\n<p>For tournament scheduling, we consider scheduling of round robin home &#8211; 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.<\/p>\n\n\n\n<p>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 &lt; k. When I = k-1, it is the usual threshold (n, k) scheme. We provide new constructions for the ramp scheme.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Biography<\/h4>\n\n\n\n<p>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 &#8211; 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.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Video\/Pictures <\/h4>\n\n\n\n<figure class=\"wp-block-image size-post-thumbnail\"><img loading=\"lazy\" decoding=\"async\" width=\"850\" height=\"550\" src=\"https:\/\/engineering.purdue.edu\/ECECompSeminar\/wp-content\/uploads\/2023\/02\/PXL_20230206_172144502-850x550.jpg\" alt=\"\" class=\"wp-image-142\"\/><\/figure>\n\n\n\n<figure class=\"wp-block-image size-post-thumbnail\"><img loading=\"lazy\" decoding=\"async\" width=\"850\" height=\"550\" src=\"https:\/\/engineering.purdue.edu\/ECECompSeminar\/wp-content\/uploads\/2023\/02\/PXL_20230206_172132054-850x550.jpg\" alt=\"\" class=\"wp-image-141\"\/><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>For tournament scheduling, we consider scheduling of round robin home &#8211; away tournament where each team plays at most k consecutive home\/away games. The<br \/>\nhardness of this problem is discussed and some results for k = 2, 3 and greater than 3<br \/>\nare presented as separate cases.<\/p>\n","protected":false},"author":1,"featured_media":138,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"_eb_attr":"","footnotes":""},"categories":[5],"tags":[],"class_list":["post-137","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-spring-2023"],"acf":[],"_links":{"self":[{"href":"https:\/\/engineering.purdue.edu\/ECECompSeminar\/wp-json\/wp\/v2\/posts\/137","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/engineering.purdue.edu\/ECECompSeminar\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/engineering.purdue.edu\/ECECompSeminar\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/engineering.purdue.edu\/ECECompSeminar\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/engineering.purdue.edu\/ECECompSeminar\/wp-json\/wp\/v2\/comments?post=137"}],"version-history":[{"count":11,"href":"https:\/\/engineering.purdue.edu\/ECECompSeminar\/wp-json\/wp\/v2\/posts\/137\/revisions"}],"predecessor-version":[{"id":170,"href":"https:\/\/engineering.purdue.edu\/ECECompSeminar\/wp-json\/wp\/v2\/posts\/137\/revisions\/170"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/engineering.purdue.edu\/ECECompSeminar\/wp-json\/wp\/v2\/media\/138"}],"wp:attachment":[{"href":"https:\/\/engineering.purdue.edu\/ECECompSeminar\/wp-json\/wp\/v2\/media?parent=137"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/engineering.purdue.edu\/ECECompSeminar\/wp-json\/wp\/v2\/categories?post=137"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/engineering.purdue.edu\/ECECompSeminar\/wp-json\/wp\/v2\/tags?post=137"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}