Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Asymptotic and numerical studies of the leader election algorithm

From MaRDI portal
Publication:4551011
Jump to:navigation, search

DOI10.1017/S0956792501004508zbMath1005.60023OpenAlexW2044210244MaRDI QIDQ4551011

Charles Knessl

Publication date: 19 February 2003

Published in: European Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956792501004508



Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial probability (60C05) Limit theorems in probability theory (60F99)


Related Items (3)

The asymmetric leader election algorithm: another approach ⋮ Asymptotics of Barrier Option Pricing Under the CEV Process ⋮ The asymmetric leader election algorithm: Number of survivors near the end of the game







This page was built for publication: Asymptotic and numerical studies of the leader election algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4551011&oldid=18674203"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 10:43.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki