Software SeminarCombinatorial Solutions for the Generalized Russian Cards ProblemDr. Colleen SwansonUniversity of Waterloo (Canada) |
|
Friday, June 14, 2013 10:30am - 11:30am 4901 BBB Add to Google Calendar |
About the EventIn the generalized Russian cards problem, three players, Alice, Bob, and Cathy, are dealt a deck of N cards, each given A, B, and C cards, respectively. The goal is for Alice and Bob to learn each other's hands via public communication, without Cathy learning the card deal. A special case of this problem, where (A,B,C) = (3,3,1), first appeared in the 2000 Moscow Mathematics Olympiad. |
BiographyColleen Swanson received her master's degree in Combinatorics and Optimization at the University of Waterloo (Canada) and recently defended her Ph.D. in Computer Science, also at University of Waterloo. Her research to date has focused on information-theoretic and combinatorial cryptography, and her current research interests span a wide range of problems in computer security and privacy. |
Additional InformationContact: Stephen Reger Phone: 734-764-9401 Email: sereger@eecs.umich.edu Sponsor(s): SSL Open to: Public |