Journal: Journal of the ACM

Volume 47, Issue 6

969 -- 986Susanne Albers, Naveen Garg, Stefano Leonardi. Minimizing stall time in single and parallel disk systems
987 -- 1011Martin Farach-Colton, Paolo Ferragina, S. Muthukrishnan. On the sorting-complexity of suffix tree construction
1012 -- 1027Bernard Chazelle. The soft heap: an approximate priority queue with optimal error rate
1028 -- 1047Bernard Chazelle. A minimum spanning tree algorithm with Inverse-Ackermann type complexity
1048 -- 1096Leslie Ann Goldberg, Philip D. MacKenzie, Mike Paterson, Aravind Srinivasan. Contention resolution with constant expected delay

Volume 47, Issue 5

823 -- 825Joseph Y. Halpern. Editorial: a bill of rights and responsibilities
826 -- 853David A. Cohen, Peter Jeavons, Peter Jonsson, Manolis Koubarakis. Building tractable disjunctive constraints
854 -- 882Leslie G. Valiant. A neuroidal architecture for cognitive computation
883 -- 904Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng. Sliver exudation
905 -- 911Tao Jiang, Ming Li, Paul M. B. Vitányi. A lower bound on the average-case complexity of shellsort
912 -- 943Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle. Tight bounds for ::::k::::-set agreement
944 -- 967Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff, Rolf Wanka. Periodification scheme: constructing sorting networks with constant period

Volume 47, Issue 4

585 -- 616Guy Even, Joseph Naor, Satish Rao, Baruch Schieber. Divide-and-conquer approximation algorithms via spreading metrics
617 -- 643Bala Kalyanasundaram, Kirk Pruhs. Speed is as powerful as clairvoyance
644 -- 680Michael Benedikt, Leonid Libkin. Relational queries over interpreted structures
681 -- 720Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender. Complexity of finite-horizon Markov decision process problems
721 -- 751J. P. Rawling, S. A. Selesnick. Orthologic and quantum logic: models and computational elements
752 -- 775Eitan Altman, Bruno Gaujal, Arie Hordijk. Balanced sequences and optimal routing
776 -- 822Sergio Antoy, Rachid Echahed, Michael Hanus. A needed narrowing strategy

Volume 47, Issue 3

417 -- 451John F. Canny, Ioannis Z. Emiris. A subdivision-based algorithm for the sparse resultant
452 -- 482Ronen I. Brafman, Moshe Tennenholtz. An axiomatic treatment of three qualitative decision criteria
483 -- 505Juhani Karhumäki, Filippo Mignosi, Wojciech Plandowski. The expressibility of languages and relations by word equations
506 -- 530Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio. Learning functions represented as multiplicity automata
531 -- 584Benjamin C. Pierce, Davide Sangiorgi. Behavioral equivalence in the polymorphic pi-calculus

Volume 47, Issue 2

225 -- 243Matthew K. Franklin, Zvi Galil, Moti Yung. Eavesdropping games: a graph-theoretic approach to privacy in distributed systems
244 -- 293George Varghese, Mahesh Jayaram. The fault span of crash failures
294 -- 311Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou. An ::::O::::(log(::::n::::):::4/3:::) space algorithm for (::::s, t::::) connectivity in undirected graphs
312 -- 360Orna Kupferman, Moshe Y. Vardi, Pierre Wolper. An automata-theoretic approach to branching-time model checking
361 -- 416Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari. Making abstract interpretations complete

Volume 47, Issue 1

1 -- 15Yair Bartal, Eddie Grove. The harmonic ::::k::::-server algorithm is competitive
16 -- 45Patrick W. Dymond, Walter L. Ruzzo. Parallel RAMs with owned global memory and deterministic context-free language recognition
46 -- 76David R. Karger. Minimum cuts in near-linear time
77 -- 131Thomas Eiter, Yuri Gurevich, Georg Gottlob. Existential second-order logic over strings
132 -- 166Edith Cohen. Polylog-time and near-linear work approximation scheme for undirected shortest paths
167 -- 223Peter W. O Hearn, John C. Reynolds. From Algol to polymorphic linear lambda-calculus