Philippe Flajolet's early work in combinatorics
From MaRDI portal
Publication:6097991
DOI10.54550/eca2022v2s1h1zbMath1512.05040arXiv2103.15791MaRDI QIDQ6097991
Publication date: 9 June 2023
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.15791
register functionapproximate countingRamanujan's \(Q\)-functionprobabilistic countingadding a new slice
Exact enumeration problems, generating functions (05A15) Other combinatorial number theory (11B75) Asymptotic enumeration (05A16) Special sequences and polynomials (11B83) Data structures (68P05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mellin transforms and asymptotics: Finite differences and Rice's integrals
- Approximate counting: a detailed analysis
- Probabilistic counting algorithms for data base applications
- Level number sequences for trees
- Combinatorial aspects of continued fractions
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Sur la fonction sommatoire de la fonction 'somme des chiffres'
- The average number of registers needed to evaluate a binary tree optimally
- The number of registers required for evaluating arithmetic expressions
- Philippe Flajolet's research in analysis of algorithms and combinatorics
- Mellin transforms and asymptotics: Digital sums
- On Ramanujan's \(Q\)-function
- The scientific works of Rainer Kemp (1949--2004)
- Generalized approximate counting revisited
- Singularity Analysis of Generating Functions
- Digital Search Trees Revisited
- A Note on Gray Code and Odd-Even Merge
- Data Movement in Odd-Even Merging
- Euler Sums and Contour Integral Representations
- Automatic Sequences
- The on-line encyclopedia of integer sequences
This page was built for publication: Philippe Flajolet's early work in combinatorics
