📄 http:^^www.cs.washington.edu^homes^beame^beame.html
字号:
Date: Thu, 21 Nov 1996 20:26:34 GMTServer: NCSA/1.4.2Content-type: text/htmlLast-modified: Thu, 29 Feb 1996 00:31:25 GMTContent-length: 1506<html><head><title>Paul Beame</title></head><!WA0><a href="http://www.cs.washington.edu/homes/beame/blueribbon.html"><!WA1><img border=0 alt="[free speech]" hspace=8 src="http://www.cs.washington.edu/general/rib_bar_wh.gif"></a><h1>Paul Beame<!WA2><a href="http://www.cs.washington.edu/homes/beame/beame.large.gif"><!WA3><img align=middle src="http://www.cs.washington.edu/homes/beame/beame.small.gif"></a></h1><p>Paul Beame is an Associate Professor in the<!WA4><a href="http://www.cs.washington.edu/index.html">Department of Computer Science & Engineering</a>at the<!WA5><a href="http://www.washington.edu">University of Washington</a>.<p>Paul received his B.Sc. in Mathematics in 1981, an M.Sc. in Computer Sciencein 1982, and Ph.D. in Computer Science in 1987, all from the <!WA6><a href="http://www.cs.utoronto.ca"> University of Toronto</a>.He was a Post-doctoral Research Associate at M.I.T. for the 1986-87 academicyear and joined the University of Washington in Autumn 1987. In 1988 he received an NSF PresidentialYoung Investigator Award.<p>Paul's research is concerned primarily with computationalcomplexity and the theoretical aspects of paralleland distributed computing. His recent research has concentrated on connections between computationalcomplexity and proof theory, in particular, on the complexity of proofs inpropositional proof systems.<p>Paul enjoys squash and softball and other sports where enthusiasm cancompensate for a lack of talent.<p><li> <!WA7><a href="http://www.cs.washington.edu/homes/beame/papers.html"> Some Recent Papers </a></li><li><!WA8><a href="http://www.cs.washington.edu/homes/beame/projects.html"> Quals Projects </a></li></body><address><hr>beame@cs.washington.edu</address></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -