http:^^www.cs.wisc.edu^~pubs^faculty-info^condon.html

来自「This data set contains WWW-pages collect」· HTML 代码 · 共 86 行

HTML
86 行
字号 
Date: Thu, 07 Nov 1996 19:06:55 GMTServer: NCSA/1.5Content-type: text/htmlLast-modified: Tue, 03 Oct 1995 22:00:45 GMTContent-length: 2640<HTML><HEAD><TITLE> Home Page of Anne Condon </TITLE></HEAD><BODY><H1> <!WA0><IMG ALIGN=MIDDLE SRC="http://www.cs.wisc.edu/~pubs/faculty-info/condon.gif"> Anne Condon </H1><BLOCKQUOTE> Associate Professor <BR> <BR> Computer Sciences Department <BR> University of Wisconsin <BR> 1210 W. Dayton St. <BR> Madison, WI 53706-1685 <BR> <BR> telephone: (608) 262-1204 <BR> fax: (608) 262-9777 <BR> email: <!WA1><A HREF="mailto:condon@cs.wisc.edu"> condon@cs.wisc.edu</A> <BR></BLOCKQUOTE><EM>Ph.D., University of Washington, 1987</EM> <BR><EM>Interests:</EM>Complexity theory, interactive proof systems, randomized complexityclasses, theory of parallel computation <P><HR><H2> Research Summary </H2>I am interested in models of computation, such as interactiveproof systems, which combine nondeterminism and randomness. Suchmodels have recently proven surprisingly useful in solving classicproblems in complexity theory. For example, although the theoryof NP-completeness has long been used to identify hard computationalproblems, there has not been much progress in understanding whichhard problems have solutions that are easy to approximate. Recentresults on interactive proof systems have resulted in novel modelsof NP, which in turn can be used to prove non-approximabilityresults for several NP-hard problems. In our work we are developingboth positive and negative results on the approximability of hardcombinatorial problems which arise in game theory, graph theoryand automata theory. <P>I am also interested in design and analysis of parallel algorithms.I am currently working on development of parallel algorithms forsorting and for graph problems, such as minimum spanning tree.The goal is to develop algorithms that work well on `practical'parallel models, where communication and synchronization costscan be expensive. <P><H2> Sample Recent Publications </H2>Interactive proof systems with polynomially bounded strategies(with R. Ladner), <EM>Journal of Computer and System Sciences</EM>,vol. 50, no. 3, 1995. <P> Finite state automata with nondeterministic and probabilisticstates (with L. Hellerstein, S. Pottle, and A. Wigderson), <EM>Proceedingsof the 26th Annual ACM Symposium on the Theory of Computing</EM>,May 1994. <P> PSPACE is provable by two provers in one round (with J.-Y. Caiand R. Lipton), <EM>Journal of Computer and System Sciences</EM>,vol. 48, no. 1, February 1994. <P> <HR><ADDRESS> This page was automatically created October 3, 1995.<BR> Email <!WA2><A HREF="mailto:pubs@cs.wisc.edu">pubs@cs.wisc.edu</A>to report errors.</ADDRESS><HR></BODY></HTML>

http:^^www.cs.wisc.edu^~pubs^faculty-info^condon.html - 源码说明

本页面展示了「This data set contains WWW-pages collected from computer science departments of various universities」中的 http:^^www.cs.wisc.edu^~pubs^faculty-info^condon.html 源码文件，采用 HTML 编程语言编写，共 86 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与universities相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?