Theses most similar to Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus (Kelner, Jonathan, 1980-; 2005) read it

Area-contracting maps between rectangles

Guth, Lawrence (2005)

  • Advisor: Tomasz S. Mrowka
  • Department of Mathematics
Read it

Approximation algorithms for low-distortion embeddings into low-dimensional spaces

Sidiropoulos, Anastasios (2005)

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

Faster Fiedler vector computation for Laplacians of well-shaped meshes

Kanapka, Joseph D. (Joseph Daniel), 1972- (1998)

  • Advisor: Daniel A. Spielman
  • Department of Electrical Engineering and Computer Science
Read it

Dimension reduction algorithms for near-optimal low-dimensional embeddings and compressive sensing

Grant, Elyot (2013)

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

Better embeddings for Planar Earth-Mover Distance over sparse sets

Backurs, Arturs (2014)

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

Sparse regularity and relative Szemerédi theorems

Zhao, Yufei (2015)

  • Advisor: Jacob Fox
  • Department of Mathematics
Read it

Counting elliptic curves of bounded Faltings height

Hortsch, Ruthi (2016)

  • Advisor: Bjorn Poonen
  • Department of Mathematics
Read it

Contraction maps and applications to the analysis of iterative algorithms

Zampetakis, Emmanouil (2017)

  • Advisor: Constantinos Daskalakis
  • Department of Electrical Engineering and Computer Science
Read it

Algorithmic embeddings

Bădoiu, Mihai, 1978- (2006)

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

A pseudopolynomial algorithm for Alexandrov's theorem

Price, Gregory Nathan (2008)

  • Advisor: Eric D. Demaine
  • Department of Electrical Engineering and Computer Science
Read it