Change language
English Deutsch
Change currency
€ EUR £ GBP $ USD
Licensed Unlicensed Requires Authentication Published by De Gruyter October 9, 2009

On waiting time in the scheme of random allocation of coloured particies

  • B. I. SELIVANOV
From the journal Discrete Mathematics and Applications
https://doi.org/10.1515/dma.1995.5.1.73
Published Online: 2009-10-09
Published in Print: 1995

Walter de Gruyter

From the journal
Discrete Mathematics and Applications
Discrete Mathematics and Applications
Volume 5 Issue 1

Journal and Issue

Articles in the same Issue

On complexity of realization of Boolean matrices with connected boundary
Undecidability of the completeness and A-completeness problems for some systems of automaton functions
On a probabilistic approach to solving systems of equations with integer-valued unknowns
On the waiting time in the scheme of allocation with reflection
Representations of linear recurring sequences of maximal period over finite fields
Multiprocessor scheduling and combinatorial configurations
On waiting time in the scheme of random allocation of coloured particies
On the complexity of gradient gate circuits
Downloaded on 10.5.2024 from https://www.degruyter.com/document/doi/10.1515/dma.1995.5.1.73/html
Scroll to top button