This workshop will be held offsite at the Georgia Institute of Technology.
This workshop will bring together researchers from a variety of fields
to highlight new results broadly related to the use of randomization
in algorithm design.
Talks will highlight new results in the area of randomized algorithms and
probabilistic tools for algorithm design. The workshop will also
include recent successes in derandomization and problems where there are
efficient deterministic algorithms but not yet randomized versions, such
as Weitz's approximate counting approach and recent extensions of it.
The workshop will attempt to bring various experts interested in this
general theme and identify challenging open problems and discuss ways
to approach and attack them.