The Asymmetric Leader Election Algorithm with swedish stopping: A probabilistic analysis

Simple item page
dc.contributor.authorLouchard G
dc.contributor.authorProdinger H
dc.date.accessioned2013-07-03T08:19:49Z
dc.date.available2013-07-03T08:19:49Z
dc.date.issued2012
dc.descriptionNatuurwetenskappe
dc.descriptionWiskunde
dc.descriptionPlease help us populate SUNScholar with the post print version of this article. It can be e-mailed to: scholar@sun.ac.za
dc.identifier.citationDiscrete Mathematics and Theoretical Computer Science
dc.identifier.urihttp://hdl.handle.net/10019.1/82718
dc.publisherDISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE, 62 RUE DU CARDINAL MATHIEU,NANCY, FRANCE, F-54000
dc.titleThe Asymmetric Leader Election Algorithm with swedish stopping: A probabilistic analysis
dc.typeJournal Articles (subsidised)
Files
Collections
2012 - Research Outputs