Search ACM DL

Search Issue

enter search term and/or author name

**Provably correct theories of action**

Fangzhen Lin, Yoav Shoham

Pages: 293-320

DOI: 10.1145/201019.201021

**A randomized linear-time algorithm to find minimum spanning trees**

David R. Karger, Philip N. Klein, Robert E. Tarjan

Pages: 321-328

DOI: 10.1145/201019.201022

**Decomposition of magic rewriting**

Ke Wang, Weining Zhang, Siu-Cheung Chau

Pages: 329-381

DOI: 10.1145/201019.201027

**On the average communication complexity of asynchronous distributed algorithms**

John N. Tsitsiklis, George D. Stamoulis

Pages: 382-400

DOI: 10.1145/201019.201029

**The isomorphism conjecture fails relative to a random oracle**

Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer

Pages: 401-420

DOI: 10.1145/201019.201030

**NP trees and Carnap's modal logic**

Georg Gottlob

Pages: 421-457

DOI: 10.1145/201019.201031

**Three logics for branching bisimulation**

Rocco De Nicola, Frits Vaandrager

Pages: 458-487

DOI: 10.1145/201019.201032

**Las Vegas algorithms for linear and integer programming when the dimension is small**

Kenneth L. Clarkson

Pages: 488-499

DOI: 10.1145/201019.201036

^{2}n

**Nearly optimal algorithms and bounds for multilayer channel routing**

Bonnie Berger, Martin Brady, Donna Brown, Tom Leighton

Pages: 500-542

DOI: 10.1145/201019.201037