Open Problems in Communication and Computation
暂无分享,去创建一个
[1] Péter Gács,et al. A Simple Three-Dimensional Real-Time Reliable Cellular Array , 1988, J. Comput. Syst. Sci..
[2] Leonid A. Levin,et al. Average Case Complete Problems , 1986, SIAM J. Comput..
[3] Greg N. Frederickson,et al. A Single Source Shortest Path Algorithm for a Planar Distributed Network , 1985, STACS.
[4] Robert E. Tarjan,et al. Sequential access in splay trees takes linear time , 1985, Comb..
[5] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.
[6] R. Gallager,et al. Communication complexity of distributed shortest path algorithms , 1985 .
[7] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[8] J. Tsitsiklis,et al. A simple criterion for structurally fixed modes , 1984 .
[9] Don Coppersmith,et al. Fast evaluation of logarithms in fields of characteristic two , 1984, IEEE Trans. Inf. Theory.
[10] K. Reinschke. Graph-theoretic characterization of fixed modes in centralized and decentralized control , 1984 .
[11] Péter Gács,et al. Reliable computation with cellular automata , 1983, J. Comput. Syst. Sci..
[12] Dimitri P. Bertsekas,et al. Distributed asynchronous computation of fixed points , 1983, Math. Program..
[13] G. Chaitin. Gödel's theorem and information , 1982 .
[14] D. Knuth. A Permanent Inequality , 1981 .
[15] S. Winograd,et al. On the asymptotic complexity of matrix multiplication , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[16] H. Strasser. Consistency of Maximum Likelihood and Bayes Estimates , 1981 .
[17] K. Arrow,et al. On Partitioning a Sample with Binary-Type Questions in Lieu of Collecting Observations , 1981 .
[18] J. Kahane. Sur Les Polynomes a Coefficients Unimodulaires , 1980 .
[19] Shepp La. Computerized tomography and nuclear magnetic resonance. , 1980 .
[20] Robert K. Brayton,et al. Stability of dynamical systems: A constructive approach , 1979 .
[21] J. Kruskal,et al. COMPUTERIZED TOMOGRAPHY: THE NEW MEDICAL X-RAY TECHNOLOGY , 1978 .
[22] J. Pearson,et al. Structural controllability of multiinput linear systems , 1976 .
[23] R. Anderson,et al. The minimum distance for MLSE digital data systems of limited complexity , 1975, IEEE Trans. Inf. Theory.
[24] Staffan A. Fredricsson,et al. Optimum transmitting filter in digital PAM systems with a Viterbi detector , 1974, IEEE Trans. Inf. Theory.
[25] Ching-tai Lin. Structural controllability , 1974 .
[26] D. Freedman. On the Asymptotic Behavior of Bayes' Estimates in the Discrete Case , 1963 .
[27] M. Hestenes,et al. Methods of conjugate gradients for solving linear systems , 1952 .
[28] C. Lanczos. Solution of Systems of Linear Equations by Minimized Iterations1 , 1952 .
[29] Douglas H. Wiedemann. Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.
[30] J. Doob. Classical potential theory and its probabilistic counterpart , 1984 .
[31] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[32] Michael L. Fredman,et al. The Complexity of Maintaining an Array and Computing Its Partial Sums , 1982, JACM.
[33] Toby Berger,et al. The Poisson Multiple-Access Conflict Resolution Problem , 1981 .
[34] L. Silverman,et al. Constructive Stability and Asymptotic Stability of Dynamical Systems , 1980 .
[35] Marcus Hutter,et al. Algorithmic Information Theory , 1977, IBM J. Res. Dev..