Current themes of my research include:

• Automation of algorithms for enumerative problems
• Analysis of randomized algorithms in numerical algebraic geometry
• Monodromy groups of sparse polynomial systems
• Applications of probabilistic group theory to monodromy algorithms
• Low-memory methods for polynomial system solving
• Certification methods, verification methods, and heuristics in numerical algebraic geometry