Andrea Lincoln

Andrea Lincoln is an Assistant Professor at Boston University's Department of Computer Science within the College of Arts & Sciences. Her research focuses on theoretical computer science, particularly average-case and fine-grained complexity. She holds a PhD from MIT (2020) and completed a postdoctoral fellowship at UC Berkeley with Barna Saha (2020-2021). Her work explores algorithmic complexity through reduction networks and dynamic systems analysis.

Research interests include computational problem complexity, algorithm design for dynamic graphs, and average-case scenario analysis. She has contributed to understanding hardness proofs for problems like k-SUM and Orthogonal Vectors, as well as developing techniques for evaluating Boolean formulas and subgraph counting.

Her recent work (2022-2025) emphasizes algorithmic efficiency under predictions, compression impacts on string distance measures, and cache-adaptive performance analysis. Notable publications address hypercycle database problems and delegation protocols for search problems. While no specific awards are listed, her prolific publication record reflects sustained contributions to theoretical computer science.

Dr. Lincoln advises no listed students and has no documented grants in the provided text. Her work is associated with foundational algorithmic research rather than applied lab settings.