Mathematics for the analysis of algorithms.
From MaRDI portal
Recommendations
Cited in
(20)- Limiting distributions for a class of diminishing urn models
- On the structure and solutions of functional equations arising from queueing models
- A combinatorial approach to asymptotic behavior of Kirillov model for $GL_2$
- An analytic approach for the analysis of rotations in fringe-balanced binary search trees
- Assigning probabilities to hypotheses in the context of a binomial distribution
- Mathematics for the Analysis of Algorithms.
- scientific article; zbMATH DE number 873409 (Why is no real title available?)
- Varieties of general type with doubly exponential asymptotics
- New fixed-parameter algorithms for the minimum quartet inconsistency problem
- On the efficiency of optimal grid synthesis in optimal control problems with fixed terminal time
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- A real elementary approach to the master recurrence and generalizations
- Spanning tree size in random binary search trees.
- On the variance of the Fibonacci partition function
- Klt varieties of general type with small volume
- Polynomial approach to cyclicity for weighted \(\ell^p_A\)
- The analysis of heuristics for search trees
- Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
- scientific article; zbMATH DE number 107970 (Why is no real title available?)
- scientific article; zbMATH DE number 711994 (Why is no real title available?)
This page was built for publication: Mathematics for the analysis of algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q927152)
