Andrea Lincoln

1. Tight Hardness for Shortest Cycles and Paths in Sparse Graphs
   2017/12/21 by Andrea Lincoln, Lincoln, Andrea, Virginia Vassilevska Williams +3 · 12 citations
   Computer Science · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.DS
2. New Techniques for Proving Fine-Grained Average-Case Hardness
   2020/08/14 by Mina Dalirrooyfard, Andrea Lincoln, Dalirrooyfard, Mina +3 · 2 citations
   Computer Science · #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.CC #cs.DS
3. Average-Case Hardness of Parity Problems: Orthogonal Vectors, k-SUM and More
   2025/03/27 by Mina Dalirrooyfard, Dalirrooyfard, Mina, Andrea Lincoln +5 · 2 citations
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Stochastic Gradient Optimization Techniques