Theses most similar to those of author Sidford, Aaron Daniel

Smaller steps for faster algorithms : a new approach to solving linear systems (2013) read it

The bidimensionality theory and its algorithmic applications

Hajiaghayi, MohammadTaghi (2005)

  • Advisor: Erik D. Demaine
  • Department of Mathematics
Read it

Techniques for computing with low-independence randomness

Rompel, John Taylor (1990)

  • Advisor: Frank Thomson Leighton
  • Department of Electrical Engineering and Computer Science
Read it

Approximate inference : decomposition methods with applications to networks

Jung, Kyomin (2009)

  • Advisor: Devavrat Shah
  • Department of Mathematics
Read it

Faster generation of random spanning trees

Ma̧dry, Aleksander (2009)

  • Advisor: Jonathan A. Kelner
  • Department of Electrical Engineering and Computer Science
Read it

From graphs to matrices, and back : new techniques for graph algorithms

Mądry, Aleksander (2011)

  • Advisors: Jonathan A. Kelner; Michel Goemans
  • Department of Electrical Engineering and Computer Science
Read it

Graphs, matrices, and populations : linear algebraic techniques in theoretical computer science and population genetics

Levin, Alex, Ph. D. (Alexander) (2013)

  • Advisors: Bonnie Berger; Jonathan Kelner
  • Department of Mathematics
Read it

LP/SDP hierarchy lower bounds for decoding random LDPC codes

Ghazi, Badih (2015)

  • Advisor: Madhu Sudan
  • Department of Electrical Engineering and Computer Science
Read it

Iterative methods, combinatorial optimization, and linear programming beyond the universal barrier

Sidford, Aaron Daniel (2015)

  • Advisor: Jonathan Kelner
  • Department of Electrical Engineering and Computer Science
Read it

Dimensionality reduction for sparse and structured matrices

Musco, Christopher Paul (2015)

  • Advisors: Jonathan A. Kelner; Martin C. Rinard
  • Department of Electrical Engineering and Computer Science
Read it

Computational metric embeddings

Sidiropoulos, Anastasios (2008)

  • Advisor: Piotr Indyk
  • Department of Electrical Engineering and Computer Science
Read it

Iterative methods, combinatorial optimization, and linear programming beyond the universal barrier (2015) read it

The bidimensionality theory and its algorithmic applications

Hajiaghayi, MohammadTaghi (2005)

  • Advisor: Erik D. Demaine
  • Department of Mathematics
Read it

Approximate inference : decomposition methods with applications to networks

Jung, Kyomin (2009)

  • Advisor: Devavrat Shah
  • Department of Mathematics
Read it

Distributed Newton-type algorithms for network resource allocation

Wei, Ermin (2010)

  • Advisor: Ozdaglar, Asuman E
  • Department of Electrical Engineering and Computer Science
Read it

On network coding capacity : matroidal networks and network capacity regions

Kim, Anthony Eli (2010)

  • Advisor: Médard, Muriel
  • Department of Electrical Engineering and Computer Science
Read it

From graphs to matrices, and back : new techniques for graph algorithms

Mądry, Aleksander (2011)

  • Advisors: Jonathan A. Kelner; Michel Goemans
  • Department of Electrical Engineering and Computer Science
Read it

Vertex sparsification and universal rounding algorithms

Moitra, Ankur (2011)

  • Advisor: F. Thomson Leighton
  • Department of Electrical Engineering and Computer Science
Read it

Conic optimization of electric power systems

Taylor, Joshua Adam (2011)

  • Advisor: Franz S. Hover
  • Department of Mechanical Engineering
Read it

Smaller steps for faster algorithms : a new approach to solving linear systems

Sidford, Aaron Daniel (2013)

  • Advisor: Jonathan Kelner
  • Department of Electrical Engineering and Computer Science
Read it

LP/SDP hierarchy lower bounds for decoding random LDPC codes

Ghazi, Badih (2015)

  • Advisor: Madhu Sudan
  • Department of Electrical Engineering and Computer Science
Read it

Dimensionality reduction for sparse and structured matrices

Musco, Christopher Paul (2015)

  • Advisors: Jonathan A. Kelner; Martin C. Rinard
  • Department of Electrical Engineering and Computer Science
Read it