1. Foreword

   • Alois Panholzer
   • Helmut Prodinger

   EditorialNotes 31 March 2009 Pages: 353 - 355

2. Enumeration of Decomposable Combinatorial Structures with Restricted Patterns

   • Li Dong
   • Zhicheng Gao
   • Daniel Panario

   OriginalPaper 31 March 2009 Pages: 357 - 372

3. The Height of Increasing Trees

   • Michael Drmota

   OriginalPaper 31 March 2009 Pages: 373 - 402

4. Precise Logarithmic Asymptotics for the Right Tails of Some Limit Random Variables for Random Trees

   • James Allen Fill
   • Svante Janson

   OriginalPaper 31 March 2009 Pages: 403 - 416

5. Sorting Using Complete Subintervals and the Maximum Number of Runs in a Randomly Evolving Sequence

   • Svante Janson

   OriginalPaper 31 March 2009 Pages: 417 - 447

6. The Asymmetric Leader Election Algorithm: Another Approach

   • Guy Louchard
   • Helmut Prodinger

   OriginalPaper 31 March 2009 Pages: 449 - 478

7. Left and Right Length of Paths in Binary Trees or on a Question of Knuth

   • Alois Panholzer

   OriginalPaper 31 March 2009 Pages: 479 - 492

8. On Tries, Contention Trees and Their Analysis

   • Stephan Wagner

   OriginalPaper 31 March 2009 Pages: 493 - 507

9. Random and Exhaustive Generation of Permutations and Cycles

   • Mark C. Wilson

   OriginalPaper 31 March 2009 Pages: 509 - 520