Journals in DBLP
J. ACM 1986, volume: 33, number: 4
Dennis de Champeaux Subproblem finder and instance checker, two cooperating modules for theorem provers. [Citation Graph (0, 0)][DBLP ] J. ACM, 1986, v:33, n:4, pp:633-657 [Journal ] W. Eric L. Grimson The combinatorics of local constraints in model-based recognition and localization from sparse data. [Citation Graph (0, 0)][DBLP ] J. ACM, 1986, v:33, n:4, pp:658-686 [Journal ] Vijaya Ramachandran On driving many long wires in a VLSI layout. [Citation Graph (0, 0)][DBLP ] J. ACM, 1986, v:33, n:4, pp:687-701 [Journal ] R. Chaudhuri , A. N. V. Rao Approximating grammar probabilities: solution of a conjecture. [Citation Graph (0, 0)][DBLP ] J. ACM, 1986, v:33, n:4, pp:702-705 [Journal ] Bruce Jay Collings , G. Barry Hembree Initializing generalized feedback shift register pseudorandom number generators. [Citation Graph (0, 0)][DBLP ] J. ACM, 1986, v:33, n:4, pp:706-711 [Journal ] Michel Cosnard , Yves Robert Complexity of parallel QR factorization. [Citation Graph (0, 0)][DBLP ] J. ACM, 1986, v:33, n:4, pp:712-723 [Journal ] Krzysztof R. Apt , Gordon D. Plotkin Countable nondeterminism and random assignment. [Citation Graph (0, 0)][DBLP ] J. ACM, 1986, v:33, n:4, pp:724-767 [Journal ] Adrian E. Conway , Nicolas D. Georganas RECAL - a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks. [Citation Graph (0, 0)][DBLP ] J. ACM, 1986, v:33, n:4, pp:768-791 [Journal ] Oded Goldreich , Shafi Goldwasser , Silvio Micali How to construct random functions. [Citation Graph (0, 0)][DBLP ] J. ACM, 1986, v:33, n:4, pp:792-807 [Journal ] Ravindran Kannan , Richard J. Lipton Polynomial-time algorithm for the orbit problem. [Citation Graph (0, 0)][DBLP ] J. ACM, 1986, v:33, n:4, pp:808-821 [Journal ] John H. Rowland , John R. Cowles Small Sample Algorithms for the Identification of Polynomials. [Citation Graph (0, 0)][DBLP ] J. ACM, 1986, v:33, n:4, pp:822-829 [Journal ]