Search ACM DL

Search Issue

enter search term and/or author name

**Tuple sequences and lexicographic indexes**

Serge Abiteboul, Seymour Ginsburg

Pages: 409-422

DOI: 10.1145/5925.5926

**Elimination of intersection anomalies from database schemes**

Catriel Beeri, Michael Kifer

Pages: 423-450

DOI: 10.1145/5925.5927

**Security problems on inference control for SUM, MAX, and MIN queries**

Francis Chin

Pages: 451-464

DOI: 10.1145/5925.5928

The basic inference problem is defined as follows: For a finite set *X* = {*x*_{i},
, *x _{n}*}, we wish to infer properties of elements of

**Sort sets in the relational model**

Seymour Ginsburg, Richard Hull

Pages: 465-488

DOI: 10.1145/5925.5929

**A note on the height of binary search trees**

Luc Devroye

Pages: 489-498

DOI: 10.1145/5925.5930

**Reaching approximate agreement in the presence of faults**

Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, William E. Weihl

Pages: 499-516

DOI: 10.1145/5925.5931

**Predicting fill for sparse orthogonal factorization**

Thomas F. Coleman, Anders Edenbrandt, John R. Gilbert

Pages: 517-532

DOI: 10.1145/5925.5932

**A unified approach to approximation algorithms for bottleneck problems**

Dorit S. Hochbaum, David B. Shmoys

Pages: 533-550

DOI: 10.1145/5925.5933

**Improved methods for storing and updating information in the out-of-kilter algorithm**

Samar Singh

Pages: 551-567

DOI: 10.1145/5925.5934

**Asymptotic expansions for closed Markovian networks with state-dependent service rates**

Debasis Mitra, J. McKenna

Pages: 568-592

DOI: 10.1145/5925.5935

**The performance of a precedence-based queuing discipline**

John N. Tsitsiklis, Christos H. Papadimitriou, Pierre Humblet

Pages: 593-602

DOI: 10.1145/5925.5936

**The polynomial-time hierarchy and sparse oracles**

Jose L. Balcázar, Ronald V. Book, Uwe Schöning

Pages: 603-617

DOI: 10.1145/5925.5937

**Relativizing complexity classes with sparse oracles**

Timothy J. Long, Alan L. Selman

Pages: 618-627

DOI: 10.1145/5925.5938