Theses most similar to Approximation algorithms for grammar-based data compression (Lehman, Eric (Eric Allen), 1970-; 2002) read it

Polynomial maps with applications to combinatorics and probability theory

Port, Dan (1994)

  • Advisor: Daniel Kleitman
  • Department of Mathematics
Read it

Restricted branching programs and hardware verification

Ponzio, Stephen J. (Stephen John) (1995)

  • Advisor: Maricio Karchmer
  • Department of Electrical Engineering and Computer Science
Read it

B and D analogues of stable Schubert polynomials and related insertion algorithms

Lam, Tao Kai (1995)

  • Advisor: Richard P. Stanley
  • Department of Mathematics
Read it

Comparing products of Schur functions and quasisymmetric functions

Pylyavskyy, Pavlo (2007)

  • Advisor: Richard P. Stanley
  • Department of Mathematics
Read it

Exact and asymptotic enumeration of permutations with subsequence conditions

Bóna, Miklós (1997)

  • Advisor: Richard P. Stanley
  • Department of Mathematics
Read it

Gröbner bases in rational homotopy theory

Lee, Wai Kei Peter (2008)

  • Advisor: Haynes R. Miller
  • Department of Mathematics
Read it

Tensor rank : some lower and upper bounds

Forbes, Michael Andrew (2011)

  • Advisor: Scott Aaronson
  • Department of Electrical Engineering and Computer Science
Read it

Decomposition and enumeration in partially ordered sets

Hersh, Patricia (Patricia Lynn), 1973- (1999)

  • Advisor: Richard P. Stanley
  • Department of Mathematics
Read it

Trace reconstruction problem

Pacchiano, Aldo (2014)

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

Bounds on extremal functions of forbidden patterns

Geneson, Jesse (Jesse T.) (2015)

  • Advisor: Peter W. Shor
  • Department of Mathematics
Read it