Special issue on Mathematical Analysis of Algorithms (Algorithmica, to appear)

by: Prodinger-Szpankowski
Table of Contents:

H. Prodinger, W. Szpankowski...............Preface (2 pages)
U. Roesler, L. Rueschendorf..............The contraction method for recursive algorithms (invited paper) 35 pages
G. Andrews, A. Knopfmacher................An algorithmic approach to discovering and proving q-series identities 13 pages
H.-H. Chern, H.-K. Hwang.............Transitional behaviors of the average cost of quicksort with median-of-(2t+1) 24 pages
J. Clément, P. Flajolet, B. Vallée.................Dynamical Sources in Information Theory: A General Analysis of Trie Structures 62 Pages
E. Coffman, A. Stolyar..................Bandwith packing 20 pages
M. Drmota.........................An analytic approach to the height of binary search trees 24 pages
M. Drmota, D. Gardy, B. Gittenberger................A unified presentation of some urn models 21 pages
J. Hansen, E. Schmutz.........................Near-Optimal Bounded-Degree Spanning Trees 35 pages
C. Martinez, A. Panholzer, H. Prodinger....................Partial match queries in relaxed multidimensional search trees 25 pages
D. Panario, B. Richmond.........................Smallest components in decomposable structures 30 pages
P. Poblete...........................................Analysis of an adaptive algorithm to find the two nearest neighbors 15 pages
U. Roesler.......................On the analysis of stochastic divide and conquer algorithms 31 pages
B. Vallee.....................Dynamical Sources in Information Theory : Fundamental Intervals and Word Prefixes 37 pages


The preface is available in the PostScript format.
(Back to List of Papers)