http:^^www.cs.berkeley.edu^people^faculty^homepages^vazirani.html

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

HTML
119 行
字号 
Date: Thu, 21 Nov 1996 19:53:42 GMTServer: NCSA/1.4Content-type: text/htmlLast-modified: Fri, 09 Aug 1996 22:16:27 GMTContent-length: 2544<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN"><!--Weblint & html-check on 08/09/96--><HTML><HEAD><TITLE>Umesh Vazirani</TITLE></HEAD><BODY><H1><!WA0><IMG SRC="http://www.cs.berkeley.edu/People/Faculty/Images/vazirani.gif" ALT=""> Umesh Vazirani</H1><P>Ph.D., University of California at Berkeley</P><P>Associate Professor<BR>(510) 642-0572<BR><!WA1><A HREF="mailto:vazirani@cs.berkeley.edu">vazirani@cs.berkeley.edu</A></P><H2>Awards/Lectureships</H2><UL><LI> NSF Presidential Young Investigator Award, 1987<BR><LI>Friedman Mathematics Prize, 1985<BR></UL><H2>Editorships/Program Committees</H2><UL><LI><P>     <STRONG>Editor</STRONG><BR>     <I>Computational Complexity</I>     </P><LI><P>     <STRONG>Member</STRONG><BR>     <I>Editorial Board, Probability Combinatorics and Complexity</I>     </P><LI><P>     <STRONG>Member</STRONG><BR>     <I>Program Committee, Foundations of Computer Science, 1986</I>     </P><LI><P>     <STRONG>Member</STRONG><BR>     <I>Program Committee, Symposium on the Theory of Computing, 1990</I>     </P><LI><P>     <STRONG>Co-Chairman</STRONG><BR>     <I>Workshop on Randomized Algorithms, 1991</I>     </P></UL><H2>Selected Publications</H2><UL><LI><P>     <STRONG>A Markovian Extension of Valiants Learning Model</STRONG><BR>     (with D. Aldous), <I>Proc. Conf. Foundations of Computer Science, </I>1990. Also, submitted for publication to Information and Computation.</P><LI>     <P>     <STRONG>Matching Is as Easy as Matrix Inversion</STRONG><BR>     (with K. Mulmuley and V. V. Vazirani), <I>Combinatorica, </I>Vol. 7,	No. 1, 1987 (invited paper).</P><LI>     <P>     <STRONG>Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Semi-Random Sources</STRONG><BR><I> Combinatorica</I>, Vol. 7, No. 4, 1987 (invited paper).</P><LI>     <P>     <STRONG>Generating Quasi-Random Sequences from Semi-Random Sources</STRONG><BR>     (with M. Santha), <I>J. Computational Systems Sci., </I>Vol. 33, No. 1, 1986 (invited paper).</P><LI>     <P>     <STRONG>Random Polynomial Time Is Equal to Semi-Random Polynomial Time</STRONG><BR>     (with V. V. Vazirani), <I>Proc. Conf. Foundations of Computer Science, </I>1985.</P></UL><H4><!WA2><A HREF="http://www.cs.berkeley.edu/People/Faculty/Images/p_59_b.gif"><!WA3><IMG SRC="http://www.cs.berkeley.edu/People/Faculty/Images/p_59_b.small.gif" ALT=""></A>Working lunch at the Computer Science faculty retreat, spring 1992. Leftto right: Professors Umesh Vazirani, Raimund Seidel, John Canny, andEugene Lawler.</H4></BODY></HTML><!--JHL-->

http:^^www.cs.berkeley.edu^people^faculty^homepages^vazirani.html - 源码说明

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

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

⌨️ 快捷键说明

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