{"id":122,"date":"2012-05-16T13:20:00","date_gmt":"2012-05-16T13:20:00","guid":{"rendered":"https:\/\/blogs.technet.microsoft.com\/inside_microsoft_research\/2012\/05\/16\/new-england-postdocs-collect-dissertation-awards\/"},"modified":"2016-07-20T07:32:54","modified_gmt":"2016-07-20T14:32:54","slug":"new-england-postdocs-collect-dissertation-awards","status":"publish","type":"post","link":"https:\/\/www.microsoft.com\/en-us\/research\/blog\/new-england-postdocs-collect-dissertation-awards\/","title":{"rendered":"New England Postdocs Collect Dissertation Awards"},"content":{"rendered":"

Posted by Rob Knies<\/span><\/p>\n

<\/span>\"Association (opens in new tab)<\/span><\/a> <\/p>\n

Aleksander Madry (opens in new tab)<\/span><\/a> and David Steurer (opens in new tab)<\/span><\/a> are both postdoctoral researchers at Microsoft Research New England (opens in new tab)<\/span><\/a> focused on theoretical computer science. Each of them is intrigued by the challenges posed by graphs, and each has devised new algorithms to address those challenges.<\/p>\n

And, as of May 2, both are recipients of Honorable Mention from the Association for Computing Machinery for its 2011 Doctoral Dissertation Award (opens in new tab)<\/span><\/a>, presented annually to the author or authors of the best doctoral dissertations in computer science and engineering.<\/p>\n

Seth Cooper (opens in new tab)<\/span><\/a>, a computer scientist at the University of Washington, won the award for his dissertation A Framework for Scientific Discovery through Video Games. Cooper, creative director at the university’s Center for Game Science, is co-creator, lead designer, and lead developer of Foldit, a crowdsourced scientific-discovery game that could help solve difficult scientific problems.<\/p>\n

Madry and Steurer were the only persons receiving Honorable Mention awards this year.<\/p>\n

“We’re thrilled to have Olek and David recognized in this way,” says Jennifer Chayes (opens in new tab)<\/span><\/a>, Microsoft distinguished scientist and managing director of the New England lab. “Each of them has done deep and original work on algorithms, and we’ve been very lucky to have them at Microsoft Research New England.”<\/p>\n

Madry’s Massachusetts Institute of Technology dissertation, From Graphs to Matrices, and Back: New Techniques for Graph Algorithms<\/em>” href=”http:\/\/people.csail.mit.edu\/madry\/docs\/thesis.pdf” target=”_blank”>From Graphs to Matrices, and Back: New Techniques for Graph Algorithms (opens in new tab)<\/span><\/a><\/em>, addresses the challenge of coping well with massive computing tasks in a graph context. He has developed a set of novel algorithmic tools that advance the state of the art on several fundamental graph problems.<\/p>\n

Steurer’s Princeton University dissertation, On the Complexity of Unique Games and Graph Expansion<\/em>” href=”http:\/\/www.cs.princeton.edu\/~dsteurer\/thesis.pdf” target=”_blank”>On the Complexity of Unique Games and Graph Expansion (opens in new tab)<\/span><\/a><\/em>, uses a new algorithm for expansion of graphs across different scales, shedding light on a hard-to-approximate optimization  problem called Unique Games—and could have applications beyond.
\"Get (opens in new tab)<\/span><\/a><\/object>
“My dissertation is about approximation algorithms and their limitations,” he explains. “In recent years, the Unique Games Conjecture (opens in new tab)<\/span><\/a> has emerged as a central open question in this field. The results of my thesis shed new light on this conjecture. The thesis shows close connection to questions about the expansion of small sets in graphs, and it develops surprising approximation algorithms for the underlying optimization problem.<\/p>\n

The Honorable Mention awards include a $10,000 award. While that is certainly appreciated, Steurer and Madry both say they get something less tangible but more powerful—motivation.<\/p>\n

“It’s a great honor that my thesis was recognized among all computer-science dissertations in 2011,” says Steurer, who this fall will be joining Cornell University as an assistant professor. “I take the recognition as a sign that the research community appreciates my work. I am very grateful for this support. The recognition also serves as additional motivation for me to continue the line of work in my thesis.”<\/p>\n

Madry takes a historical view of the value of the honor.<\/p>\n

“Winning this Honorable Mention means that my thesis was judged to be in the top three in the world of all the theses written last year across all the fields of computer science,” says Madry, who will join Switzerland’s École Polytechnique Fédérale de Lausanne in July. “Needless to say, I was very happy.<\/p>\n

“Historically, all the people from my field that won either the Dissertation Award or an Honorable Mention went on to have very successful careers,” he adds. “Therefore, earning this accolade is not only a very satisfying recognition of all the work I have done over four years of my Ph.D. studies, but also, it is a sign that the community views me as a promising researcher. <\/p>\n

“I find it a bit intimidating—but very motivating.”<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"

Posted by Rob Knies   Aleksander Madry and David Steurer are both postdoctoral researchers at Microsoft Research New England focused on theoretical computer science. Each of them is intrigued by the challenges posed by graphs, and each has devised new algorithms to address those challenges. And, as of May 2, both are recipients of Honorable […]<\/p>\n","protected":false},"author":0,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr-author-ordering":[],"msr_hide_image_in_river":0,"footnotes":""},"categories":[1],"tags":[200325,194719,201253,201343,201645,196025,202769,203133,203761,204389],"research-area":[],"msr-region":[],"msr-event-type":[],"msr-locale":[268875],"msr-post-option":[],"msr-impact-theme":[],"msr-promo-type":[],"msr-podcast-series":[],"class_list":["post-122","post","type-post","status-publish","format-standard","hentry","category-research-blog","tag-aleksander-madry","tag-association-for-computing-machinery","tag-david-steurer","tag-doctoral-dissertation-award","tag-from-graphs-to-matrices-and-back-new-techniques-for-graph-algorithms","tag-jennifer-chayes","tag-microsoft-research-new-england","tag-on-the-complexity-of-unique-games-and-graph-expansion","tag-seth-cooper","tag-unique-games-conjecture","msr-locale-en_us"],"msr_event_details":{"start":"","end":"","location":""},"podcast_url":"","podcast_episode":"","msr_research_lab":[],"msr_impact_theme":[],"related-publications":[],"related-downloads":[],"related-videos":[],"related-academic-programs":[],"related-groups":[],"related-projects":[],"related-events":[],"related-researchers":[],"msr_type":"Post","byline":"","formattedDate":"May 16, 2012","formattedExcerpt":"Posted by Rob Knies   Aleksander Madry and David Steurer are both postdoctoral researchers at Microsoft Research New England focused on theoretical computer science. Each of them is intrigued by the challenges posed by graphs, and each has devised new algorithms to address those challenges.And,…","locale":{"slug":"en_us","name":"English","native":"","english":"English"},"_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/posts\/122","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/post"}],"replies":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/comments?post=122"}],"version-history":[{"count":1,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/posts\/122\/revisions"}],"predecessor-version":[{"id":261987,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/posts\/122\/revisions\/261987"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=122"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/categories?post=122"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/tags?post=122"},{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=122"},{"taxonomy":"msr-region","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-region?post=122"},{"taxonomy":"msr-event-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event-type?post=122"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=122"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=122"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=122"},{"taxonomy":"msr-promo-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-promo-type?post=122"},{"taxonomy":"msr-podcast-series","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-podcast-series?post=122"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}