E-resources
-
Chaudhuri, Shiva; Dubhashi, Devdatt
Theoretical computer science, 07/1997, Volume: 181, Issue: 1Journal Article
The performance attributes of a broad class of randomised algorithms can be described by a recurrence relation of the form T( x) = a( x) + T( H( x)), where a is a function and H( x) is a random variable. For instance, T( x) may describe the running time of such an algorithm on a problem of size x. Then T( x) is a random variable, whose distribution depends on the distribution of H( x). To give high probability guarantees on the performance of such randomised algorithms, it suffices to obtain bounds on the tail of the distribution of T( x). Karp derived tight bounds on this tail distribution, when the distribution of H( x) satisfies certain restrictions. In this paper, we give a simple proof of bounds similar to that of Karp using standard tools from elementary probability theory, such as Markov's inequality, stochastic dominance and a variant of Chernoff bounds applicable to unbounded geometrically distributed variables. Further, we extend the results, showing that similar bounds hold under weaker restrictions on H( x). As an application, we derive performance bounds for an interesting class of algorithms that was outside the scope of the previous results.
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.