Mathematics for the analysis of algorithms.
From MaRDI portal
Publication:927152
zbMath1151.68750MaRDI QIDQ927152
Donald E. Knuth, Daniel H. Greene
Publication date: 4 June 2008
Published in: Modern Birkhäuser Classics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
On the structure and solutions of functional equations arising from queueing models, Spanning tree size in random binary search trees., Assigning probabilities to hypotheses in the context of a binomial distribution, Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, On the efficiency of optimal grid synthesis in optimal control problems with fixed terminal time, Klt varieties of general type with small volume, On the variance of the Fibonacci partition function, A combinatorial approach to asymptotic behavior of Kirillov model for $GL_2$, New fixed-parameter algorithms for the minimum quartet inconsistency problem, Polynomial approach to cyclicity for weighted \(\ell^p_A\), A Real Elementary Approach to the Master Recurrence and Generalizations, An analytic approach for the analysis of rotations in fringe-balanced binary search trees, The analysis of heuristics for search trees, Varieties of general type with doubly exponential asymptotics, Limiting Distributions for a Class Of Diminishing Urn Models
