Analytic analysis of algorithms

DOI10.1007/3-540-55719-9_74MaRDI QIDQ5204317zbMATH OpenOpenAlexFDO

Authors Philippe Flajolet

Publication date 4 December 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00074916/file/RR-1644.pdf

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 18900
• scientific article; zbMATH DE number 976346
• Practical analysis of algorithms
• scientific article; zbMATH DE number 873409
• scientific article; zbMATH DE number 423545
• scientific article; zbMATH DE number 5267
• An Introduction to the Analysis of Algorithms
• scientific article; zbMATH DE number 50694
• On the efficiency of algorithms of analysis

Cites work

• A complexity calculus for recursive tree algorithms
• A diffusion limit for a class of randomly-growing binary trees
• A holonomic systems approach to special functions identities
• A logical approach to asymptotic combinatorics I. First order properties
• A logical approach to asymptotic combinatorics. II: Monadic second-order properties
• Algebraic simplification in computer algebra: an analysis of bottom-up algorithms
• Analysis I. Integral presentations asymptotic methods
• Analytic models and ambiguity of context-free languages
• Asymptotic expansions for the coefficients of analytic generating functions
• Asymptotic Methods in Enumeration
• Automatic average-case analysis of algorithms
• Branching processes in the analysis of the heights of trees
• Central and local limit theorems applied to asymptotic enumeration
• Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
• Central and local limit theorems for the coefficients of polynomials of binomial type
• Complexity analysis of term-rewriting systems
• D-finite power series
• Differentiably finite power series
• Digital Search Trees Revisited
• Gaussian limiting distributions for the number of components in combinatorial structures
• Generalized Digital Trees and Their Difference—Differential Equations
• Holonomic functions and their relation to linearly constrained languages
• scientific article; zbMATH DE number 432810 (Why is no real title available?)
• scientific article; zbMATH DE number 3134390 (Why is no real title available?)
• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• scientific article; zbMATH DE number 3829247 (Why is no real title available?)
• scientific article; zbMATH DE number 3915644 (Why is no real title available?)
• scientific article; zbMATH DE number 3974323 (Why is no real title available?)
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 4041254 (Why is no real title available?)
• scientific article; zbMATH DE number 4080959 (Why is no real title available?)
• scientific article; zbMATH DE number 3655943 (Why is no real title available?)
• scientific article; zbMATH DE number 3755865 (Why is no real title available?)
• scientific article; zbMATH DE number 16479 (Why is no real title available?)
• scientific article; zbMATH DE number 45266 (Why is no real title available?)
• scientific article; zbMATH DE number 176505 (Why is no real title available?)
• scientific article; zbMATH DE number 176734 (Why is no real title available?)
• scientific article; zbMATH DE number 177816 (Why is no real title available?)
• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3565290 (Why is no real title available?)
• scientific article; zbMATH DE number 3593676 (Why is no real title available?)
• scientific article; zbMATH DE number 1142298 (Why is no real title available?)
• scientific article; zbMATH DE number 3003164 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• scientific article; zbMATH DE number 863490 (Why is no real title available?)
• scientific article; zbMATH DE number 863491 (Why is no real title available?)
• scientific article; zbMATH DE number 6157246 (Why is no real title available?)
• scientific article; zbMATH DE number 3216527 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3390782 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• Mellin transforms and asymptotics. The mergesort recurrence
• On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
• On some applications of formulae of Ramanujan in the analysis of algorithms
• On the Altitude of Nodes in Random Trees
• On The variance of the extremal path length in a symmetric digital trie
• Page usage in a quadtree index
• Partial match retrieval of multidimensional data
• Patricia tries again revisited
• Patterns and pattern-matching in trees: An analysis
• Probabilistic counting algorithms for data base applications
• Resurrecting the asymptotics of linear recurrences
• Singularity Analysis of Generating Functions
• Steepest descent method and limiting distributions in combinatorial analysis
• Symmetric functions and P-recursiveness
• The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
• The diagonal of a D-finite power series is D-finite
• The expected linearity of a simple equivalence algorithm
• The number of increasing subsequences of the random permutation
• Une théorie combinatoire des séries formelles

Cited in

(29)

• Quicksort algorithm: application of a fixed point theorem in intuitionistic fuzzy quasi-metric spaces at a domain of words
• Maximum likelihood analysis of algorithms and data structures
• Automatic average-case analysis of algorithms
• Dynamics of continued fractions with periodic constraints
• Dynamical analysis of a class of Euclidean algorithms.
• Algorithm analysis through proof complexity
• Analytic methods in asymptotic enumeration
• On the average complexity for the verification of compatible sequences
• Fixed fuzzy point results of generalized Suzuki type F-contraction mappings in ordered metric spaces
• An analysis of the WITT algorithm
• scientific article; zbMATH DE number 3854413 (Why is no real title available?)
• scientific article; zbMATH DE number 4035167 (Why is no real title available?)
• scientific article; zbMATH DE number 4041254 (Why is no real title available?)
• scientific article; zbMATH DE number 4052995 (Why is no real title available?)
• scientific article; zbMATH DE number 88944 (Why is no real title available?)
• scientific article; zbMATH DE number 711994 (Why is no real title available?)
• scientific article; zbMATH DE number 976346 (Why is no real title available?)
• scientific article; zbMATH DE number 1107810 (Why is no real title available?)
• An Introduction to the Analysis of Algorithms
• scientific article; zbMATH DE number 4115969 (Why is no real title available?)
• scientific article; zbMATH DE number 815575 (Why is no real title available?)
• scientific article; zbMATH DE number 873409 (Why is no real title available?)
• scientific article; zbMATH DE number 4187108 (Why is no real title available?)
• Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems
• A note on binomial recurrences arising in the analysis of algorithms
• Average case analysis of Gosper's algorithm for a class of urn model inputs
• The Banach fixed point theorem in fuzzy quasi-metric spaces with application to the domain of words
• Analysis of dynamic algorithms in Knuth's model
• Applications of the complexity space to the general probabilistic divide and conquer algorithms

This page was built for publication: Analytic analysis of algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204317)