On Greedy Trie Execution

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 s...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete mathematics and theoretical computer science Ročník DMTCS Proceedings vol. AQ,...; číslo Proceedings; s. 377 - 380
Hlavní autori:	Gołębiewski, Zbigniew, Zagórski, Filip
Médium:	Journal Article Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	DMTCS 01.01.2012 Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science
Edícia:	DMTCS Proceedings
Predmet:	[info.info-cg] computer science [cs]/computational geometry [cs.cg] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds] [math.math-co] mathematics [math]/combinatorics [math.co] Combinatorics Computational Geometry Computer Science Data Structures and Algorithms Discrete Mathematics leader election Mathematics trie Trie leader election
ISSN:	1365-8050, 1462-7264, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!