Now showing items 1-2 of 2
Hardness and tractability for structured numerical problems
(Georgia Institute of Technology, 2018-08-24)
We study structured linear systems and structured linear programs (LPs) from both algorithm and complexity perspectives. These structured problems commonly arise in combinatorial optimization, machine learning, and operation ...
Algorithmic manipulation of probability distributions for networks and mechanisms
(Georgia Institute of Technology, 2018-12-19)
In this thesis we present four different works that solve problems in dynamic graph algorithms, spectral graph algorithms, computational economics, and differential privacy. While these areas are not all strongly ...