scientific article; zbMATH DE number 5764927

zbMATH Open1210.68140MaRDI QIDQ3579520FDOQ3579520

Authors: Tämur Ali Khan 

Publication date: 9 August 2010

Full work available at URL: http://publikationen.ub.uni-frankfurt.de/volltexte/2007/3893/pdf/alikhan_dissertation.pdf

Title of this publication is not available (Why is that?)

Recommendations

• Concentration of Measure for the Analysis of Randomized Algorithms
• Concentration of measure for the analysis of randomized algorithms.
• scientific article; zbMATH DE number 1857639
• Large deviations for a class of recursive algorithms
• On a multivariate contraction method for random recursive structures with applications to quicksort
• A general limit theorem for recursive algorithms and combinatorial structures
• scientific article; zbMATH DE number 1392847
• Stochastically recursive sequences and their generalizations

zbMATH Keywords

Galton-Watson processesstochastic analysis of algorithmsSnir's randomized algorithm

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Cited In (3)

• On tail bounds for random recursive trees
• Title not available (Why is that?)
• Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms.

This page was built for publication:

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