The following pages link to Philippe Flajolet (Q640841):
Displaying 50 items.
- Fast computation of special resultants (Q2457312) (← links)
- Combinatorial aspects of continued fractions. (Reprint) (Q2497999) (← links)
- On the non-holonomic character of logarithms, powers, and the \(n\)th prime function (Q2570990) (← links)
- The Fermat cubic, elliptic functions, continued fractions, and a combinatorial excursion (Q2654565) (← links)
- The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields (Q2746437) (← links)
- (Q2754159) (← links)
- D?E?K=(1000)8 (Q2772918) (← links)
- Random maps, coalescing saddles, singularity analysis, and Airy phenomena (Q2772920) (← links)
- Some New Self-avoiding Walk and Polygon Models (Q2898443) (← links)
- (Q2934591) (← links)
- The height of random binary unlabelled trees (Q2959857) (← links)
- (Q2959891) (← links)
- (Q2959908) (← links)
- On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel (Q3028854) (← links)
- (Q3036718) (← links)
- (Q3138944) (← links)
- The distribution of height and diameter in random non-plane binary trees (Q3165458) (← links)
- The Cycle Construction (Q3199417) (← links)
- (Q3323261) (← links)
- Isomorphism and Symmetries in Random Phylogenetic Trees (Q3402055) (← links)
- (Q3469186) (← links)
- Singularity Analysis of Generating Functions (Q3496337) (← links)
- Hidden word statistics (Q3546297) (← links)
- (Q3549563) (← links)
- (Q3574983) (← links)
- The Number of Symbol Comparisons in QuickSort and QuickSelect (Q3638078) (← links)
- (Q3660917) (← links)
- (Q3674050) (← links)
- (Q3675510) (← links)
- Analysis of a stack algorithm for random multiple-access communication (Q3676042) (← links)
- Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumerations (Q3681092) (← links)
- <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access (Q3682375) (← links)
- Patterns and pattern-matching in trees: An analysis (Q3683556) (← links)
- (Q3686051) (← links)
- (Q3687739) (← links)
- (Q3704890) (← links)
- (Q3728003) (← links)
- (Q3738554) (← links)
- Digital Search Trees Revisited (Q3751029) (← links)
- Register Allocation for Unary–Binary Trees (Q3753507) (← links)
- (Q3764995) (← links)
- The complexity of generating an exponentially distributed variate (Q3768393) (← links)
- Estimating the multiplicities of conflicts to speed their resolution in multiple access channels (Q3773810) (← links)
- A complexity calculus for recursive tree algorithms (Q3806812) (← links)
- (Q3814832) (← links)
- (Q3840165) (← links)
- (Q3862384) (← links)
- (Q3873556) (← links)
- (Q3888542) (← links)
- Combinatorial Aspects of Continued Fractions (Q3889058) (← links)
