I’m not fond of conference posters. They’re often filled with details meaningful to the author but uninviting to an uninitiated observer. However, there was a poster at the Heidelberg Laureate Forum that drew me in. … Read more

| By John D. Cook | 2 comments

Daniel Spielman won the Rolf Nevanlinna Prize in 2010 “for smoothed analysis of Linear Programming, algorithms for graph-based codes and applications of graph theory to Numerical Computing.” In our interview I asked him to explain … Read more

| By John D. Cook | 1 comment

The Heidelberg Laureate Forum invited laureates in mathematics and computer science to participate. There have been numerous comparisons between the mathematicians and the computer scientists. For example, a much larger proportion of Turing Award winners … Read more

| By John D. Cook | 1 comment