Undergraduate student Adrian Vladu was recently selected as a finalist in the Computing Research Association's Outstanding Undergraduate Award competition for 2011.

Adrian’s main academic interests are centered around theoretical computer science, with a focus on algorithms and data structures. He has researched the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. This work resulted in a paper published at the 8th Workshop on Approximation and Online Algorithms. The paper was co-authored with Claire Mathieu.

He has also worked in the area of Computational ...