default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of the ACM, Volume 59
Volume 59, Number 1, February 2012
- Christel Baier, Marcus Größer, Nathalie Bertrand
:
Probabilistic ω-automata. 1:1-1:52 - James Aspnes, Hagit Attiya, Keren Censor-Hillel:
Polylogarithmic concurrent data structures from monotone circuits. 2:1-2:24 - Armando Castañeda, Sergio Rajsbaum:
New combinatorial topology bounds for renaming: The upper bound. 3:1-3:49 - Victor Vianu:
Invited article foreword. 4:1 - Martin Otto:
Highly acyclic groups, hypergraph covers, and the guarded fragment. 5:1-5:40
Volume 59, Number 2, April 2012
- Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang:
On the (im)possibility of obfuscating programs. 6:1-6:48 - Vijay V. Vazirani:
The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game. 7:1-7:36 - Oded Goldreich, Brendan Juba, Madhu Sudan:
A theory of goal-oriented communication. 8:1-8:65 - Victor Vianu:
Invited article foreword. 9:1 - Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang:
Continuous sampling from distributed streams. 10:1-10:25
Volume 59, Number 3, June 2012
- Jens Groth, Rafail Ostrovsky, Amit Sahai:
New Techniques for Noninteractive Zero-Knowledge. 11:1-11:35 - Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin:
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. 12:1-12:22 - Hagen Völzer, Daniele Varacca:
Defining Fairness in Reactive and Concurrent Systems. 13:1-13:37 - Mihai Patrascu, Mikkel Thorup:
The Power of Simple Tabulation Hashing. 14:1-14:50 - Victor Vianu:
Invited Article Foreword. 15:1 - Georg Gottlob, Stephanie Tien Lee, Gregory Valiant, Paul Valiant:
Size and Treewidth Bounds for Conjunctive Queries. 16:1-16:35
Volume 59, Number 4, August 2012
- Yijia Chen, Jörg Flum:
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem. 17:1-17:34 - Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty:
SINR Diagrams: Convexity and Its Applications in Wireless Networks. 18:1-18:34 - Nikhil Bansal, Niv Buchbinder, Joseph Naor:
A Primal-Dual Randomized Algorithm for Weighted Paging. 19:1-19:24 - Victor Vianu:
Invited Article Foreword. 20:1 - Ke Yi:
Dynamic Indexability and the Optimality of B-Trees. 21:1-21:19
Volume 59, Number 5, October 2012
- Ashwinkumar 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. 22:1-22:35 - Kenneth L. Clarkson, Elad Hazan, David P. Woodruff:
Sublinear optimization for machine learning. 23:1-23:49 - Andris Ambainis, Julia Kempe, Or Sattath:
A quantum lovász local lemma. 24:1-24:24 - Leslie Ann Goldberg, Mark Jerrum:
Approximating the partition function of the ferromagnetic potts model. 25:1-25:31 - Victor Vianu:
Invited article foreword. 26:1 - Martin Grohe:
Fixed-point definability and polynomial time on graphs with excluded minors. 27:1-27:64
Volume 59, Number 6, December 2012
- Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
The effectiveness of lloyd-type methods for the k-means problem. 28:1-28:22 - Prahladh Harsha, Adam R. Klivans, Raghu Meka:
An invariance principle for polytopes. 29:1-29:25 - Nilesh N. Dalvi, Dan Suciu:
The dichotomy of probabilistic inference for unions of conjunctive queries. 30:1-30:87 - Patrick Cousot, Radhia Cousot, Laurent Mauborgne:
Theories, solvers and static analysis by abstract interpretation. 31:1-31:56 - Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Graph expansion and communication costs of fast matrix multiplication. 32:1-32:23
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-22 02:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
