Aaron Bernstein

Aaron Bernstein is Charles S. Baylis Associate Professor in Computer Science at NYU Tandon School of Engineering. His research advances theoretical foundations of graph algorithms, with breakthroughs in dynamic algorithms, shortest path problems, and distributed computing.

Research contributions:

• Pioneering work on near-linear time algorithms for shortest paths with negative weights
• Fundamental advances in dynamic graph algorithms for connectivity and matching
• Innovative frameworks for distributed load balancing and network optimization
• Breakthroughs in maximum flow and matching problems

Publications demonstrate consistent theoretical innovation with numerous best paper awards at top theory conferences. Recent work resolves long-standing open problems in graph algorithms and establishes new algorithmic paradigms.

Current research group includes PhD students working on graph algorithms and distributed computing. Recipient of prestigious awards including Presburger Award and Sloan Research Fellowship. Research funded by NSF CAREER grant and Google Research Scholar award.