| Publication | Date of Publication | Type |
|---|
| Building sources of zero entropy: rescaling and inserting delays (invited talk) | 2024-05-14 | Paper |
| Two Arithmetical Sources and Their Associated Tries | 2023-02-07 | Paper |
| Dichotomic Selection on Words: A Probabilistic Analysis | 2022-07-18 | Paper |
| Algorithms for computing signs of \(2 \times 2\) determinants: dynamics and average-case analysis | 2021-12-20 | Paper |
| The Depoissonisation quintet: Rice-Poisson-Mellin-Newton-Laplace | 2021-06-15 | Paper |
| Analysis of generalized continued fraction algorithms over polynomials | 2021-06-10 | Paper |
| Gaussian behavior of quadratic irrationals | 2021-03-17 | Paper |
| Analysis of the continued logarithm algorithm | 2020-02-12 | Paper |
| Typical Depth of a Digital Search Tree built on a general source | 2019-09-17 | Paper |
| The recurrence function of a random Sturmian word | 2019-09-17 | Paper |
| Analysis of fast versions of the Euclid Algorithm | 2019-09-16 | Paper |
| The Brun gcd algorithm in high dimensions is almost always subtractive | 2017-10-10 | Paper |
| Pseudo-randomness of a random Kronecker sequence. An instance of dynamical analysis | 2017-10-06 | Paper |
| Towards a Realistic Analysis of Some Popular Sorting Algorithms | 2017-10-04 | Paper |
| Gaussian Distribution of Trie Depth for Strongly Tame Sources | 2017-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5267687 | 2017-06-13 | Paper |
| Analysis of the Brun Gcd Algorithm | 2017-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2959908 | 2017-02-10 | Paper |
| Multiple GCDs. probabilistic analysis of the plain algorithm | 2017-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2959935 | 2017-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957920 | 2017-01-30 | Paper |
| Towards a realistic analysis of the QuickSelect algorithm | 2016-06-03 | Paper |
| Information theory: sources, Dirichlet series, and realistic analyses of data structures | 2016-03-01 | Paper |
| Probabilistic analyses of the plain multiple gcd algorithm | 2015-12-08 | Paper |
| Recurrence Function on Sturmian Words: A Probabilistic Study | 2015-09-16 | Paper |
| Philippe Flajolet | 2015-02-20 | Paper |
| The Euclid algorithm is ``totally Gaussian | 2014-09-29 | Paper |
| Philippe flajolet, the father of analytic combinatorics | 2014-09-09 | Paper |
| Fine costs for Euclid's algorithm on polynomials and Farey maps | 2014-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4904103 | 2013-01-28 | Paper |
| Philippe Flajolet, founder of analytic combinatorics | 2012-07-23 | Paper |
| Twenty-five years of scientific partnership with Philippe Flajolet | 2012-07-23 | Paper |
| Pseudorandomness of a random Kronecker sequence | 2012-06-29 | Paper |
| Philippe Flajolet, the father of analytic combinatorics | 2012-04-26 | Paper |
| In memoriam: Philippe Flajolet, the father of analytic combinatorics | 2012-02-28 | Paper |
| PHILIPPE FLAJOLET 1 December 1948 – 22 March 2011 | 2011-12-08 | Paper |
| Philippe Flajolet, the father of analytic combinatorics | 2011-09-12 | Paper |
| An affine point of view on minima finding in integer lattices of lower dimensions | 2011-04-16 | Paper |
| Small quotients in Euclidean algorithms | 2011-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576764 | 2010-08-02 | Paper |
| On the non randomness of modular arithmetic progressions | 2010-07-05 | Paper |
| Modelling the LLL Algorithm by Sandpiles | 2010-04-27 | Paper |
| Probabilistic Analyses of Lattice Reduction Algorithms | 2010-03-05 | Paper |
| The Number of Symbol Comparisons in QuickSort and QuickSelect | 2009-07-14 | Paper |
| Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms | 2009-06-18 | Paper |
| Hidden word statistics | 2008-12-21 | Paper |
| Pattern Matching Statistics on Correlated Sources | 2008-09-18 | Paper |
| Sharp Estimates for the Main Parameters of the Euclid Algorithm | 2008-09-18 | Paper |
| Gaussian laws for the main parameters of the Euclid algorithms | 2008-04-23 | Paper |
| Hausdorff dimension of real numbers with bounded digit averages | 2007-01-05 | Paper |
| Euclidean dynamics | 2006-09-14 | Paper |
| The Lyapunov tortoise and the dyadic hare | 2006-08-29 | Paper |
| Dynamical Analysis of the Parametrized Lehmer–Euclid Algorithm | 2005-04-18 | Paper |
| Euclidean algorithms are Gaussian | 2005-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154707 | 2005-01-14 | Paper |
| Exponential decay of correlations for surface semi-flows without finite Markov partitions | 2004-12-01 | Paper |
| Erratum to: Dynamical sources in information theory: Fundamental intervals and word prefixes | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428912 | 2003-09-22 | Paper |
| Dynamical analysis of a class of Euclidean algorithms. | 2003-08-17 | Paper |
| Dynamical analysis of α-Euclidean algorithms | 2003-03-23 | Paper |
| Dynamical sources in information theory: Fundamental intervals and word prefixes | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535016 | 2002-06-12 | Paper |
| On the stack-size of general tries | 2002-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4524517 | 2002-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754158 | 2001-11-11 | Paper |
| Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems | 2001-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508390 | 2001-02-05 | Paper |
| Dynamical sources in information theory: A general analysis of trie structures | 2001-01-01 | Paper |
| Dynamics of continued fractions with periodic constraints | 1999-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250221 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840152 | 1999-03-07 | Paper |
| Dynamics of the binary Euclidean algorithm: Functional analysis and operators | 1999-02-02 | Paper |
| Continued fraction algorithms, functional operators, and structure constants | 1998-08-13 | Paper |
| An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction | 1997-12-18 | Paper |
| Opérateurs de Ruelle-Mayer généralisés et analyse en moyenne des algorithmes d'Euclide et de Gauss | 1997-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4847924 | 1996-07-16 | Paper |
| Distribution of Hermite's constant and the shortest vector in lattices of dimension two | 1996-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4860760 | 1996-02-13 | Paper |
| An upper bound on the average number of iterations of the LLL algorithm | 1994-03-03 | Paper |
| Gauss' algorithm revisited | 1992-06-28 | Paper |
| Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3202941 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197948 | 1990-01-01 | Paper |
| La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033825 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033821 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033822 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3807117 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033846 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3737502 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3743368 | 1986-01-01 | Paper |
