Wolf Zimmermann  Home/Search
Context
Related
| inria.fr/INRIA/Projects...zimmermann.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fermivista.math.ju...ftp.inria.fr (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Probabilistic recurrence relations occur frequently in the analysis of randomized algorithms. After an introduction to the work of Karp on probabilistic recurrence relations of the form T (n) = a(n) + T (h(n)) (1) where h(n) is a random variable, we discuss probabilistic recurrence relations for divide-andconquer algorithms. In (sequential and parallel) divide-and-conquer algorithms a problem of size n is usually divided in subproblems of size h 1 (n), : : : , h k (n) where the h i (n) are... (Update)
Active bibliography (related documents): More All
0.0: Improved Master Theorems for Divide-and-Conquer Recurrences - Roura (2000) (Correct)
0.0: An Improved Master Theorem for Divide-and-Conquer Recurrences - Roura (1998) (Correct)
0.0: Adding Multiple Cost Constraints to Combinatorial.. - Karger, Plotkin (1995) (Correct)
Similar documents based on text: More All
0.1: Global Bifurcations and Chaotic Dynamics in Physical Applications - Zimmermann (1997) (Correct)
0.1: Efficient Algorithms on Numbers, Polynomials, and Series - Zimmermann (2000) (Correct)
0.1: Uniform Random Generation of Decomposable Structures Using.. - Denise, Zimmermann (1997) (Correct)
BibTeX entry: (Update)
@misc{ zimmermann-probabilistic,
author = "Wolf Zimmermann",
title = "Probabilistic Recurrence Relations for Divide-and-Conquer Algorithms",
url = "citeseer.ist.psu.edu/zimmermann92probabilistic.html" }
Citations (may not include all citations):40 Probabilistic recurrence relations (context) - Richard, -- - 1991
1 Probabilistic Recurrence Relations for Parallel Divide-andCo.. - Zimmermann, -- - 1991
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.inria.fr.html): More
Model-Checking of CTL on Infinite Kripke Structures.. - Quemener, Jéron (1995) (Correct)
An Experiment in Automatic Generation of Test.. - Fernandez, Jard.. (1996) (Correct)
Spill Code Minimization via Interference Region Spilling - Bergner, Dahl.. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC