Search ACM DL

Search Issue

enter search term and/or author name

**Lower bounds for orthogonal range searching: part II. The arithmetic model**

Bernard Chazelle

Pages: 439-463

DOI: 10.1145/79147.79149

**A fast algorithm for optimal length-limited Huffman codes**

Lawrence L. Larmore, Daniel S. Hirschberg

Pages: 464-473

DOI: 10.1145/79147.79150

**On the equivalence of an Egd to a set of Fd's**

Marc H. Graham, Ke Wang

Pages: 474-490

DOI: 10.1145/79147.79151

**Analysis of database performance with dynamic locking**

In Kyung Ryu, Alexander Thomasian

Pages: 491-523

DOI: 10.1145/79147.79152

**Renaming in an asynchronous environment**

Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk

Pages: 524-548

DOI: 10.1145/79147.79158

**Knowledge and common knowledge in a distributed environment**

Joseph Y. Halpern, Yoram Moses

Pages: 549-587

DOI: 10.1145/79147.79161

**Parallel asynchronous algorithms for discrete data**

Aydin Üresin, Michel Dubois

Pages: 588-606

DOI: 10.1145/79147.79162

**Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length**

Ariel Orda, Raphael Rom

Pages: 607-625

DOI: 10.1145/79147.214078

**An efficient and fast parallel-connected component algorithm**

Yujie Han, Robert A. Wagner

Pages: 626-642

DOI: 10.1145/79147.214077

**Approximate mean value analysis algorithms for queuing networks**: existence, uniqueness, and convergence results

K. R. Pattipati, M. M. Kostreva, J. L. Teele

Pages: 643-673

DOI: 10.1145/79147.214074

**Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space**

Yuri Gurevich

Pages: 674-687

DOI: 10.1145/79147.214070