Инд. авторы:	Medvedeva Yu.S., Ryabko B.Ya.
Заглавие:	Fast enumeration algorithm for words with given constraints on run lengths of ones
Библ. ссылка:	Medvedeva Yu.S., Ryabko B.Ya. Fast enumeration algorithm for words with given constraints on run lengths of ones // Problems of Information Transmission. - 2010. - Vol.46. - Iss. 4. - P.390-399. - ISSN 0032-9460. - EISSN 1608-3253.
Внешние системы:	DOI: 10.1134/S0032946010040095; РИНЦ: 16980229; WoS: 000286328800009;
Реферат:	eng: We propose an algorithm for enumeration and denumeration of words with given constraints on run lengths of ones (dklr-sequences). For large n, operation time of the algorithm (per symbol of a sequence) is at most O(log(3) n log log n), where n is the length of enumerated words, whereas for the best known methods it is at least cn, c > 0.
Издано:	2010
Физ. характеристика:	с.390-399