Creating order and ballot sequences

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Rudolf Ahlswede introduced the theory of creating order roughly at the same time as his theory of identification. He was always surprised that it did not achieve the same popularity as identification. We shall here present a multi-user model in which, contrasting to Ahlswede's original model, the size of the memory may vary in time. The influence of the maximum size of the memory device on the expected occurrence of the first 0 in the sequence produced by the organizer is studied. In the case that there is one outgoing bit in each time unit two steps of a simple random walk on the lattice can be combined to one step in a random walk for the exhaustion of the memory. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

Tamm, U. (2013). Creating order and ballot sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7777, pp. 711–724). Springer Verlag. https://doi.org/10.1007/978-3-642-36899-8_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free