|
| Today:
|
|
|
| Special Sessions |
| Session 1: Computability and Randomness |
| Session Chair: |
S. Barry Cooper, Andrew Lewis |
| Speakers: |
Jan Reimann. Effectively closed sets of measures and randomness
Bjorn Kjos-Hansen. Brownian Motion and
Kolmogorov Complexity
C. S. Calude (University of Auckland, NZ)
Most Programs Stop Quickly or Never Halt (joint work with M. A. Stay, University
of California Riverside, USA)
George Barmpalias (Leeds) Lowness,
Randomness and Degrees
Andre Nies (Auckland) Randomness, computability,
and effective descriptive set theory
|
| Session 2: Algorithms and Complexity |
| Session Chair: |
Manindra Agrawal, Angsheng Li |
| Speakers: |
Jin-Yi Cai Holographic Algorithms
Naveen Garg Fractional Packing and Covering
Jaikumar Radhakrishnan The PCP Theorem's New Proof
Manindra Agrawal Determinant versus Permanent
Alberto Apostolico and C. Tagliacollo Faster
Algorithms for the Extraction of Irredundant Motif Bases
Andreas Dress, Vincent Moulton, Kathi Huber and Jack Koolen.
Virtual cut points of metric spaces -- what are they good for, and how can one compute
them? |
|
|
|
|
|
|
|
|
|
|
