The exhaustive list of topics in Randomized Algorithms in which we provide Help with Homework Assignment and Help with Project is as follows:
- Median Finding, Routing
- B-splines (Uniform and Non-uniform)
- Fairing; Generalized Cylinders
- F. E. and B. E. Meshing Algorithms
- Discrete Differential Geometry
- Coupon Collecting, Stable Marriage, Markov Inequality
- Fingerprints by Polynomials, Perfect Matching, Hashing
- Polling, Minimum Cut, Transitive Closure
- Maximal Independent Sets
- B-rep and Non-Manifold Mixed Dimension Models
- Surface Intersections; Nonlinear Solvers
- Hashing, Perfect Hash Families, Freivald's Technique
- Spline Curves
- Probabilistic Method, Expanders, Wiring, MAX SAT
- Parallel Algorithms
- Interval Methods, Robustness
- Shortest Paths
- Method of Conditional Probabilities and Expectations, Fingerprinting
- Estimating Min-Cut Size
- Geodesics
- Developable Surfaces
- Umbilics
- Parabolic Line, Ridge Line, Sub-Parabolic Line
- Decomposition Models; Integral Properties of Solids
- Min-Cut, Complexity Theory, Game Tree Evaluation
- Minimum Spanning Trees
- Physically-Based Deformable Surfaces
- Localization, Inspection and Model Matching
- Chebyshev, Two Point Sampling, Chernoff
- Adelman's Theorem, Game Theory, Lower Bounds
- Machining Automation
- Linear Programming
- DNF Counting
- Markov Chains
- UTS, Eigenvalue Analysis, Expanders
- Expander based Pseudo-Random Generator
- Sampling with Markov Chains, Coupling
- Computational Geometry
- Randomized Incremental Construction
- Trapezoidal Decomposition, Treaps
- Semidefinite Programming
- Binary Optimization
- Bounds: Goemans-Williamson and Nesterov
- Linearly Constrained Problems
- Groups, Rings, Fields
- Polynomials and Ideals
- Univariate Polynomials