Search ACM DL

Search Issue

enter search term and/or author name

**Incremental modular decomposition**

John H. Muller, Jeremy Spinrad

Pages: 1-19

DOI: 10.1145/58562.59300

**A unified framework for race analysis of asynchronous networks**

J. A. Brzozowski, C.-J. Seger

Pages: 20-45

DOI: 10.1145/58562.59301

**Maintaining state constraints in relational databases: a proof theoretic basis**

William W. McCune, Lawrence J. Henschen

Pages: 46-68

DOI: 10.1145/58562.59302

**Minimizing function-free recursive inference rules**

Jeffrey F. Naughton

Pages: 69-91

DOI: 10.1145/58562.59303

**A counter-example for “a simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars”**

Jens M. Dill

Pages: 92-96

DOI: 10.1145/58562.77393

**A common schema for dynamic programming and branch and bound algorithms**

Paul Helman

Pages: 97-128

DOI: 10.1145/58562.59304

**Inferring sequences produced by pseudo-random number generators**

Joan Boyar

Pages: 129-141

DOI: 10.1145/58562.59305

**A note on probabilistically verifying integer and polynomial products**

Michael Kaminski

Pages: 142-149

DOI: 10.1145/58562.214082

**Multiplicative complexity of polynomial multiplication over finite fields**

Michael Kaminski, Nader H. Bshouty

Pages: 150-170

DOI: 10.1145/58562.59306

**Calculating availability and performability measures of repairable computer systems using randomization**

Edmundo de Souza e Silva, H. Richard Gail

Pages: 171-193

DOI: 10.1145/58562.59307

**Calculating joint queue-length distributions in product-form queuing networks**

Edmundo de Souza e Silva, S. S. Lavenberg

Pages: 194-207

DOI: 10.1145/58562.58563