The following pages link to Philippe Flajolet (Q640841):
Displaying 50 items.
- (Q224248) (redirect page) (← links)
- On adaptive sampling (Q582040) (← links)
- Gaussian limiting distributions for the number of components in combinatorial structures (Q582688) (← links)
- The enumeration of prudent polygons by area and its unusual asymptotics (Q640842) (← links)
- Combinatorial models of creation-annihilation (Q658970) (← links)
- Mellin transforms and asymptotics: Harmonic sums (Q672981) (← links)
- Mellin transforms and asymptotics: Finite differences and Rice's integrals (Q672985) (← links)
- General combinatorial schemas: Gaussian limit distributions and exponential tails (Q685672) (← links)
- Non-overlapping partitions, continued fractions, Bessel functions and a divergent series (Q810024) (← links)
- A hybrid of Darboux's method and singularity analysis in combinatorial asymptotics (Q870022) (← links)
- The first cycles in an evolving graph (Q910415) (← links)
- On differences of zeta values (Q939509) (← links)
- On the performance evaluation of extendible hashing and trie searching (Q1052098) (← links)
- Approximate counting: a detailed analysis (Q1057061) (← links)
- The analysis of simple list structures (Q1067775) (← links)
- Probabilistic counting algorithms for data base applications (Q1069325) (← links)
- Analytic models and ambiguity of context-free languages (Q1088414) (← links)
- Level number sequences for trees (Q1096638) (← links)
- Deviations from uniformity in random strings (Q1099625) (← links)
- Prefixes of infinite words and ambiguous context-free languages (Q1108044) (← links)
- Continued fraction algorithms, functional operators, and structure constants (Q1127539) (← links)
- Combinatorial aspects of continued fractions (Q1145147) (← links)
- On congruences and continued fractions for some classical combinatorial quantities (Q1167725) (← links)
- The average height of binary trees and other simple trees (Q1171885) (← links)
- Automatic average-case analysis of algorithms (Q1174718) (← links)
- Page usage in a quadtree index (Q1198966) (← links)
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search (Q1201808) (← links)
- The number of registers required for evaluating arithmetic expressions (Q1258177) (← links)
- Singularity analysis and asymptotics of Bernoulli sums (Q1285597) (← links)
- Properties of random triangulations and trees (Q1293354) (← links)
- Analytic combinatorics of non-crossing configurations (Q1300975) (← links)
- Analytic variations on quadtrees (Q1310465) (← links)
- Mellin transforms and asymptotics: Digital sums (Q1314384) (← links)
- A calculus for the random generation of labelled combinatorial structures (Q1334654) (← links)
- Mellin transforms and asymptotics. The mergesort recurrence (Q1338908) (← links)
- Generating functions for generating trees (Q1348138) (← links)
- Analytic variations on bucket selection and sorting (Q1567201) (← links)
- Basic analytic combinatorics of directed lattice paths (Q1603684) (← links)
- Singularity analysis, Hadamard products, and tree recurrences (Q1765441) (← links)
- Analytic urns (Q1781182) (← links)
- Elliptic functions, continued fractions and doubled permutations (Q1823245) (← links)
- Dynamical sources in information theory: A general analysis of trie structures (Q1840518) (← links)
- On the robustness of interconnections in random graphs: a symbolic approach. (Q1853495) (← links)
- Motif statistics. (Q1853502) (← links)
- Airy phenomena and analytic combinatorics of connected graphs (Q1883647) (← links)
- On Ramanujan's \(Q\)-function (Q1894389) (← links)
- Computer algebra libraries for combinatorial structures (Q1918485) (← links)
- Asymptotics of Mahler recurrences: The cyclotomic case (Q1919149) (← links)
- Pseudo-factorials, elliptic functions, and continued fractions (Q2270201) (← links)
- Lindelöf representations and (non-)holonomic sequences (Q2380433) (← links)
