A week of distinctions for CTIC Researcher Thomas Dueholm Hansen
The second week of June was a great week for CTIC researcher Thomas Dueholm Hansen who received two major distinctions.
Thomas first received one of only sixteen prestigious Google European Doctoral Fellowships given to promising young research students. Next, with his co-authors Oliver Friedmann and Uri Zwick, he received the best paper award at the equally prestigious 43rd ACM Symposium on the Theory of Computing (STOC'11) for his paper on the time complexity of randomized variants of the simplex algorithm for linear programming. In this paper, he and his co-authors solve an important problem that was conceived a decade before his birth. Many congratulations to Thomas on both achievements!
Read more about the distinctions here: