[Help] >>
User Login | Event Admin Login
Category: List of Bases 2002 2002 ICTP activities in Trieste ICTP activities in Trieste
Session Menu
lecture

Cosponsor(s):

IISI (Intelligent Information Systems Institute), Cornell University, Ithaca, NY, USA and Microsoft Research, Redmond, WA, USA

Start Time:

26 August 2002 at 08:30

Ends On:

7 September 2002

Location:

ICTP

Venue:

M (LH)

Director(s):

C. Borgs, J. Chayes, R. Monasson, B. Selman and R. Zecchina

Organizer(s):

Description:

The last years have witnessed an increasing interaction among the disciplines of discrete mathematics, computer science and statistical physics on combinatorial problems over random structures and related algorithmic issues.
Motivated by the rate of progress in such an interdisciplinary area of research, the Abdus Salam International Centre for Theoretical Physics will organize a School on "Statistical Physics, Probability Theory and Computational Complexity", from 26 August to 4 September 2002. The School will be followed by a topical Conference on "Typical-Case Complexity, Randomness and Analysis of Search Algorithms", from 5 to 7 September 2002.

The aim of both School and Conference is to encourage young, qualified mathematicians, computer scientists and theoretical physicists to broaden their horizons, learn new subjects and apply the sophisticated tools developed in mathematics and theoretical physics to the field of computer science.

CO-SPONSORS:

- IISI
Intelligent Information Systems Institute
Cornell University
Ithaca, New York, U.S.A.







- MICROSOFT RESEARCH
Redmond,Washington,U.S.A.

"Microsoft is a registered trademark of Microsoft Corporation"









Material:

SCHOOL: DAY 1 - 26 August

Room: Main Building Main Lecture Hall

26 August 2002
08:30
09:15
REGISTRATION
45'
Room: Main Building, Lobby
09:15
09:20
Opening
05'
09:20
10:50
Complexity Theory - Part I
01h30'
Safra, M.
Tel Aviv University
10:50
11:10
Coffee break
20'
Room: Main Building, Lobby
11:10
12:40
Statistical Mechanics - Part I
01h30'
Chayes, J.
Microsoft Research, Redmond
12:40
14:30
Lunch break
01h50'
Room: Main Building Cafeteria
14:30
16:00
Threshold Phenomena. Mathematical Foundations - Part I
01h30'
Kalai, G.
Hebrew University of Jerusalem
16:00
16:30
Coffee break
30'
Room: Main Building, Lobby
16:30
18:00
Random Graphs - Part I
01h30'
Spencer, J.
New York University
SCHOOL: DAY 2 - 27 August

Room: Main Building Main Lecture Hall

27 August 2002
09:00
10:30
Statistical Mechanics - Part ll
01h30'
Chayes, J.
Microsoft Research, Redmond
10:30
11:00
Coffee Break
30'
Room: Main Building, Lobby
11:00
12:30
Complexity Theory - Part ll
01h30'
Safra, M.
Tel Aviv University
12:30
15:00
Lunch Break
02h30'
Room: Main Building Cafeteria
15:00
16:30
Random Graphs - Part ll
01h30'
Spencer, J.
New York University
16:30
17:00
Coffee break
30'
Room: Main Building, Lobby
17:00
18:30
Threshold Phenomena. Mathematical Foundations - Part ll
01h30'
Kalai, G.
Hebrew University of Jerusalem
SCHOOL: DAY 3 - 28 August

Room: Main Building Main Lecture Hall

28 August 2002
09:00
10:30
Statistical Mechanics - Part lll
01h30'
Borgs, C.
Microsoft Research, Redmond
10:30
11:00
Coffee break
30'
Room: Main Building, Lobby
11:00
12:30
Random Graphs - Part lll
01h30'
Spencer, J.
New York University
12:30
15:00
Lunch Break
02h30'
Room: Main Building Cafeteria
15:00
16:30
Threshold Phenomena. Mathematical Foundations - Part III
01h30'
Kalai, G.
Hebrew University of Jerusalem
16:30
17:00
Coffee break
30'
Room: Main Building, Lobby
17:00
18:30
Complexity Theory - Part III
01h30'
Safra, M.
Tel Aviv University
SCHOOL: DAY 4 - 29 August

