External Links

Journal: Journal of the ACM

Volume 54, Issue 6

27 -- 0Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson. On counting homomorphisms to directed acyclic graphs
28 -- 0Mikkel Thorup. Equivalence between priority queues and sorting
29 -- 0Ling Cheung, Mariëlle Stoelinga, Frits W. Vaandrager. A testing scenario for probabilistic processes
30 -- 0Faith Ellen, Panagiota Fatourou, Eric Ruppert. Time lower bounds for implementations of multi-writer snapshots
31 -- 0Sibsankar Haldar, K. Vidyasankar. On specification of Read/Write shared variables
32 -- 0Nick G. Duffield, Carsten Lund, Mikkel Thorup. Priority sampling for estimation of arbitrary subset sums

Volume 54, Issue 5

22 -- 0Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani. AdWords and generalized online matching
23 -- 0Rafail Ostrovsky, Yuval Rabani. Low distortion embeddings for edit distance
24 -- 0Thomas Eiter, Kazuhisa Makino. On computing all abductive explanations from a propositional Horn theory
25 -- 0Andrew Gilpin, Tuomas Sandholm. Lossless abstraction of imperfect information games
26 -- 0Eijiro Sumii, Benjamin C. Pierce. A bisimulation for type abstraction and recursion

Volume 54, Issue 4

16 -- 0Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta. (Almost) Tight bounds and existence theorems for single-commodity confluent flows
17 -- 0Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright. A new look at survey propagation and its generalizations
18 -- 0Éric Colin de Verdière, Francis Lazarus. Optimal pants decompositions and shortest homotopic cycles on an orientable surface
19 -- 0Stijn Vansummeren. On deciding well-definedness for query languages on trees
20 -- 0Tero Harju, Dirk Nowotka. Periodicity and unbordered words: A proof of the extended duval conjecture
21 -- 0Mark Rudelson, Roman Vershynin. Sampling from large matrices: An approach through geometric functional analysis

Volume 54, Issue 3

11 -- 0Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden. Approximation via cost sharing: Simpler and better approximation algorithms for network design
12 -- 0Irit Dinur. The PCP theorem by gap amplification
13 -- 0Arne Andersson, Mikkel Thorup. Dynamic ordered sets with exponential search trees
14 -- 0Vincent Conitzer, Tuomas Sandholm, Jérôme Lang. When are elections with few candidates hard to manipulate?

Volume 54, Issue 2

5 -- 0Sara Cohen, Werner Nutt, Yehoshua Sagiv. Deciding equivalences among conjunctive aggregate queries
6 -- 0Jos C. M. Baeten, Flavio Corradini, Clemens Grabmayer. A characterization of regular expressions under bisimulation
7 -- 0Jan A. Bergstra, J. V. Tucker. The rational numbers as an abstract data type
8 -- 0Vincent Danos, Elham Kashefi, Prakash Panangaden. The measurement calculus
9 -- 0Dimitris Achlioptas, Frank McSherry. Fast computation of low-rank matrix approximations
10 -- 0Dimitris Achlioptas, Assaf Naor, Yuval Peres. On the maximum satisfiability of random formulas

Volume 54, Issue 1

0 -- 0Martin Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side
0 -- 0Jean-Pierre Jouannaud, Albert Rubio. Polymorphic higher-order recursive path orderings
0 -- 0Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs. Speed scaling to manage energy and temperature
0 -- 0Sean Hallgren. Polynomial-time quantum algorithms for Pell s equation and the principal ideal problem
runs on