%------------------------------------------------------
% Persistence - Amortized analysis - Singularities
%------------------------------------------------------
@article
 {ken,
  author="C. Kenyon and J. Scott Vitter",
  title="The maximum size of dynamic data structures",
  journal="SIAM J. Computing",
  year="1991",
  volume="20",
  number="5",
  pages=""
}

@article
 {fla1,
  author="P. Flajolet and A. Odlyzko",
  title="Singularity analysis of generating functions",
  journal="SIAM J. Disc. Math.",
  year="1990",
  volume="3",
  number="2",
  pages="216-240"
}

@article
 {fla2,
  author="P. Flajolet and M. Soria",
  title="General combinatorial schemas : Gaussian limit
         distributions and exponential tails",
  journal="Discrete Mathematics",
  year="1993",
  volume="114",
  number="",
  pages="159-180"
}

@article
 {tar,
  author="R. Tarjan",
  title="Amortized computational complexity",
  journal="SIAM J. Alg. Disc. Meth.",
  year="1985",
  volume="6",
  number="2",
  pages="306-318"
}

@article
 {dris,
  author="J. Driscoll and others",
  title="Making data structures persistent",
  journal="J. of Computer and System Sciences",
  year="1989",
  volume="38",
  number="",
  pages="86-124"
}


@article
 {meh,
  author="K. Mehlhorn and A. Tsakalidis",
  title="An amortized analysis of insertions into 
         AVL-trees",
  journal="SIAM J. Computing",
  year="1986",
  volume="15",
  number="1",
  pages="22-33"
}


@inproceedings
 {die,
  author="P. Dietz and R. Raman",
  title="Persistence, Amortization and Randomization",
  booktitle="ACM Symposium on Discrete Algorithms",
  address="",
  year="1990",
  pages=""
}

@inproceedings
 {dri,
  author="J. Driscoll and D. Sleator and R. Tarjan",
  title="Fully Persistent Lists with Catenation",
  booktitle="ACM Symposium on Discrete Algorithms",
  address="",
  year="1990",
  pages=""
}


@article
 {kr,
  author="S. Kapoor and E. Reingold",
  title="Stochastic rearrangements rules for self-organizing
         data structures",
  journal="Algorithmica",
  year="1991",
  volume="6",
  number="",
  pages="278-291"
}


@article
 {,
  author="R. Baeza-Yates",
  title="Fringe Analysis Revisited",
  journal="ACM Computing surveys",
  year="1995",
  volume="27",
  number="1",
  pages=""
}



%-----------------------
% Recurrences
%-----------------------
@article
 {rv,
  author="R. Verma",
  title="A general method and a master theorem for divide-and-conquer
         recurrences with applications",
  journal="J. of Algorithms",
  year="1994",
  volume="16",
  number="",
  pages="67-79"
}


@article
 {ald,
  author="D. Aldous",
  title="Recursive self-similarity for random trees, random
         triangulations and Brownian excursion",
  journal="The Annals of probability",
  year="1994",
  volume="22",
  number="2",
  pages="527-545"
}

%-----------------------
% Permutations
%-----------------------
@article
 {vie1,
  author="G. Viennot",
  title="\'Equidistribution des permutations ayant une forme
         donn\'ee selon  les avances et coavances",
  journal="J. of Combinatorial Theory A",
  year="1981",
  volume="31",
  number="",
  pages=""
}

@article
 {vie2,
  author="G. Viennot",
  title="Permutations ayant une forme donn\'ee",
  journal="Discrete Mathematics",
  year="1979",
  volume="26",
  number="",
  pages="279-284"
}

@article
 {,
  author="P. Flajolet",
  title="Combinatorial aspects of continued fractions",
  journal="Discrete Mathematics",
  year="1980",
  volume="32",
  number="",
  pages="125-161"
}


@article
 {,
  author="P. Flajolet and others",
  title="Sequence of operations analysis for dynamic
         data structures",
  journal="J. of Algorithms",
  year="1980",
  volume="1",
  number="",
  pages="111-141"
}