THIS IS AN ARCHIVED VERSION OF CRA'S WEBSITE. THIS ARCHIVE IS AVAILABLE TO PROVIDE HISTORICAL CONTENT.

PLEASE VISIT HTTP://WWW.CRA.ORG FOR THE LATEST INFORMATION

About CRA Membership CRA for Students CRA for Faculty CRA-Women Computing Community Consortium (CCC) Awards Projects Events Jobs Government Affairs Computing Research Policy Blog Publications Data & Resources CRA Bulletin What's New Contact Home

1996 Winners: Outstanding Undergraduate Awards The Computing Research Association is pleased to announce the results of the second annual CRA Outstanding Undergraduate Awards competition. We would like to acknowledge the support of Hewlett-Packard Co., the NEC Research Institute Inc. and Xerox Corp. as this year's sponsors. Awards are presented in two categories: Outstanding Female Undergraduate and Outstanding Male Undergraduate. Candidates were nominated by their departments, which were allowed to nominate no more than one candidate in each category. Nominees had to be majoring in computer science, computer engineering or an equivalent program. A total of 12 female and 27 male candidates were nominated. The Selection Committee consisted of Ruzena Bajcsy of the University of Pennsylvania (committee chair), Daniel Huttenlocher of Cornell University and Jeff Ullman of Stanford University. In addition to choosing an overall winner in each category, the committee recognized a small number of runners-up. Outstanding Female Undergraduate Winner: Jennifer Nolan, North Carolina State University, Computer Science Runners-up: Miranda Wai Sum Ko, University of British Columbia, Computer Science Jennifer Sun, Harvard University, Mathematics-Division of Applied Sciences Stephanie Weirich, Rice University, Computer Science Bin Song, Dartmouth College, Computer Science and Mathematics Outstanding Male Undergraduate Winner: Amit Sahai, University of California at Berkeley, Mathematics with minor in Computer Science Runners-up: Corin Anderson, University of Washington, Computer Science and Engineering Jeremy Buhler, Rice University, Computer Science Regis Colwell, University of Pittsburgh, Computer Science Dani Goldberg, Brandeis University, Computer Science Jeffrey Grossman, University of Toronto, Computer Science and Mathematics David Knol, Northwestern University, Electrical Engineering and Computer Science Alexander Mallet, University of Pennsylvania, Computer Science and Engineering Robert Runser, University of Kansas, Electrical Engineering and Computer Science Peter Sloan, University of Utah, Computer Science Michael Wittman, Purdue University, Computer Science Ka-Ping Yee, University of Waterloo, Electrical and Computer Engineering About the Winners Jennifer Nolan is in her junior year as an undergraduate in computer science at North Carolina State University. For her research project as part of the CRA Distributed Mentor Program she conceived and implemented innovative recurrences and algorithms in the areas of basis and graphical integer partitions. This work resulted in two papers submitted for publication on which she is a co-author. Jennifer also has excelled in research projects at Burroughs-Wellcome (now Glaxo-Wellcome) and IBM. A member of the University Scholars Program, Jennifer carries a 4.0 grade point average and is a recipient of a Barry M. Goldwater Scholarship, among many others honor and awards. Her interests outside of academia include creative writing and playing violin and viola for the Raleigh Civic Symphony. Amit Sahai is in his senior year as an undergraduate in mathematics with a minor in computer science at the University of California at Berkeley. Two of his many accomplishments stand out. During an internship at the Xerox Palo Alto Research Center last summer, Amit, working with Marshall Bern, solved the Kneser-Thue Poulsen problem. The results of this work will appear in a paper accepted to the 1996 ACM Symposium on Theory of Computation. As a byproduct, their result also establishes a new property of the Dual Complex. For his Honors Senior Thesis project, Amit worked on the problem of finding the minimal DNA sequence that contains as subsequences every possible DNA sequence of a given length, and using combinatorial methods found a recursive formula for these minimum distances. Amit plays a major leadership role in Eta Kappa Nu, the electrical engineering society and is a member of Berkeley's Programming Team, which was recently declared the 1996 ACM International Collegiate Programming Contest World Champion. Copyright © 2004 Computing Research Association. All Rights Reserved. Questions? E-mail: webmaster@cra.org.