DOAJ Open Access 2012

On Greedy Trie Execution

Zbigniew Gołębiewski Filip Zagórski

Lihat Sumber DOI

Abstrak

In the paper "How to select a looser'' Prodinger was analyzing an algorithm where $n$ participants are selecting a leader by flipping <underline>fair</underline> 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 <underline>fair</underline> coin).

Topik & Kata Kunci

Mathematics

Penulis (2)

Zbigniew Gołębiewski

Filip Zagórski

Format Sitasi

APA MLA BibTeX

Gołębiewski, Z., Zagórski, F. (2012). On Greedy Trie Execution. https://doi.org/10.46298/dmtcs.3007

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.3007

Informasi Jurnal

Tahun Terbit: 2012
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.3007
Akses: Open Access ✓