Analytic analysis of algorithms
From MaRDI portal
Publication:5204317
DOI10.1007/3-540-55719-9_74zbMath1425.68473OpenAlexW2120782763MaRDI QIDQ5204317
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
Related Items (9)
Analytic methods in asymptotic enumeration ⋮ The Banach fixed point theorem in fuzzy quasi-metric spaces with application to the domain of words ⋮ Fixed fuzzy point results of generalized Suzuki type F-contraction mappings in ordered metric spaces ⋮ Dynamical analysis of a class of Euclidean algorithms. ⋮ Applications of the complexity space to the general probabilistic divide and conquer algorithms ⋮ A note on binomial recurrences arising in the analysis of algorithms ⋮ Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems ⋮ Quicksort algorithm: application of a fixed point theorem in intuitionistic fuzzy quasi-metric spaces at a domain of words ⋮ Dynamics of continued fractions with periodic constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gaussian limiting distributions for the number of components in combinatorial structures
- Asymptotic expansions for the coefficients of analytic generating functions
- The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
- D-finite power series
- Algebraic simplification in computer algebra: an analysis of bottom-up algorithms
- Symmetric functions and P-recursiveness
- Resurrecting the asymptotics of linear recurrences
- Probabilistic counting algorithms for data base applications
- Analytic models and ambiguity of context-free languages
- A diffusion limit for a class of randomly-growing binary trees
- Branching processes in the analysis of the heights of trees
- A logical approach to asymptotic combinatorics I. First order properties
- The diagonal of a D-finite power series is D-finite
- Differentiably finite power series
- The number of increasing subsequences of the random permutation
- Une théorie combinatoire des séries formelles
- A holonomic systems approach to special functions identities
- Automatic average-case analysis of algorithms
- Steepest descent method and limiting distributions in combinatorial analysis
- Page usage in a quadtree index
- The expected linearity of a simple equivalence algorithm
- Central and local limit theorems for the coefficients of polynomials of binomial type
- On The variance of the extremal path length in a symmetric digital trie
- Complexity analysis of term-rewriting systems
- Mellin transforms and asymptotics. The mergesort recurrence
- Analysis I. Integral presentations asymptotic methods
- Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
- Central and local limit theorems applied to asymptotic enumeration
- A logical approach to asymptotic combinatorics. II: Monadic second-order properties
- On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
- Patricia tries again revisited
- Singularity Analysis of Generating Functions
- Patterns and pattern-matching in trees: An analysis
- Digital Search Trees Revisited
- A complexity calculus for recursive tree algorithms
- On some applications of formulae of Ramanujan in the analysis of algorithms
- Generalized Digital Trees and Their Difference—Differential Equations
- Asymptotic Methods in Enumeration
- On the Altitude of Nodes in Random Trees
- Partial match retrieval of multidimensional data
- Holonomic functions and their relation to linearly constrained languages
This page was built for publication: Analytic analysis of algorithms
