Gated polling with stationary ergodic walking times, Markovian routing and random feedback

By Fiems Dieter  

Annals of Operations Research, Vol. 198, Iss. 1, 2012-09 ,pp. : 145-164

Springer Publishing Company

Access to resources Recommend Favorite

On ergodic algorithms in random multiple access systems with “success-failure“ feedback

By Turlikov A.   Foss S.  

Problems of Information Transmission, Vol. 46, Iss. 2, 2010-06 ,pp. : 184-200

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

An improved zero-one law for algorithmically random sequences

By Kautz S.M.  

Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. : 185-192

Elsevier

Access to resources Recommend Favorite

Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees

By Fuchs Michael   Hwang Hsien-Kuei   Neininger Ralph  

Algorithmica, Vol. 46, Iss. 3-4, 2006-11 ,pp. : 367-407

Springer Publishing Company

Access to resources Recommend Favorite

A new class of pseudo-random sequences from Mersenne numbers

By Mitra Abhijit  

International Journal of Information and Coding Theory, Vol. 1, Iss. 1, 2009-03 ,pp. : 119-127

Inderscience Publishers

Access to resources Recommend Favorite