Analysis of an Asymmetric Leader Election Algorithm

No abstract is available for this paper.

• Publication year

  1997

• Venue

  Electronic Journal of Combinatorics

• Publication date

  1997-07-14

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.37236/1302
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Analytical Depoissonization and its Applications

  1998influential reference
• On the distribution for the duration of a randomized leader election algorithm

  1996cited by this paper
• Mellin Transforms and Asymptotics: Harmonic Sums

  1995cited by this paper
• Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees

  1995influential reference
• How to select a loser

  1993cited by this paper
• Searching for Losers

  1993cited by this paper
• The Average CRI-Length of a Tree Collision Resolution Algorithm in Presence of Multiplicity-Dependent Capture Effects

  1992cited by this paper
• A Study of Trie-Like Structures Under the Density Model

  1992cited by this paper
• Evolution of random search trees

  1991cited by this paper
• Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation

  1989cited by this paper
• A personal communication

  1989cited by this paper
• Algorithmics: Theory and Practice

  1988cited by this paper
• Normal Limiting Distribution of the Size of Tries

  1987cited by this paper
• Solution of a linear recurrence equation arising in the analysis of some algorithms

  1987influential reference
• Trie Partitioning Process: Limiting Distributions

  1986cited by this paper
• On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel

  1986cited by this paper
• Algebraic Methods for Trie Statistics

  1985cited by this paper
• The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform

  1984cited by this paper
• The art of computer programming

  1983cited by this paper
• Uniform distribution of sequences

  1974cited by this paper
• The Art of Computer Programming, Vol. 3: Sorting and Searching

  1974cited by this paper
• The art of computer programming: sorting and searching (volume 3)

  1973cited by this paper
• Sorting and Searching

  1973cited by this paper

• Random Sieves and Generalized Leader-election Procedures

  2023cites this paper
• Analysis of ${\textit{d}}$ -ary tree algorithms with successive interference cancellation

  2023cites this paper
• Electing a Leader

  2020cites this paper
• Resolving Conflicts and Electing Leaders

  2019cites this paper
• PR ] 5 N ov 2 01 7 Asymmetric Rényi Problem

  2018cites this paper
• Arbres pour l'algorithmique

  2018cites this paper
• Block size in Geometric($p$)-biased permutations

  2017cites this paper
• Asymmetric Rényi Problem

  2017cites this paper
• Profiles of PATRICIA Tries

  2016cites this paper
• Time-Optimal and Energy-Efficient Size Approximation of Radio Networks

  2016cites this paper
• Leader election using random walks

  2016cites this paper
• Asymmetric Rényi Problem and PATRICIA Tries

  2016cites this paper
• On Leader Green Election

  2016cites this paper
• Time-Optimal and Energy-Efficient Size Approximation of Radio Networks

  2016cites this paper
• The asymmetric leader election algorithm: Number of survivors near the end of the game

  2016cites this paper
• A leader-election procedure using records

  2015cites this paper
• From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader

  2015influential citation
• A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence

  2014influential citation
• On a leader election algorithm: Truncated geometric case study

  2014cites this paper
• A Survey and Taxonomy of Leader Election Algorithms in Distributed Systems

  2014cites this paper
• Expected External Profile of PATRICIA Tries

  2014cites this paper
• Bivariate Issues in Leader Election Algorithms with Marshall-Olkin Limit Distribution

  2014cites this paper
• Perpetuities in Fair Leader Election Algorithms

  2013cites this paper
• A Binomial Splitting Process in Connection with Corner Parking Problems

  2013cites this paper
• An analytic approach to the asymptotic variance of trie statistics and related structures

  2013cites this paper
• Electing a Leader

  2013cites this paper
• Survivors in Leader Election Algorithms

  2013cites this paper
• On Greedy Trie Execution

  2012cites this paper
• On a Recurrence Arising in Graph Compression

  2012cites this paper
• The Swedish Leader Election Protocol: Analysis and Variations

  2011cites this paper
• Stochastic Recurrences and their Applications to the Analysis of Partition-Valued Processes

  2011cites this paper
• Asymptotic Properties of a Leader Election Algorithm

  2011cites this paper
• Limit theorems for random recurrences and renewal-type processes

  2010cites this paper
• Compositions and samples of geometric random variables with constrained multiplicities

  2010cites this paper
• Repelling Sybil-Type Attacks in Wireless Ad Hoc Systems

  2010cites this paper
• The Bernoulli sieve: an overview

  2010cites this paper
• The Asymmetric Leader Election Algorithm: Another Approach

  2009influential citation
• Complexity analysis of tries and spanning tree problems

  2009cites this paper
• Towards Fair Leader Election in Wireless Networks

  2009cites this paper
• Isolating a Leaf in Rooted Trees via Random Cuttings

  2008cites this paper
• Leader Election Algorithm Using Heap Structure Sepehri

  2008cites this paper
• Profiles of Tries

  2008cites this paper
• Convergence of Some Leader Election Algorithms

  2008influential citation
• Profile of Tries

  2008cites this paper
• A probabilistic analysis of a leader election algorithm

  2007cites this paper
• Gaps in samples of geometric random variables

  2007cites this paper
• ANALYTICAL DEPOISSONIZATION AND ITS APPLICATIONS TOCOMBINATORICS AND ANALYSIS OF ALGORITHMS

  2007influential citation
• Quasi-optimal energy-efficient leader election algorithms in radio networks

  2007cites this paper
• Leader Election Algorithms in Radio Networks

  2007cites this paper
• Samples of geometric random variables with multiplicity constraints

  2006cites this paper
• A Quasi-Optimal Leader Election Algorithm in Radio Networks with Log-Logarithmic Awake Time Slots

  2006cites this paper
• Towards a complete characterization of tries

  2005cites this paper
• A Probabilistic Analysis of Some Tree Algorithms

  2005cites this paper
• Rounding of continuous random variables and oscillatory asymptotics

  2005cites this paper
• Gap-free compositions and gap-free samples of geometric random variables

  2005cites this paper
• A probabilistic analysis of some tree algorithms

  2004cites this paper
• Analysis of Randomized Selection Algorithm Motivated by the LZ'77 Scheme

  2004cites this paper
• Chain decomposition and the flag f-vector

  2003cites this paper
• Quasi-optimal leader election algorithms in radio networks with log-logarithmic awake time-slots

  2003cites this paper
• Sorting algorithms for broadcast communications: mathematical analysis

  2002cites this paper
• Average Case Analysis of Algorithms on Sequences

  2001cites this paper
• Asymptotic and numerical studies of the leader election algorithm

  2001influential citation
• Distinctness of compositions of an integer: A probabilistic analysis

  2001cites this paper
• EL-labelings, supersolvability and 0-Hecke algebra actions on posets

  2001cites this paper
• Average Profile of the Generalized Digital Search Tree and the Generalized Lempel-Ziv Algorithm

  1999cites this paper
• Analytical Depoissonization and its Applications

  1998cites this paper
• Stability Considerations for Networks Project Summary

  year unknowncites this paper