Details: We will finish the remainder of previous student talk. We will begin where we ended last time.

Abstract: Secure computation allows a set of mutually distrusting parties to compute a joint function of their private inputs such that the parties only learn the output of the functionality and nothing else about the inputs of th

Gupta, P., & Kumar, P. R. (2000). The capacity of wireless networks.
IEEE Transactions on information theory, 46(2), 388-404.

Abstract: Ultra Large-scale Linear Programming refers to class of problems where number of linear inequality constraints grows exponentially w.r.t. the number of variables.