Sciweavers

3 search results - page 1 / 1
» Exact Asymptotics of Divide-and-Conquer Recurrences
Sort
View
ICALP
1993
Springer
13 years 7 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
ACTA
1998
69views more  ACTA 1998»
13 years 3 months ago
Asymptotic Expansions of the Mergesort Recurrences
This note provides exact formulæ for the mean and variance of the cost of top-down recursive mergesort. These formulæ improve upon earlier results of Flajolet and Golin. Key wor...
Hsien-Kuei Hwang
JCT
2010
83views more  JCT 2010»
13 years 2 months ago
Families of prudent self-avoiding walks
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that ha...
Mireille Bousquet-Mélou