Skip to main content
Go to the home page of the European Commission (opens in new window)
English en
CORDIS - EU research results
CORDIS
Content archived on 2024-06-18

The contraction method for random recurrences, and probabilistic analysis of algorithms

Objective

This research is aimed at the probabilistic analysis of 'divide-and-conquer' algorithms, which include fundamental examples such as quicksort, partial match queries on k-d trees, and multiple selection.

In order to gain a detailed understanding of such algorithms, a fine stochastic analysis is needed which may include higher order moments, concentration around the mean and in the best base, a limiting distribution.

The contraction method, introduced by Rosler in 1991, was the first method capable of unlocking the exact limiting distribution of the quicksort algorithm. Since then, Ruschendorf, and in particular, Neininger have expanded and successfully used this method to achieve limit laws for tens of challenging problems.

The objectives of this research is to broaden the scope of tools to include this new powerful method, and then to investigate new problems which show particular promise in their ability to apply the contraction method. We would like to investigate properties such as the height of certain tree models, in particular, the d-ary pyramids introduced by Mahmoud.

In the area of multivariate search trees, there are still many holes in what is known regarding the partial match query. The aim is to achieve a limiting distribution for the cost o f partial match on the ordinary k-d tree. Multivariate treaps are generalized search trees augmented with heap-ordered time stamps.

This research will also explore the complexity of partial match on this tree using the contraction method. In fact, partial match complexity on random relaxed k-d trees and relaxed quadtrees is as yet totally unexplored.

The research will carefully combine other mathematical tools, such as concentration inequalities, which can nail down certain aspects of the algorithm, branching processes which can often be used to model certain growth behaviours of an algorithm or random structure, and properties of random continuous processes such as Brownian motions and excursions.

Fields of science (EuroSciVoc)

CORDIS classifies projects with EuroSciVoc, a multilingual taxonomy of fields of science, through a semi-automatic process based on NLP techniques. See: The European Science Vocabulary.

You need to log in or register to use this function

Keywords

Project’s keywords as indicated by the project coordinator. Not to be confused with the EuroSciVoc taxonomy (Fields of science)

Topic(s)

Calls for proposals are divided into topics. A topic defines a specific subject or area for which applicants can submit proposals. The description of a topic comprises its specific scope and the expected impact of the funded project.

Call for proposal

Procedure for inviting applicants to submit project proposals, with the aim of receiving EU funding.

FP6-2005-MOBILITY-7
See other projects for this call

Funding Scheme

Funding scheme (or “Type of Action”) inside a programme with common features. It specifies: the scope of what is funded; the reimbursement rate; specific evaluation criteria to qualify for funding; and the use of simplified forms of costs like lump sums.

IIF - Marie Curie actions-Incoming International Fellowships

Coordinator

JOHANN WOLFGANG GOETHE-UNIVERSITÄT FRANKFURT AM MAIN
EU contribution
No data
Total cost

The total costs incurred by this organisation to participate in the project, including direct and indirect costs. This amount is a subset of the overall project budget.

No data
My booklet 0 0