10 articles
David Bruce Wilson
David Bruce Wilson is an American researcher in combinatorics and probability, known for Wilson's algorithm for uniform spanning trees and for coupling from the past.
János Komlós (mathematician)
János Komlós, born 1942 in Budapest, is a Hungarian-American mathematician and Distinguished Professor at Rutgers University known for the KMT strong approximation, the AKS sorting network, and the Komlós conjecture in discrepancy theory.
Jeff Kahn (mathematician)
Jeffry Kahn, also known as Jeff Kahn, is a Distinguished Professor of Mathematics at Rutgers University working in discrete mathematics, graph theory, and probabilistic methods.
Joel Spencer
Joel Spencer, born 1946, is an American mathematician and Silver Professor Emeritus at NYU's Courant Institute, coauthor of The Probabilistic Method and a direct collaborator of Paul Erdős.
L. R. Ford, Jr.
L. R. Ford, Jr., full name Lester Randolph Ford, Jr. (1927–2017), was an American mathematician at RAND who co-founded network flow theory with Fulkerson and devised the Ford–Johnson sorting algorithm.
László Babai
László Babai is a Hungarian mathematician and theoretical computer scientist at the University of Chicago, best known for his 2015 breakthrough algorithm for graph isomorphism and for work on interactive proofs.
Martin Fürer
Martin Fürer is a mathematician and theoretical computer scientist at Pennsylvania State University, known for his 2007 integer multiplication algorithm, the first improvement over Schönhage–Strassen in more than 35 years.
Michael Saks (mathematician)
Michael Saks, born around 1956, is an American mathematician and Distinguished Professor of Mathematics Emeritus at Rutgers University, known for work in combinatorics and theoretical computer science.
Naveen Garg
Naveen Garg, born 1971, is an Indian theoretical computer scientist, chair professor at IIT Delhi, who works on approximation algorithms for scheduling and facility location and won the 2016 Shanti Swarup Bhatnagar Prize.
Rūsiņš Mārtiņš Freivalds
Rūsiņš Mārtiņš Freivalds (1942–2016) was a Latvian mathematician and computer scientist best known for Freivalds' algorithm, which verifies matrix multiplication in quadratic time using randomness.