The exhaustive list of topics in Theoretical Computer Science in which we provide Help with Homework Assignment and Help with Project is as follows:

- Spectral Graph Theory
- Linear algebra
- Adjacency and Laplacian matrices
- Positive semidefinite matricies
- Graphs
- Courant-Fischer and Rayleigh quotients
- Graph cutting
- Cheerer’s Inequality
- (Lazy) random walks
- Stationary distribution and l2-convergence
- Normalized Laplacian
- Conductance
- Monte Carlo methods
- Diameters and eigenvalues
- Expander graphs
- Nonblocking routing networks
- Local and -linear time clustering and partitioning
- Lovasz-Simonovits Theorem
- Sparsification
- Matrix pseudoinverses and tail bounds
- Convex Geometry
- Hyperplanes
- Norms and convex bodies
- Banach-Mazur distance
- Fritz John's theorem
- Isoperimetric inequality
- Johnson-Lindenstrauss theorem
- Dvoretsky's theorem
- Lattices and Basis Reduction
- Lattices
- Parallelepiped and dual of a lattice
- Shortest vectors
- Blichfield's theorem
- Minkowski's theorem
- Shortest/closest vector
- LLL algorithm
- Integer programming
- Linear Algebra
- Steepest descent
- Ultra-sparsifiers
- Multiplicative Weights
- Zero-sum games
- Boosting