External Links

Journal: Journal of the ACM

Volume 59, Issue 6

28 -- 0Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy. The effectiveness of lloyd-type methods for the k-means problem
29 -- 0Prahladh Harsha, Adam Klivans, Raghu Meka. An invariance principle for polytopes
30 -- 0Nilesh N. Dalvi, Dan Suciu. The dichotomy of probabilistic inference for unions of conjunctive queries
31 -- 0Patrick Cousot, Radhia Cousot, Laurent Mauborgne. Theories, solvers and static analysis by abstract interpretation
32 -- 0Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz. Graph expansion and communication costs of fast matrix multiplication

Volume 59, Issue 5

22 -- 0Ashwinkumar Badanidiyuru, Arpita Patra, Ashish Choudhury, Kannan Srinathan, C. Pandu Rangan. On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission
23 -- 0Kenneth L. Clarkson, Elad Hazan, David P. Woodruff. Sublinear optimization for machine learning
24 -- 0Andris Ambainis, Julia Kempe, Or Sattath. A quantum lovász local lemma
25 -- 0Leslie Ann Goldberg, Mark Jerrum. Approximating the partition function of the ferromagnetic potts model
26 -- 0Victor Vianu. Invited article foreword
27 -- 0Martin Grohe. Fixed-point definability and polynomial time on graphs with excluded minors

Volume 59, Issue 4

17 -- 0Yijia Chen, Jörg Flum. From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem
18 -- 0Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty. SINR Diagrams: Convexity and Its Applications in Wireless Networks
19 -- 0Nikhil Bansal, Niv Buchbinder, Joseph Naor. A Primal-Dual Randomized Algorithm for Weighted Paging
20 -- 0Victor Vianu. Invited Article Foreword
21 -- 0Ke Yi. Dynamic Indexability and the Optimality of B-Trees

Volume 59, Issue 3

11 -- 0Jens Groth, Rafail Ostrovsky, Amit Sahai. New Techniques for Noninteractive Zero-Knowledge
12 -- 0Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin. An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets
13 -- 0Hagen Völzer, Daniele Varacca. Defining Fairness in Reactive and Concurrent Systems
14 -- 0Mihai Patrascu, Mikkel Thorup. The Power of Simple Tabulation Hashing
15 -- 0Victor Vianu. Invited Article Foreword
16 -- 0Georg Gottlob, Stephanie Tien Lee, Gregory Valiant, Paul Valiant. Size and Treewidth Bounds for Conjunctive Queries

Volume 59, Issue 2

6 -- 0Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang. On the (im)possibility of obfuscating programs
7 -- 0Vijay V. Vazirani. The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
8 -- 0Oded Goldreich, Brendan Juba, Madhu Sudan. A theory of goal-oriented communication
9 -- 0Victor Vianu. Invited article foreword
10 -- 0Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang. Continuous sampling from distributed streams

Volume 59, Issue 1

1 -- 0Christel Baier, Marcus Größer, Nathalie Bertrand. Probabilistic ω-automata
2 -- 0James Aspnes, Hagit Attiya, Keren Censor Hillel. Polylogarithmic concurrent data structures from monotone circuits
3 -- 0Armando Castañeda, Sergio Rajsbaum. New combinatorial topology bounds for renaming: The upper bound
4 -- 0Victor Vianu. Invited article foreword
5 -- 0Martin Otto. Highly acyclic groups, hypergraph covers, and the guarded fragment
runs on