Search ACM DL

Search Issue

enter search term and/or author name

**Subproblem finder and instance checker, two cooperating modules for theorem provers**

Dennis de Champeaux

Pages: 633-657

DOI: 10.1145/6490.6491

**The combinatorics of local constraints in model-based recognition and localization from sparse data**

W. Eric L. Grimson

Pages: 658-686

DOI: 10.1145/6490.6492

**On driving many long wires in a VLSI layout**

Vijaya Ramachandran

Pages: 687-701

DOI: 10.1145/6490.6784

**Approximating grammar probabilities**: solution of a conjecture

R. Chaudhuri, A. N. V. Rao

Pages: 702-705

DOI: 10.1145/6490.214099

**Initializing generalized feedback shift register pseudorandom number generators**

Bruce Jay Collings, G. Barry Hembree

Pages: 706-711

DOI: 10.1145/6490.6493

**Complexity of parallel QR factorization**

M. Cosnard, Y. Robert

Pages: 712-723

DOI: 10.1145/6490.214102

**Countable nondeterminism and random assignment**

K. R. Apt, G. D. Plotkin

Pages: 724-767

DOI: 10.1145/6490.6494

**RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks**

A. E. Conway, N. D. Georganas

Pages: 768-791

DOI: 10.1145/6490.6495

**How to construct random functions**

Oded Goldreich, Shafi Goldwasser, Silvio Micali

Pages: 792-807

DOI: 10.1145/6490.6503

**Polynomial-time algorithm for the orbit problem**

R. Kannan, R. J. Lipton

Pages: 808-821

DOI: 10.1145/6490.6496

The accessibility problem for linear sequential machines [12] is the problem of deciding whether there is an input *x* such that on *x* the machine starting in a given state *q*_{1} goes to a given state...