Solly Parenti – University of Wisconsin-Madison

Martin M-103 Martin Hall M, Clemson, SC, United States

The Colmez Conjecture The Faltings height of an abelian variety is a fundamental invariant that was introduced in the proof of the Mordell conjecture.  Pierre Colmez formulated a conjectural interpretation …

Gauri Joshi – Carnegie Mellon University

Martin M-103 Martin Hall M, Clemson, SC, United States

Distributed Storage Erasure codes, originally designed to provide reliability against noise on communication channels, are now widely used in distributed storage systems. Distributed storage systems require the codes to have …

Gauri Joshi – Carnegie Mellon University

Martin M-103 Martin Hall M, Clemson, SC, United States

Coded Computing Large-scale distribute computing frameworks such as MapReduce and Spark employ massive parallelization of jobs. While parallelism drastically reduces computation time, slow or straggling nodes can become a bottleneck in job …

Gauri Joshi – Carnegie Mellon University

Martin M-103 Martin Hall M, Clemson, SC, United States

Rateless Codes Rateless fountain codes are a class of erasure codes where the source generates an unlimited stream of symbols until the data is recovered at the receiver. This rateless property …

Melvyn Nathanson – City University of New York

Martin M-102 405 S Palmetto Blvd, Clemson, SC, United States

Solved and unsolved problems in additive number theory This will be a survey of recent results in combinatorial and additive number theory. The central object is the set of sums of …

Gengran Hu – Hangzhou Dianzi University

Martin M-102 405 S Palmetto Blvd, Clemson, SC, United States

On reductions from subset sum problem to shortest vector problem. The shortest vector problem (SVP) is a fundamental problem in lattice theory and its applications in cryptography. The hardness of SVP is …