An activity of an i-MATH Intensive Research Programme
|
An activity of an i-MATH Intensive Research Programme |
|
Group picture (new!)
| Dates: | September 14 to 18, 2009 | ||
| Place: | Centre de Recerca Matemàtica (CRM), Bellaterra, Barcelona, Spain |
|
Speakers
| Achlioptas, Dimitris | UC Santa Cruz |
| Coja-Oghlan, Amin | University of Edinburgh |
| Doerr, Benjamin | Max-Planck-Institut Informatik |
| Goldberg, Leslie | University of Liverpool |
| Golin, Mordecai | The Hong Kong University of Sciences and Technology |
| Hwang, Hsien-Kuei | Academia Sinica |
| Lugosi, Gábor | Universitat Pompeu Fabra |
| Maneva, Elitza | Universitat Politècnica de Catalunya |
| Molloy, Mike | University of Toronto |
| Tetali, Prasad | Georgia Institute of Technology |
| Watanabe, Osamu | Tokyo Institute of Technology |
| Wormald, Nicholas | University of Waterloo |
Goals
The "International
Conference on Probabilistic Techniques in Computer Science" will be one of the
key milestones of the Research Programme organized by the Center for
Mathematical Research (CRM). The main goal of the conference is to gather a
large number of world-renowned experts and young researchers of the area, for
the dissemination of novel results, exchange of scientific ideas among the
participants, and cross-fertilization between the different subareas of "Probabilistic
Techniques in Computer Science".
"Probabilistic Techniques in Computer Science" constitutes a well developed and
very active area of research that combines Theoretical Computer Science,
Discrete Mathematics, Probability Theory and Combinatorics.
Hundreds of papers on probabilistic techniques appear per year in journals and
conference proceedings, both general and specialized in this area, contributing
with fresh ideas and opening novel paths of research.
Within the conference, two main subareas of "Probabilistic Techniques in
Computer Science"
will be addressed, with a clear goal to build bridges between them.
The first, known also as Analysis of Algorithms has as main goal to obtain
precise and mathematically rigorous probabilistic predictions about the
performance of algorithms. In general, the goal is to find the expected cost of
algorithms, and more generally the probability distribution of their costs. For
many important algorithms, the worst-case performance has little practical
relevance as it is highly unlikely; on the contrary, an understanding of their
behavior in typical situations is of great practical value, as well as scientifically
appealing. Besides that, many useful algorithms and data structures using
randomization have been developed in recent years, for which probabilistic
analysis is just the right tool.
The second subarea focuses in the use of probabilistic techniques for the study
of random combinatorial objects. Of particular interest is the study of
threshold phenomena arising in the probabilistic behavior of such random
combinatorial objects, e. g., the sharp transition from satisfactibility to
unsatisfactibility in random k-CNF Boolean formulas as the ratio of formulas to
variables reaches a certain critical density, or the emergence of some
properties in dynamically evolving graphs as the ratio of edges to vertices
reaches some threshold value.
This area is characterized by an interesting cross-fertilization of ideas
between statistical physics onone hand and probability theory, combinatorics and
discrete mathematics on the other.
The conference will last for five days and there will be about a dozen invited
lectures mostly given by top senior researchers. Contributions from researchers
abroad are encouraged and most welcome, including those from young postdocs and
PhD students, so that the conference provides an adequate environment to present
recent, edge-cutting research results in the area. Besides, there will be two
special sessions, one devoted to open problems and the other a panel in which
senior researchers will discuss and debate the main lines and trends for
research in this area for the forthcoming years.
Coordinators
Josep Díaz, LSI, Universitat Politècnica de Catalunya
Lefteris Kirousis, University of Patras, Greece
Conrado Martínez, LSI, Universitat Politècnica de Catalunya
Registration and Financial Support
The CRM offers a limited number of grants covering registration and accommodation addressed to young researchers. Applications can be submitted during the registration process. The on-line registration system enables the following actions:
You will be informed as soon as possible whether support is available.
| Deadline for grant applications: | July 15, 2009 |
| Deadline for registration and payment: | August 20, 2009 |
Registration fee: 250 Euros, including participation to the lectures, documentation package, lunch tickets, a social dinner, a cultural activity, and coffee breaks.
| Registration: pdf file - word file |
| Payment: pdf file - word file |
Call for Contributed Talks
Besides
the invited talks, contributed talks from the participants are encouraged. There
will be no formal proceedings published, and talks about on-going research work
are welcome.
If you intend to participate and present a talk, please send us a title and
abstract (a PDF file of one or two pages) while you register to the activity (Registration) not later than **
August 31st, 2009 **.
Please make sure that
the submitted abstract contains the names and affiliations of all the
authors.
The scientific committee will carry out a selection process among the
contributed talks to check their suitability to the conference themes and to
distribute the available time slots.
Accommodation
Participants awarded with accommodation grants will have their lodging arranged through the organisation. The remaining participants are encouraged to book their lodging as soon as possible.
For further information, please contact the
CRM Administration.
