Volume 75, Issue 4

August 2016

Special Issue: Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms

Issue Editors:

8 articles in this issue

Introduction for S.I. AofA14
Mireille Bousquet-Mélou
Robert Sedgewick
Michèle Soria
EditorialNotes 12 May 2016 Pages: 577 - 578
An Asymptotic Analysis of Labeled and Unlabeled k-Trees
Michael Drmota
Emma Yu Jin
OriginalPaper 23 July 2015 Pages: 579 - 605
Compositions into Powers of b: Asymptotic Enumeration and Parameters
Daniel Krenn
Stephan Wagner
OriginalPaper Open access 08 September 2015 Pages: 606 - 631
Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy’s Partitioning Scheme
Markus E. Nebel
Sebastian Wild
Conrado Martínez
OriginalPaper 08 August 2015 Pages: 632 - 683
On the Cost of Fixed Partial Match Queries in K-d Trees
Amalia Duch
Gustavo Lau
Conrado Martínez
OriginalPaper 11 December 2015 Pages: 684 - 723
A Unified Approach to Linear Probing Hashing with Buckets
Svante Janson
Alfredo Viola
OriginalPaper 05 February 2016 Pages: 724 - 781
Asymptotic Lattice Path Enumeration Using Diagonals
Stephen Melczer
Marni Mishna
OriginalPaper 14 September 2015 Pages: 782 - 811
Complexity of Anticipated Rejection Algorithms and the Darling–Mandelbrot Distribution
Axel Bacher
Andrea Sportiello
OriginalPaper 31 July 2015 Pages: 812 - 831

Search