Room: Main Building Main Lecture Hall

29 August 2002
09:00
10:30
Statistical Mechanics - Part lV
01h30'
Borgs, C.
Microsoft Research, Redmond
10:30
11:00
Coffee break
30'
Room: Main Building, Lobby
11:00
12:30
Statistical Mechanics of Disordered Systems - Part l
01h30'
Mézard, M.
Université de Paris-Sud, Orsay
12:30
15:00
Lunch break
02h30'
Room: Main Building Cafeteria
15:00
16:30
Graph Theory and Networks. Generation of Scale Free Graphs - Part l
01h30'
Bollobas, B.
The University of Memphis
16:30
17:00
Coffee break
30'
Room: Main Building, Lobby
17:00
18:30
The Easiest Hard Problem. Statistical Analysis of Number Partitioning
01h30'
Mertens, S.
Otto-von-Guericke Universität, Magdeburg
SCHOOL: DAY 5 - 30 August

Room: Main Building Main Lecture Hall

30 August 2002
09:00
10:30
Graph Theory and Networks. Generation of Scale Free Graphs - Part ll
01h30'
Bollobas, B.
The University of Memphis
10:30
11:00
Coffee break
30'
Room: Main Building, Lobby
11:00
12:30
Statistical Mechanics of Disordered Systems - Part II
01h30'
Mézard, M.
Université de Paris-Sud, Orsay
SCHOOL: DAY 6 - 2 September

Room: Main Building Main Lecture Hall

2 September 2002
09:00
10:30
Vertex Covers on Random Graphs. A Statistical Mechanics Approach
01h30'
Weigt, M.
Georg-August Universität, Göttingen
10:30
11:00
Coffee break
30'
Room: Main Building, Lobby
11:00
12:30
Dynamics of Algorithms - Part l
01h30'
Monasson, R.
Ecole Normale Supérieure, Paris
12:30
15:00
Lunch break
02h30'
Room: Main Building Cafeteria
15:00
16:30
Heuristic Algorithms - Part l
01h30'
Selman, B.
Cornell University, Ithaca
16:30
17:00
Coffee break
30'
Room: Main Building, Lobby
17:00
18:30
Mathematical Foundations of Markov Chain Monte Carlo Algorithms - Part l
01h30'
Sinclair, A.
University of California at Berkeley
SCHOOL: DAY 7 - 3 September

Room: Main Building Main Lecture Hall

3 September 2002
09:00
10:30
Heuristic Algorithms - Part ll
01h30'
Selman, B.
Cornell University, Ithaca
10:30
11:00
Coffee break
30'
Room: Main Building, Lobby
11:00
12:30
Mathematical Foundations of Markov Chain Monte Carlo Algorithms - Part ll
01h30'
Sinclair, A.
University of California at Berkeley
12:30
15:00
Lunch break
02h30'
Room: Main Building, Lobby
15:00
16:30
Statistical Mechanics of Disordered Systems - Part lll
01h30'
Mézard, M.
Université de Paris-Sud, Orsay
16:30
17:00
Coffee break
30'
Room: Main Building, Lobby
16:55
18:30
REAL WORLD APPLICATION
01h35'
17:00
18:30
Internet Graphs and their Generation
01h30'
Barabasi, L.
University of Notre Dame
SCHOOL: DAY 8 - 4 September

Room: Main Building Main Lecture Hall

4 September 2002
09:00
10:30
Mathematical Foundations of Markov Chain Monte Carlo Algorithms - Part lll
01h30'
Sinclair, A.
University of California at Berkeley
10:30
11:00
Coffee break
30'
Room: Main Building, Lobby
11:00
12:30
Dynamics of Algorithms - Part ll
01h30'
Monasson, R.
Ecole Normale Supérieure, Paris
12:30
14:30
Lunch break
02h00'
14:25
17:55
REAL WORLD APPLICATIONS
03h30'
14:30
15:15
Error correcting codes
45'
Montanari, A.
Ecole Normale Supérieure, Paris
15:30
16:15
Planning problems
45'
Giunchiglia, E.
Università di Genova
16:15
16:45
Coffee break
30'
Room: Main Building, Lobby
16:45
17:30
Protein folding as an optimization problem
45'
Maritan, A.
SISSA, Trieste
17:30
18:00
Overview of Genomics
30'
Boncinelli, E.
SISSA, Trieste
18:00
19:00
POSTER SESSION
01h00'
Room: Main Building, Lobby
CONFERENCE: DAY 1 - 5 September

