Search ACM DL

Search Issue

enter search term and/or author name

**Many hard examples for resolution**

Vašek Chvátal, Endre Szemerédi

Pages: 759-768

DOI: 10.1145/48014.48016

**A new class of heuristic algorithms for weighted perfect matching**

M. D. Grigoriadis, B. Kalantari

Pages: 769-776

DOI: 10.1145/48014.48015

**Optimal VLSI circuits for sorting**

Richard Cole, Alan Siegel

Pages: 777-809

DOI: 10.1145/48014.48017

**A linear time algorithm for optimal routing around a rectangle**

Teofilo F. Gonzalez, Sing-Ling Lee

Pages: 810-831

DOI: 10.1145/48014.48018

**Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service**

Shivendra S. Panwar, Don Towsley, Jack K. Wolf

Pages: 832-844

DOI: 10.1145/48014.48019

**Computing on an anonymous ring**

Hagit Attiya, Marc Snir, Manfred K. Warmuth

Pages: 845-875

DOI: 10.1145/48014.48247

**Parallel hashing**: an efficient implementation of shared memory

Anna R. Karlin, Eli Upfal

Pages: 876-892

DOI: 10.1145/48014.350550

**Eliminating go to's while preserving program structure**

Lyle Ramshaw

Pages: 893-920

DOI: 10.1145/48014.48021

**A new approach to the maximum-flow problem**

Andrew V. Goldberg, Robert E. Tarjan

Pages: 921-940

DOI: 10.1145/48014.61051

**Finite monoids and the fine structure of NC 1**

David A. Mix Barrington, Denis Thérien

Pages: 941-952

DOI: 10.1145/48014.63138

**Meager and replete failures of relative completeness**

Daniel Leivant, Tim Fernando

Pages: 953-964

DOI: 10.1145/48014.63139

**Computational limitations on learning from examples**

Leonard Pitt, Leslie G. Valiant

Pages: 965-984

DOI: 10.1145/48014.63140

**Counting is easy**

Joel I. Seiferas, Paul M. B. Vitányi

Pages: 985-1000

DOI: 10.1145/48014.63141