S.M. Haas, J.H. Shapiro, Proceedings IEEE International Symposium on Information Theory,, 2002, 167
S.I. Bross, M.V. Burnashev, S. Shamai, “Error exponents for the two-user Poisson multiple-access channel”, IEEE Trans. Inform. Theory, 47:5 (2001), 1999
Joseph M. Kahn, Keang-Po Ho, “A bottleneck for optical fibres”, Nature, 411:6841 (2001), 1007
R. Sundaresan, S. Verdu, “Robust decoding for timing channels”, IEEE Trans. Inform. Theory, 46:2 (2000), 405
R. Sundaresan, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 2000, 50
M.V. Burnashev, “On identification capacity of infinite alphabets or continuous-time channels”, IEEE Trans. Inform. Theory, 46:7 (2000), 2407
М. В. Бурнашев, Ю. А. Кутоянц, “О границе сферической упаковки, пропускной способности и о подобных результатах для пуассоновского канала”, Пробл. передачи информ., 35:2 (1999), 3–22 ; M. V. Burnashev, Yu. A. Kutoyants, “On the Sphere-Packing Bound, Capacity, and Similar Results for Poisson Channels”, Problems Inform. Transmission, 35:2 (1999), 95–111
A. Lapidoth, S. Shamai, “The Poisson multiple-access channel”, IEEE Trans. Inform. Theory, 44:2 (1998), 488
Don H. Johnson, Computational Neuroscience, 1997, 93
Lucien F Lemmens, “The Ehrenfest model: a path-integral for spin”, Physics Letters A, 222:6 (1996), 419