Ronald L. Rivest Network control by Bayesian broadcast. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:323-328 [Journal]
Micha Hofri, Zvi Rosberg Packet delay under the golden ratio weighted TDM policy in a multiple-access channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:341-349 [Journal]
Neil L. Gerr, Stamatis Cambanis Analysis of adaptive differential PCM of a stationary Gauss - Markov input. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:350-359 [Journal]
Wolfgang Härdle, Rainer Nixdorf Nonparametric sequential estimation of zeros and extrema of regression functions. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:367-372 [Journal]
Soura Dasgupta, Yih-Fang Huang Asymptotically convergent modified recursive least-squares with data-dependent updating and forgetting factor for systems with bounded noise. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:383-392 [Journal]
Jitendra K. Tugnait Identification of linear stochastic systems via second- and fourth-order cumulant matching. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:393-407 [Journal]
Wlodzimierz Greblicki, Miroslaw Pawlak Necessary and sufficient conditions for Bayes risk consistency of a recursive kernel classification rule. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:408-0 [Journal]
John S. Sadowsky On the robust discrimination of Poisson random counting measures. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:415-0 [Journal]
Attilio J. Rainal First and second passage times of Rayleigh processes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:419-0 [Journal]
Ian F. Blake, H. Darabian Approximations for the probability in the tails of the binomial distribution. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:426-0 [Journal]
Jean Louis Dornstetter On the equivalence between Berlekamp's and Euclid's algorithms. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:428-0 [Journal]
Jan L. P. de Lameillieure A heuristic algorithm for the construction of a code with limited word length. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:438-0 [Journal]
Katalin Marton Sequences achieving the boundary of the entropy region for a two-source are virtually memoryless. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:443-0 [Journal]
Kenneth J. Kerpez The rate-distortion function of a binary symmetric source when side information may be absent. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:448-0 [Journal]
Michael E. Monaco, James M. Lawler Corrections and additions to 'Error recovery for variable length codes' by J.C. Maxted and J.P. Robinson. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:454-0 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
