Biography

I am a fifth-year Ph.D. student at the Department of Computer Science at Boston University, currently advised by Prof. Steven Homer. In general, I am interested in Computational Complexity Theory and Algorithm Design. My research currently focuses on Circuit Complexity and Meta-Complexity. In particular, I study the mysterious Minimum Circuit Size Problem (MCSP) and focus on proving some barriers on proving its hardness as well as its connections with other topics in Theoretical Computer Science.

In May 2020, I received a B.A. with Summa Cum Laude and High Honors in Computer Science from Clark University where I was advised by Prof. Frederick Green. I did some research on Human-Computer Interaction (HCI) during my undergraduate study under the guidance of Prof. John Magee.

Teaching Experience

• Teaching Fellow
  • CS630 - Graduates Algorithms (Fall 2021)
  • CS332 - Theory of Computation (Spring 2023, Fall 2023, 2024)
  • CS235 - Algebraic Algorithms (Spring 2021)
  • CS132 - Geometric Algorithms (Summer 2022)
  • CS131 - Combinatoric Structures (Summer 2022, 2023)
• Grader
  • CS535 - Complexity Theory (Fall 2023)

Publications

• Marco Carmosino, Ngu Dang, Tim Jackman. Finding Circuit Extensions For XOR in Polynomial Time. 2025. Symposium On Discrete Algorithms (SODA' 25), Under Submission.
• Mariah Papy, Duncan Calder, Ngu Dang, Aidan McLaughlin, Breanna Desrochers, and John Magee. 2019. Simulation of Motor Impairment with “Reversed Angle Mouse” in Head-Controlled Pointer Fitts’ Law Task. In Proceedings of the 21st International ACM SIGACCESS Conference on Computers and Accessibility (ASSETS’19). ACM, Pittsburgh, PA, USA, 545-547.