
by Greg Badros
17 people liked this
As Facebook engineers, we are surrounded by engaging technical problems to solve. We've recently tackledefficient photo storage, distributed computation and crowdsourced translations, to name a few. While we're working on inventive solutions on a daily basis, we can't do it alone.
Today, we're announcing the Facebook Fellowship Program to support Ph.D. students in the 2010-2011 school year who can help solve some of the biggest challenges facing the social web and Internet technology. We believe that the academic community plays a central role in addressing many of our most challenging research questions, and we created this fellowship to extend our involvement and collaboration with the academic world.
We are interested in a wide range of academic topics, including Internet economics, cloud computing, social computing, data mining, machine learning, and systems and information retrieval. Full-time Ph.D. students who are enrolled in U.S. universities and working on research in these topical areas qualify to apply for one of five fellowships, which will cover their tuition and fees and provide a $30,000 stipend in addition to conference travel and other benefits.
If you or someone you know fits the requirements above, we want to hear from you. To be sure our first fellows receive funding in time for the upcoming school year, we are working on the following tight deadlines:
- Feb. 15, 2010: Applications for fellowships must be submitted in full.
- March 29, 2010: Award recipients will be notified by email of their acceptance.
We look forward to working together with leading Ph.D. researchers across the country to take on the big technological challenges facing our engineers and the social web. We are eagerly awaiting your applications for our first Facebook Fellowship Program.
Greg Badros, a University of Washington Ph.D. '00 and a director of engineering at Facebook, can't believe his first decade as a doctor is almost over but glad that no one asks him to act as their physician.