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

Full description

Bibliographic Details

Published in:	Discrete mathematics and theoretical computer science Vol. DMTCS Proceedings vol. AQ,...; no. Proceedings; pp. 377 - 380
Main Authors:	Gołębiewski, Zbigniew, Zagórski, Filip
Format:	Journal Article Conference Proceeding
Language:	English
Published:	DMTCS 01.01.2012 Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science
Series:	DMTCS Proceedings
Subjects:	[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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!