Introduced in the early 2000s by computer scientists Daniel Spielman and Shang-Hua Teng, this is a general paradigm to bridge the gap between the average-case and worst-case performance of algorithms.

What if your Valentine has allergies that make traditional signs of affection a little difficult? A D.C. allergist has tips on how to navigate Feb. 14 this year.

Along with Srivastava, who teaches at the University of California, Berkeley, the two other awardees are Adam Marcus and Daniel Spielman. Marcus holds the Chair of Combinatorial Analysis at the ...