The exhaustive list of topics in Behavior of Algorithms in which we provide Help with Homework Assignment and Help with Project is as follows:

- Condition Number
- Largest Singular Value of a Matrix
- Gaussian Elimination without Pivoting
- Smoothed Analysis of Gaussian Elimination without Pivoting
- Growth Factors of Partial and Complete Pivoting
- Strong Duality Theorem of Linear Programming
- Renegar's Condition Numbers
- Analysis of von Neumann's Algorithm
- Worst-Case Complexity of the Simplex Method
- Expected Number of Facets of the Convex Hull of Gaussian Random Points in the Plane
- Expected Number of Facets of the Shadow of a Polytope given by Gaussian Random Constraints
- Expected Number of Facets of the Shadow of a Polytope given by Gaussian Random Constraints: Distance Bound
- Expected Number of Facets of the Shadow of a Polytope given by Gaussian Random Constraints: Angle Bound
- Speeding up GE of Graphs with Low Bandwidth or Small Separators
- Spectral Partitioning of Planar Graphs
- Spectral Paritioning of Well-Shaped Meshes and Nearest Neighbor Graphs
- Turner's Theorem for Bandwidth of Semi-Random Graphs
- Smoothed Analysis and Monotone Adversaries for Bandwidth and Graph Bisection
- McSherry's Spectral Bisection Algorithm
- Linear Programming
- von Neumann's Algorithm, Primal and Dual Simplex Methods