http:^^http.cs.berkeley.edu^~sinclair^
来自「This data set contains WWW-pages collect」· EDU^~SINCLAIR^ 代码 · 共 111 行
EDU^~SINCLAIR^
111 行
Date: Thu, 21 Nov 1996 19:54:09 GMTServer: NCSA/1.4Content-type: text/htmlLast-modified: Sat, 10 Aug 1996 01:03:05 GMTContent-length: 3213<!-- Created Friday 9th August 1996 by Alistair Sinclair --><!-- Last modified 8/9/96 --><HEAD><TITLE>Alistair Sinclair's Home Page</TITLE></HEAD><BODY><H1><!WA0><IMG SRC="http://HTTP.CS.Berkeley.EDU/~sinclair/Sinclair.small.gif" Align=middle> Alistair Sinclair, Associate Professor</H1><H2>Research Interests</H2><UL><LI> Design and analysis of algorithms, especially randomized ones<LI> Computational applications of stochastic processes and nonlineardynamical systems<LI> Monte Carlo methods in Statistical Physics<LI> Combinatorial optimization</UL><H2>Selected recent papers</H2><UL><LI> <!WA1><a href="http://HTTP.CS.Berkeley.EDU/~sinclair/mcmc.ps"> The Markov chain Monte Carlo method:an approach to approximate counting and integration</a> <dd> Mark Jerrum and Alistair Sinclair, in "Approximation Algorithms for NP-hard Problems," D.S.Hochbaum ed., <dd> PWS Publishing, Boston, 1996<LI> <!WA2><a href="http://HTTP.CS.Berkeley.EDU/~sinclair/binpack.ps"> Biased random walks, Lyapunov functions, and stochastic analysis of Best Fit bin packing</a> <dd> Claire Kenyon, Yuval Rabani and Alistair Sinclair, SODA 1996, pp. 351-358<LI> <!WA3><a href="http://HTTP.CS.Berkeley.EDU/~sinclair/grids.ps"> Approximating the number of monomer-dimer coverings of a lattice</a> <dd> Claire Kenyon, Dana Randall and Alistair Sinclair, Journal of Statistical Physics 83 (1996), pp. 637-659<LI> <!WA4><a href="http://HTTP.CS.Berkeley.EDU/~sinclair/surfaces.ps"> Markov Chain Algorithms for Planar Lattice Structures</a> <dd> Michael Luby, Dana Randall and Alistair Sinclair, FOCS 1995, pp. 150-159<LI> <!WA5><a href="http://HTTP.CS.Berkeley.EDU/~sinclair/crossover.ps"> A computational view of population genetics</a> <dd> Yuval Rabani, Yuri Rabinovich and Alistair Sinclair, STOC 1995, pp. 83-92<LI> <!WA6><a href="http://HTTP.CS.Berkeley.EDU/~sinclair/saws.ps"> Testable Algorithms for Self-Avoiding Walks</a> <dd> Dana Randall and Alistair Sinclair, SODA 1994<LI> <!WA7><a href="http://HTTP.CS.Berkeley.EDU/~sinclair/ising.ps"> Polynomial-time Approximation Algorithms for the Ising Model</a> <dd> Mark Jerrum and Alistair Sinclair, SIAM Journal on Computing 22 (1993), pp. 1087-1116<LI> <!WA8><a href="http://HTTP.CS.Berkeley.EDU/~sinclair/vegas.ps"> Optimal Speedup of Las Vegas Algorithms</a> <dd> Michael Luby, Alistair Sinclair and David Zuckerman, Information Processing Letters 47 (1993), pp. 173-180<LI> <!WA9><a href="http://HTTP.CS.Berkeley.EDU/~sinclair/flow.ps"> Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow</a> <dd> Alistair Sinclair, Combinatorics, Probability and Computing 1 (1992), pp. 351-370<LI> <!WA10><a href="http://HTTP.CS.Berkeley.EDU/~sinclair/genetic.ps"> Quadratic Dynamical Systems</a> <dd> Yuri Rabinovich, Alistair Sinclair and Avi Wigderson, FOCS 1992, pp. 304-313</UL><H2>Teaching, Fall 1996</H2><UL><LI> CS174, Combinatorics, Probability and Graph Theory<LI> <!WA11><a href="http://www.cs.berkeley.edu/~larsr/Seminars/"> Theory seminars</a></UL><H2>Current and Former Graduate Students</H2><UL><LI> Dana Randall<LI> <!WA12><a href="http://www.cs.berkeley.edu/~mitzen/"> Michael Mitzenmacher</a><LI> <!WA13><a href="http://www.cs.berkeley.edu/~juels/"> Ari Juels</a><LI> <!WA14><a href="http://www.cs.berkeley.edu/~larsr/"> Lars Rasmussen</a></UL><H2>Address</H2><ADDRESS>Prof. Alistair Sinclair <br>Computer Science Division <br>Soda Hall <br>University of California <br>Berkeley, CA 94720-1776 <br> <br>Phone: (510) 643-8144 <br>Email: <!WA15><a href="mailto:sinclair@cs.berkeley.edu">sinclair@cs.berkeley.edu</a></ADDRESS>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?