Search ACM DL

Search Issue

enter search term and/or author name

**Generalized best-first search strategies and the optimality of A***

Rina Dechter, Judea Pearl

Pages: 505-536

DOI: 10.1145/3828.3830

**Enumeration of structured flowcharts**

Edward A. Bender, Jon T. Butler

Pages: 537-548

DOI: 10.1145/3828.3832

**Optimal attack and reinforcement of a network**

William H. Cunningham

Pages: 549-561

DOI: 10.1145/3828.3829

**A simple on-line bin-packing algorithm**

C. C. Lee, D. T. Lee

Pages: 562-572

DOI: 10.1145/3828.3833

**A model of computation for VLSI with related complexity results**

Bernard Chazelle, Louis Monier

Pages: 573-588

DOI: 10.1145/3828.3834

**A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels**

Albert G. Greenberg, Schmuel Winograd

Pages: 589-596

DOI: 10.1145/3828.214125

**Adding range restriction capability to dynamic data structures**

Dan E. Willard, George S. Lueker

Pages: 597-617

DOI: 10.1145/3828.3839

**A mean value performance model for locking in databases**: the no-waiting case

Y. C. Tay, Rajan Suri, Nathan Goodman

Pages: 618-651

DOI: 10.1145/3828.3831

**Self-adjusting binary search trees**

Daniel Dominic Sleator, Robert Endre Tarjan

Pages: 652-686

DOI: 10.1145/3828.3835

**Uniform hashing is optimal**

Andrew C. Yao

Pages: 687-693

DOI: 10.1145/3828.3836

**Generating binary trees using rotations**

David Zerling

Pages: 694-701

DOI: 10.1145/3828.214141

**Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains**

Wei-Lu Cao, William J. Stewart

Pages: 702-719

DOI: 10.1145/3828.214137

**The complexity of problems on probabilistic, nondeterministic, and alternating decision trees**

Udi Manber, Martin Tompa

Pages: 720-732

DOI: 10.1145/3828.3838

**The complexity of propositional linear temporal logics**

A. P. Sistla, E. M. Clarke

Pages: 733-749

DOI: 10.1145/3828.3837