Room: Main Building Main Lecture Hall

5 September 2002
09:30
10:00
The phase diagram of the integer partitioning problem
30'
Borgs, C.
Microsoft Research, Redmond
10:00
10:30
Phase transition in multiprocessor scheduling
30'
Mertens, S.
Otto-von-Guericke Universitat, Magdeburg
10:30
11:00
Coffee break
30'
Room: Main Building, Lobby
11:00
11:30
Statistical physics and combinatorial optimization
30'
Parisi, G.
Universita di Roma "La Sapienza"
11:30
12:00
Lower bounds for the satisfiability threshold. Greediness pays
30'
Kirousis, L.
University of Patras
12:00
12:30
Static and dynamic rare events in hard combinatorial problems
30'
Montanari, A.
Ecole Normale Supérieure, Paris
12:30
15:00
Lunch break
02h30'
15:00
15:30
From analytic solutions to algorithms in the statistical physics approach to random 3-sat
30'
Zecchina, R.
the Abdus Salam ICTP, Trieste
15:30
16:00
Coloring random graphs
30'
Weigt, M.
Georg-August Universitat, Gottingen
16:00
16:30
Coffee break
30'
Room: Main Building, Lobby
16:30
17:00
Empirical result on frozen development at the phase transition
30'
Culberson, J.
University of Alberta, Edmonton
17:00
17:30
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
30'
Teng, S.
Boston University
17:30
18:00
to be announced
30'
Franco, J.
University of Cincinnati
18:00
18:15
POSTER SESSION (continued)
15'
CONFERENCE: DAY 2 - 6 September

Room: Main Building Main Lecture Hall

6 September 2002
09:30
10:00
From k-XORSAT to random generalized satisfiability problems
30'
Daudé, H.
Université de Provence, Marseille
10:00
10:30
Alternative solutions to the random k-XORSAT problem
30'
Ricci-Tersenghi, F.
Università di Roma "La Sapienza"
10:30
11:00
Coffee break
30'
11:00
11:30
Stop-and-Restart procedure for random 3 - SAT
30'
Cocco, S.
Université Louis Pasteur, Strasbourg
11:30
12:00
Replica bounds in diluted systems
30'
Franz, S.
the Abdus Salam ICTP, Trieste
12:00
12:30
Closing the asymptotic gap in the k-SAT threshold
30'
Moore, C.
Santa Fe Institute
12:30
14:30
Lunch break
02h00'
Room: Main Building Cafeteria
14:30
15:00
Energy and geometry landscapes of spin glasses
30'
Martin, O. C.
Université de Paris-Sud, Orsay
15:00
15:30
Semi Definite programming methods for satisfiability support 2+p-SAT threshold claim
30'
van Maaren, H.
Delft Uinversity of Technology
15:30
16:00
Coffee break
30'
Room: Main Building, Lobby
16:00
16:30
The interface between P and NP: COL, XOR, NAE 1-in k, and Horn SAT
30'
Walsh, T.
University College Cork
16:30
17:00
New results on K-Cores in both regular and scale-free networks
30'
Kirkpatrick, S.
The Hebrew University of Jersalem
17:00
17:30
Directed Scale - Free Graphs
30'
Chayes, J.
Microsoft Research, Redmond
17:30
17:45
Closing remarks
15'
17:45
18:00
POSTER SESSION (continued)
15'
CONFERENCE: DAY 3 - 7 September (Saturday)

Room: Main Building Main Lecture Hall

7 September 2002
FREE
If you want to make a direct link from your Web page to this agenda, please use this URL:
http://cdsagenda5.ictp.trieste.it/full_display.php?ida=a01155
Maintained by: The CDS Support Team (Bugs and reports)
This page is loaded in 0.38294792175293 seconds.