default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of the ACM, Volume 60
Volume 60, Number 1, February 2013
- Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick:
Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor. 1:1-1:16 - Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan
, Prasad Tetali:
Distributed Random Walks. 2:1-2:31 - Aram W. Harrow, Ashley Montanaro:
Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization. 3:1-3:43 - Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White:
Testing Closeness of Discrete Distributions. 4:1-4:25 - Victor Vianu:
Invited Article Foreword. 5:1 - Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità:
Steiner Tree Approximation via Iterative Randomized Rounding. 6:1-6:33
Volume 60, Number 2, April 2013
- Spyros Angelopoulos, Pascal Schweitzer:
Paging and list update under bijective analysis. 7:1-7:18 - Maria-Florina Balcan, Avrim Blum, Anupam Gupta:
Clustering under approximation stability. 8:1-8:34 - Leonid A. Levin:
Forbidden information. 9:1-9:9 - Vladimir Kolmogorov, Stanislav Zivný:
The complexity of conservative valued CSPs. 10:1-10:38 - Chryssis Georgiou, Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalski:
Asynchronous gossip. 11:1-11:42 - Avrim Blum, Katrina Ligett, Aaron Roth:
A learning theory approach to noninteractive database privacy. 12:1-12:25 - C. Seshadhri, Ali Pinar, Tamara G. Kolda:
An in-depth analysis of stochastic Kronecker graphs. 13:1-13:32 - Victor Vianu:
Invited article foreword. 14:1 - Tom J. Ameloot, Frank Neven, Jan Van den Bussche:
Relational transducers for declarative networking. 15:1-15:38
Volume 60, Number 3, June 2013
- Michael Drmota, Wojciech Szpankowski:
A Master Theorem for Discrete Divide and Conquer Recurrences. 16:1-16:49 - Navin Goyal, Neil Olver, F. Bruce Shepherd:
The VPN Conjecture Is True. 17:1-17:17 - Anindya Banerjee, David A. Naumann, Stan Rosenberg:
Local Reasoning for Global Invariants, Part I: Region Logic. 18:1-18:56 - Anindya Banerjee, David A. Naumann:
Local Reasoning for Global Invariants, Part II: Dynamic Boundaries. 19:1-19:73 - Naoki Kobayashi:
Model Checking Higher-Order Programs. 20:1-20:62 - Victor Vianu:
Invited Article Foreword. 21:1 - Jaroslav Sevcík, Viktor Vafeiadis, Francesco Zappa Nardelli, Suresh Jagannathan, Peter Sewell:
CompCertTSO: A Verified Compiler for Relaxed-Memory Concurrency. 22:1-22:50
Volume 60, Number 4, August 2013
- Guillem Godoy, Omer Giménez:
The HOM problem is decidable. 23:1-23:44 - Georg Gottlob, Gianluigi Greco:
Decomposing combinatorial auctions and set packing problems. 24:1-24:39 - Noga Alon, Raphael Yuster:
Matrix sparsification and nested dissection over arbitrary fields. 25:1-25:18 - Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick:
All-pairs shortest paths in O(n2) time with high probability. 26:1-26:25 - Victor Vianu:
Invited articles foreword. 27:1 - Marcelo Arenas, Jorge Pérez, Juan L. Reutter:
Data exchange beyond complete data. 28:1-28:59 - James Laird:
Game semantics for a polymorphic programming language. 29:1-29:27
Volume 60, Number 5, October 2013
- Victor Vianu:
Editorial: JACM redux. 30:1-30:2 - Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau:
Fast matrix rank algorithms and applications. 31:1-31:25 - Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan:
The expressibility of functions on the boolean domain, with applications to counting CSPs. 32:1-32:36 - Nitin Saxena, C. Seshadhri:
From sylvester-gallai configurations to rank bounds: Improved blackbox identity test for depth-3 circuits. 33:1-33:33 - Andrei A. Bulatov:
The complexity of the counting constraint satisfaction problem. 34:1-34:41 - Pierre Fraigniaud, Amos Korman, David Peleg:
Towards a complexity theory for local distributed computing. 35:1-35:26 - Zdenek Dvorák, Daniel Král, Robin Thomas:
Testing first-order properties for subclasses of sparse graphs. 36:1-36:24 - Phokion G. Kolaitis, Swastik Kopparty:
Random graphs and the parity quantifier. 37:1-37:34 - Victor Vianu:
Invited article foreword. 38:1 - Mika Göös, Juho Hirvonen, Jukka Suomela:
Lower bounds for local approximation. 39:1-39:23
Volume 60, Number 6, November 2013
- Ran Raz:
Tensor-Rank and Lower Bounds for Arithmetic Formulas. 40:1-40:15 - Frédéric Chazal, Leonidas J. Guibas, Steve Y. Oudot, Primoz Skraba:
Persistence-Based Clustering in Riemannian Manifolds. 41:1-41:38 - Dániel Marx:
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries. 42:1-42:51 - Vadim Lyubashevsky, Chris Peikert, Oded Regev:
On Ideal Lattices and Learning with Errors over Rings. 43:1-43:35 - Omar Fawzi, Patrick M. Hayden, Pranab Sen:
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking. 44:1-44:61 - Christopher J. Hillar, Lek-Heng Lim:
Most Tensor Problems Are NP-Hard. 45:1-45:39
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-07-07 21: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:
