Student Travel to SODA12

该项目的目标是帮助支持学生参加将于2012年1月17日至19日在日本京都举行的ACM-SIAM离散算法研讨会（SODA）。 SODA是首屈一指的会议，涵盖了组合数学，离散数学和计算机科学的算法方面的研究及其在科学和商业中的应用。算法研究是计算领域中最重要、最活跃的研究领域之一。数学问题遍及商业、技术和科学，对它们的研究仍然是一个主要的研究课题。SODA是算法领域阅读量最大的会议之一。许多论文被会议接受的学生可能无法从他们的家乡机构获得足够的支持。出席是特别有价值的学生谁是刚刚开始，更有可能从直接NSF支持的利润。 通过提供它，NSF将能够帮助培养这一关键领域的新一代研究人员。

The objective of this project is to help support student attendance at the ACM-SIAM Symposium on Discrete Algorithms (SODA) in Kyoto, Japan to be held on January 17-19, 2012. SODA is the premier conference that covers research in algorithmic aspects of combinatorics, discrete mathematics, and computer science and their applications in the sciences and business. Research on algorithms is one of the most important and active areas in computing. Algorithmic questions pervade business, technology, and science and their study continues to be a major research topic. SODA produces one of the most widely read proceedings in algorithms.Many of the students who have papers accepted at the conference may not be able to obtain sufficient support from their home institutions. Attendance is particularly valuable for students who are just starting out and are more likely to profit from direct NSF support. By providing it, the NSF will be able to help nurture a new generation of researchers in this key area.