Mathematical Sciences: The Probabilistic Method

该奖项支持斯宾塞教授的研究工作 在组合学中。 具体来说，斯宾塞教授正在开发 概率论方法在处理 组合学 离散数学和 计算机科学提出了算法的观点。 许多 存在性的概率证明提供立即有效的 相应算法问题的随机化过程， 在某些情况下，这些程序可以去随机化， 转换成确定性的。 该研究是在组合学的一般领域。 组合数学试图找到有效的方法来研究如何 可以组织离散的集合。 离散的行为 系统对于现代通信是极其重要的。 为 例如，大型网络的设计，如电话系统，以及 计算机科学中的算法设计都是处理离散的 对象，这利用了组合研究。

This award supports the research of Professor Spencer to work in combinatorics. Specifically, Professor Spencer is developing the Probabilistic Method for use in dealing with problems in combinatorics. The interplay between discrete mathematics and computer science suggests an algorithmic viewpoint. Many probabilistic proofs of existence supply immediately efficient randomized procedures for the corresponding algorithmic problems, and in some cases these procedures can be derandomized and converted into deterministic ones. The research is in the general area of combinatorics. Combinatorics attempts to find efficient methods to study how discrete collections can be organized. The behavior of discrete systems is extremely important to modern communications. For example, the design of large networks, as in telephone systems, and the design of algorithms in computer science all deal with discrete objects, and this makes use of combinatorial research.