Journal: Algorithmica

Volume 46, Issue 3-4

247 -- 248Philippe Jacquet, Daniel Panario, Wojciech Szpankowski. Preface
249 -- 270Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger. Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis
271 -- 297Nicolas Broutin, Luc Devroye. Large Deviations for the Weighted Height of an Extended Class of Trees
299 -- 327Brigitte Chauvin, Michael Drmota. The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees
329 -- 343Sylvie Corteel, William M. Y. Goh, Pawel Hitczenko. A Local Limit Theorem in the Theory of Overpartitions
345 -- 366James Allen Fill, Nevin Kapur, Alois Panholzer. Destruction of Very Simple Trees
367 -- 407Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger. Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
409 -- 418Jennie C. Hansen, Eric Schmutz, Li Sheng. The Expected Size of the Rule k Dominating Set
419 -- 429Svante Janson. Left and Right Pathlengths in Random Binary Trees
431 -- 467Guy Louchard, Helmut Prodinger. Asymptotics of the Moments of Extreme-Value Related Distribution Functions
469 -- 491Moritz G. Maaß. Average-Case Analysis of Approximate Trie Search
493 -- 503Mohamed Omar, Daniel Panario, L. Bruce Richmond, Jacki Whitely. Asymptotics of Largest Components in Combinatorial Structures
505 -- 527Dominique Poulalhon, Gilles Schaeffer. Optimal Coding and Sampling of Triangulations
529 -- 555Vlady Ravelomanana. The Average Size of Giant Components between the Double-Jump
557 -- 565Gadiel Seroussi. On the Number of t-Ary Trees with a Given Path Length