Journal of the ACM （JOLACM） - Issue 295 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 295 |
| 发布时间： |
| 卷期年份： 2016 |
| 卷期官网： |
本期论文列表
2-Server PIR with Subpolynomial Communication.
Optimal Rate Code Constructions for Computationally Simple Channels.
The Complexity of Finite-Valued CSPs.
Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices.
Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding.
Query Complexity of Approximate Nash Equilibria.
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms.
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity.
Approximate Constraint Satisfaction Requires Large LP Relaxations.
Invited Paper Foreword.
Are Lock-Free Concurrent Algorithms Practically Wait-Free?