http:^^www.cs.umd.edu^~pugh^
来自「This data set contains WWW-pages collect」· EDU^~PUGH^ 代码 · 共 124 行
EDU^~PUGH^
124 行
Date: Thu, 21 Nov 1996 20:28:34 GMT
Server: Apache-SSL/0.4.3b
Content-type: text/html
Content-length: 5135
Last-modified: Thu, 31 Oct 1996 14:35:15 GMT
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN"><HTML><HEAD> <TITLE> Bill Pugh </TITLE></HEAD><BODY BGCOLOR="#FFFFFF"><P><!WA0><IMG SRC="http://www.cs.umd.edu/~pugh/testudo.gif" ALT="" HEIGHT=143 WIDTH=150 ALIGN=LEFT><!WA1><IMG SRC="http://www.cs.umd.edu/~pugh/new-pugh.jpg" ALT="" HEIGHT=224 WIDTH=150 ALIGN=RIGHT></P><H1>Bill Pugh</H1><P><B>Email: </B><!WA2><A HREF="mailto:pugh@cs.umd.edu">pugh@cs.umd.edu</A></P><P><B>Phone: </B>(301) 405-2705</P><P><B>Office: </B><!WA3><A HREF="http://www.ee.umd.edu/Map/Avw/avw4100.html">4127AV Williams</A><BR clear=left></P><P>Associate Professor, <!WA4><A HREF="http://www.cs.umd.edu/">Dept. of ComputerScience</A>, <!WA5><A HREF="http://www.umcp.umd.edu/">Univ. of Maryland, CollegePark</A></P><P>NSF Presidential Young Investigator (PYI), 1991-1996<BR>1991 <!WA6><A HREF="http://www.packfound.org/95g03sci.htm">Packard Fellow</A></P><P><B>Join Appointments: </B><!WA7><A HREF="http://www.umiacs.umd.edu/">UMIACS</A></P><P><B>Academic Degree: </B>Ph.D., <!WA8><A HREF="http://www.cs.cornell.edu/">Cornell</A>,1988</P><P><B>Scholarly Activities: </B>SIGPLAN PLDI '91 Program committee, SIGPLANPLDI '92 Tutorials Chair, POPL '93, '96 and '97 Programm committees, <!WA9><A HREF="http://www.cs.umd.edu/~pugh/popl97">POPL'97 Webmaster</A><BR clear=all><h2>Teaching</h2><p> This semester (Fall 1996) I'm teaching <!WA10><a href="http://www.cs.umd.edu/class/cmsc430-f96-0201/">CMSC430</a> - aka Compilers.<p> In the Spring, I'm going to be teaching a new course:<!WA11><a href="http://www.cs.umd.edu/class/cmsc498p-s97/">CMSC498P - Advanced Object Oriented Programming</a><H2>Web stuff</H2><UL><LI><B>Java stuff</B>: I've compiled a <!WA12><A HREF="http://www.cs.umd.edu/~pugh/java">listof Java resources</A>, including information about a Java course I offeredvia ITV June 5th and 6th.</LI><LI><B>Introductory WWW tutorial </B>: I wrote an <!WA13><A HREF="http://www.cs.umd.edu/~pugh/intro-www-tutorial/">introductoryWWW tutorial</A> you are invited to read. I've written it to bring it upto date with HTML 2.0.</LI><LI><B><!WA14><A HREF="http://www.cs.umd.edu/~pugh/popl97">POPL97 Web pages</A></B>:I'm building and maintaining web pages for POPL97: the ACM conference onPrinciples of Programming Languages, to be held in Paris, 1997.</LI><li><b><!WA15><a href="http://www.cs.umd.edu/~pugh/fridayFacultyLunch">Friday faculty lunch</a></b>: I organize lunch orders and deliveries for Friday Faculty Lunches. As part of this, I've scanned in the menus for a number of restraurants in the College Park Area that deliver.</UL><H2>RESEARCH INTERESTS:</H2><P>The design and analysis of practical algorithms and data structures,both in general and for problems that arise in the implementation of programminglanguages and environments are under investigation.</P><P>I developed skip lists, a probabilistic data structure that can be usedin place of balanced trees. Although a skip list may not be balanced, theprobability of a skip list being substantially unbalanced is insignificant.Algorithms for insertion and deletion in skip lists are simpler and fasterthan equivalent algorithms for balanced trees.</P><P>My current research focuses on compilation techniques for making effectiveuse of massive parallelism for computationally intensive scientific problems.I am investigating algorithms for data dependence analysis in program,programming languages for scientific computations, and a framework forperforming loop transformations of programs to improve their performancewhen executed on massively parallel computers.</P><P>Most recently, my research has focused on the use of integer programmingalgorithms in array data dependence analysis. Although that integer programmingis NP-complete, the Omega test, an algorithm I developed, is efficientfor problems that arise in practice. In examining the question of arraydata dependence more closely, I have found that the queries that reallyneed to be asked are more complicated than can be answered using integerprogramming and that we really need decision procedures for a subclassof Presburger arithmetic. I have been able to extend the Omega test sothat it can answer these queries.</P><P><!WA16><A HREF="http://www.cs.umd.edu/projects/omega/omega.html">A longer discussionof the Omega project can be found here.</A></P><H2>SELECTED PUBLICATIONS</H2><P><!WA17><A HREF="ftp://ftp.cs.umd.edu/pub/skipLists/skiplists.ps">Skip Lists:A Probabilistic Alternative to Balanced Trees, Communications of the ACM,June 1990.</A></P><P>Uniform Methods for Loop Optimization, International Conference on SuperComputing,Cologne, Germany, June 1991.</P><P><!WA18><A HREF="ftp://ftp.cs.umd.edu/pub/omega/techReports/non-TRs/omega">TheOmega Test: a fast and practical integer programming algorithm for dependenceanalysis, Communications of the ACM, August, 1992.</A></P><P><!WA19><A HREF="ftp://ftp.cs.umd.edu/pub/omega/techReports/TRs/3196.ps.Z">AnExact Method for Analysis of Value-based Array Data Dependences, Proceedingsof the Sixth Annual Workshop on Programming Languages and Compilers forParallel Computing, June 1992 (with Dave Wonnacott).</A></P><H2><!WA20><A HREF="http://www.cs.umd.edu/TRs/authors/William_Pugh.html">TECHNICALREPORTS</A></H2></BODY></HTML>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?