| Refinements of Pinsker's inequality AA Fedotov, P Harremoës, F Topsoe IEEE Transactions on Information Theory 49 (6), 1491-1498, 2003 | 204 | 2003 |
| Refinements of Pinsker's inequality AA Fedotov, P Harremoës, F Topsoe IEEE Transactions on Information Theory 49 (6), 1491-1498, 2003 | 204 | 2003 |
| Best Pinsker bound equals Taylor polynomial of degree 49 AA Fedotov, P Harremoës, F Topsoe Вычислительные технологии 8 (5), 3-13, 2003 | 9 | 2003 |
| The estimated cost of a search tree on binary words A Fedotov, B Ryabko IEEE Transactions on Information Theory 47 (1), 326-329, 2001 | 4 | 2001 |
| Vajda's tight lower bound and refinements of Pinsker's inequality AA Fedotov, P Harremoes, F Topsoe Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE …, 2001 | 2 | 2001 |
| The estimate for the cost of a search tree constructed on an arbitrary set of binary words A Fedotov, B Ryabko 2000 IEEE International Symposium on Information Theory (Cat. No. 00CH37060), 13, 2000 | 1 | 2000 |
| Efficient log filter AA Fedotov Вычислительные технологии 12 (6), 5-11, 2007 | | 2007 |
| Efficient log filter AA Fedotov Вычислительные технологии 12 (6), 5-11, 2007 | | 2007 |
| Наилучшая оценка Пинскера-это полином Тейлора 49-й степени AA Fedotov, P Harremoës, F Topsøe Вычислительные технологии 8 (5), 3-13, 2003 | | 2003 |
| An estimate for the mean efficiency of search trees constructed for arbitrary sets of binary words BY Ryabko, AA Fedotov Diskretnaya Matematika 14 (1), 142-150, 2002 | | 2002 |
