On Greedy Trie Execution - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2012

On Greedy Trie Execution

Résumé

In the paper "How to select a looser'' Prodinger was analyzing an algorithm where $n$ participants are selecting a leader by flipping fair coins, where recursively, the 0-party (those who i.e. have tossed heads) continues until the leader is chosen. We give an answer to the question stated in the Prodinger's paper – what happens if not a 0-party is recursively looking for a leader but always a party with a smaller cardinality. We show the lower bound on the number of rounds of the greedy algorithm (for fair coin).
Fichier principal
Vignette du fichier
dmAQ0129.pdf (184.37 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01197231 , version 1 (11-09-2015)

Identifiants

Citer

Zbigniew Gołębiewski, Filip Zagórski. On Greedy Trie Execution. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), 2012, Montreal, Canada. pp.377-380, ⟨10.46298/dmtcs.3007⟩. ⟨hal-01197231⟩

Collections

TDS-MACS
55 Consultations
548 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More