Slides and Papers from the DIMACS Workshop on Probabilistic Analysis of Algorithms for Hard Problems
November 1 - 3, 1999
Fiber Optic Materials Research Building, Rutgers University, Piscataway, NJ


Dimitris Achlioptas, Microsoft, optas@microsoft.com
Mick gets more than pie (PDF file)

Edward Coffman, New Jersey Institute of Technology, coffman@homer.njit.edu
Interval Packing in One and Two Dimensions (Postscript file)

Martin Furer, Penn State U., furer@cse.psu.edu
Url: http://www.cse.psu.edu/~furer
Approximating Permanents of Complex Matrices (Postscript file)

Leslie Goldberg, U. of Warwick, leslie@dcs.warwick.ac.uk
An Extension of Path Coupling (Postscript file)

Mark Jerrum, U. of Edinburgh, mrj@dcs.ed.ac.uk
Bibliography of Case Studies in Torpid Mixing (Postscript File)

George Lueker, U.C.Irvine, lueker@pacific.ICS.UCI.EDU
Expected Length of Longest Common Subsequences (Postscript file)

Angelika Steger, Munich University of Technology, steger@informatik.tu-muenchen.de
Balanced Allocations: More balls than bins (Postscript file)

C.R. Subramanian, Max-Planck Institute, crs@data.mpi-sb.mpg.de
A BFS Approach to Partitioning Problems on Random Graphs (Postscript file)

Santosh Vempala, M.I.T., vempala@math.mit.edu
Inapproximability via the Probabilistic Method
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

S. Venkatesh, U.Penn, venkates@ee.upenn.edu
Information Storage in Finite Memory (Postscript file)

Joseph Yukich, LeHigh University, joseph.yukich@lehigh.edu
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26