Mark Daniel Ward, Wojciech Szpankowski  Home/Search
Context Related
| purdue.edu/homes/spa/papers...soda03.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: purdue.edu/homes/spa/reports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider a randomized selection algorithm that has n initial participants and a moderator. In each round of the process, each participant and the moderator throw a biased coin. Only the participants who throw the same result as the moderator stay in the game for subsequent rounds. With probability 1, all participants are eliminated in nitely many rounds. We let Mn denote the number of participants remaining in the game in the last nontrivial round. This simple algorithm has... (Update)
Similar documents based on text: More All
0.6: Analysis of a Randomized Selection Algorithm Motivated by.. - Ward, Szpankowski (2004) (Correct)
0.3: On the Average Redundancy Rate of the Lempel-Ziv Code with.. - Reznik, Szpankowski (2001) (Correct)
0.2: A Cost-Benefit Scheme for High Performance Predictive.. - Vellanki, Chervenak (1999) (Correct)
BibTeX entry: (Update)
Ward, M. D., Szpankowski, W., Analysis of a randomized selection algorithm motivated by the LZ'77 scheme. To appear in 1st Workshop on Analytic Algorithms and Combinatorics (ANALCO), 2004. http://citeseer.ist.psu.edu/ward04analysis.html More
@misc{ ward04analysis,
author = "M. Ward and W. Szpankowski",
title = "Analysis of a randomized selection algorithm motivated by the LZ'77 scheme",
text = "Ward, M. D., Szpankowski, W., Analysis of a randomized selection algorithm
motivated by the LZ'77 scheme. To appear in 1st Workshop on Analytic Algorithms
and Combinatorics (ANALCO), 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/ward04analysis.html" }
Citations (may not include all citations):1749 An Introduction to Probability Theory and Its Applications (context) - Feller
458 A universal algorithm for sequential data compression - Ziv, Lempel - 1977
108 An Introduction to the Analysis of Algorithms (context) - Sedgewick, Flajolet - 1996
89 Mellin transforms and asymptotics: Harmonic sums - Flajolet, Gourdon et al. - 1995
67 Average Case Analysis of Algorithms on Sequences (context) - Szpankowski - 2001
58 and Oren Patashnik (context) - Graham, Knuth - 1994
38 Fundamental Algorithms (context) - Knuth - 1997
20 the distribution for the duration of a randomized leader ele.. - Fill, Mahmoud et al. - 1996
19 How to select a loser (context) - Prodinger - 1993
9 New York: McGraw-Hill (context) - Ahlfors, Analysis et al. - 1979
7 Analysis of an asymmetric leader election algorithm - Janson, Szpankowski - 1997
7 New York: Wiley (context) - Henrici, Computational et al.
6 Mathematics for the Analysis of Algorithms (context) - Greene, Knuth - 1990
2 Theoretical Computer Science (context) - Jacquet, Szpankowski et al. - 1998
2 Joint source-channel LZ'77 coding (context) - Lonardi, Szpankowski - 2003
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.purdue.edu/homes/spa/reports.html): More
Analytic Variations on Redundancy Rates of Renewal Processes - Flajolet, Szpankowski (1998) (Correct)
Average Profile Of The Lempel-Ziv Parsing Scheme For A.. - Jacquet, Szpankowski.. (1998) (Correct)
Limit Laws for Heights in Generalized Tries and PATRICIA Tries - Knessl, Szpankowski (1999) (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