## Past Events › RTG - Grad Students event

### Events List Navigation

## Introduction to Lopez’s talk for graduate students

by Travis Baumbaugh

Find out more »## Nigel Boston – University of Wisconsin – Madison

Overview of Applied Algebra I shall give a somewhat personal introduction to applied algebra, starting with coding theory and cryptography and then leading to a wide variety of topics.

Find out more »## Nigel Boston – University of Wisconsin – Madison

Entropy Regions and the Four-Atom Conjecture I shall introduce entropy regions, motivated by network coding, and then note how they are equiv- alent to something in finite group theory, allowing us to address fundamental questions regarding these regions.

Find out more »## Nigel Boston – University of Wisconsin – Madison

Low-Rank Matrix Completion I shall describe recommender systems such as Netflix, which seek to complete arrays from sparse data, and explain our recent work using algebraic geometry to obtain uniqueness results.

Find out more »## Nigel Boston – University of Wisconsin – Madison

Belgian Chocolate Problem I shall introduce the Belgian Chocolate Problem, a question from robust control theory amenable to algebraic attack and mysteriously connected to the abc conjecture, and a few other open odds and ends.

Find out more »## AGNT – Anna-Lena Trautmann – EPF Lausanne, Switzerland

Linearized polynomial modules and their application to network coding Linearized polynomials are a certain family of polynomials over finite fields. They form a non-commutative ring with the two operations addition and composition. In this ring we will consider special modules…

Find out more »## Jintai Ding – University of Cincinnati

The LWE-based key exchange Public key cryptosystems (PKC) are a critical part of the foundation of modern communication systems, in particular, the Internet. However Shor’s algorithm shows that the existing PKC like Diffie-Hellmann key exchange, RSA and ECC can be broken by…

Find out more »## Shannon Centennial at Clemson

Speakers: Frank R. Kschischang, University of Toronto Emina Soljanin, Rutgers University

Find out more »## Guang Gong – University of Waterloo

Two families of Lightweight Cryptographic Primitives for Securing Internet-of-Things Internet-of-Things at large, has become one of the most important challenges in computing today. Low-end embedded wireless devices are deployed in an increasing number and variety of applications. The integration of web-based and…

Find out more »