|Registration Deadline:||May 23, 2004 almost 13 years ago|
|To apply for Funding you must register by:||March 14, 2004 about 13 years ago|
The electronic journal Discrete Mathematics and Theoretical Computer Science defines the field of Analysis of Algorithms as follows:
Analysis of algorithms is concerned with accurate estimates of complexity parameters of algorithms and aims at predicting the behavior of a given algorithm run in a given environment. It develops general methods for obtaining closed-form formulae, asymptotic estimates, and probability distributions for combinatorial or probabilistic quantities, that are of interest in the optimization of algorithms. Interest is also placed on the methods themselves, whether combinatorial, probabilistic, or analytic. Combinatorial and statistical properties of discrete structures (strings, trees, tries, dags, graphs, and so on) as well as mathematical objects (e.g., continued fractions, polynomials, operators) that are relevant to the design of efficient algorithms are investigated.
Since its inception in 1963, the field has undergone substantial changes. We see now the emergence of combinatorial and asymptotic methods that allow the classification of data structures into broad categories that are amenable to a unified treatment. In recent years, probabilistic methods, which have been so successful in the study of random graphs and hard combinatorial optimization problems, have also been shown to play an important role in this field. These developments have two important consequences for the analysis of algorithms: it becomes possible to predict average behavior under more general probabilistic models than before; at the same time it becomes possible to analyze algorithms that are more structurally complex than before. To achieve these goals, the analysis of algorithms draws on a number of branches of mathematics: combinatorics, probability theory, graph theory, real and complex analysis, number theory, and occasionally algebra, geometry, operations research, and others.
Information theory appears to be an area of strong synergy with analysis of algorithms. This synergy has already yielded very interesting results, such as the characterization of structural properties of the Lempel-Ziv parsing tree and a precise asymptotic characterization of the redundancy of the Lempel-Ziv data compression scheme. Thus, techniques from analysis of algorithms have given new insights into the structure of the algorithms used in information theory, as well as their information-theoretic performance. One of the goals of this workshop will be to explore this inter-disciplinary connection further.
We anticipate that the workshop will include about 30 lectures and 5 plenary speakers.
To apply for funding, you must register by the funding application deadline displayed above.
Students, recent Ph.D.'s, women, and members of underrepresented minorities are particularly encouraged to apply. Funding awards are typically made 6 weeks before the workshop begins. Requests received after the funding deadline are considered only if additional funds become available.
A block of rooms has been reserved at the Rose Garden Inn. Reservations may be made by calling 1-800-992-9005 OR directly on their website. Click on Corporate at the bottom of the screen and when prompted enter code MATH (this code is not case sensitive). By using this code a new calendar will appear and will show MSRI rate on all room types available.
A block of rooms has been reserved at the Hotel Durant. Reservations may be made by calling 1-800-238-7268. When making reservations, guests must request the MSRI preferred rate. If you are making your reservations on line, please go to this link and enter the promo/corporate code MSRI123. Our preferred rate is $129 per night for a Deluxe Queen/King, based on availability.
Additional lodging options (short term housing page - Short Term Housing