"Heads-Up Limit Hold'em Poker Is Solved," by Michael Bowling, et al., takes the counterfactual regret minimization method for approximating a Nash equilibrium to...David Silver From Communications of the ACM | November 2017
This paper is an extended version of our original 2015 Science article, with additional results showing Cepheus' in-game performance against computer and human...Michael Bowling, Neil Burch, Michael Johanson, Oskari Tammelin From Communications of the ACM | November 2017
"A Large-Scale Study of Programming Languages and Code Quality in GitHub," by Baishakhi Ray, et al., studies whether programming language choice and code quality...Jeffrey S. Foster From Communications of the ACM | October 2017
What is the effect of programming languages on software quality? In this study, we gather a very large data set from GitHub in an attempt to shed some empirical...Baishakhi Ray, Daryl Posnett, Premkumar Devanbu, Vladimir Filkov From Communications of the ACM | October 2017
"Multi-Objective Parametric Query Optimization," by Immanuel Trummer and Christoph Koch is a remarkable tour de force exploration of the combination of both parametric...Jeffrey F. Naughton From Communications of the ACM | October 2017
We propose a generalization of the classical database query optimization problem: multi-objective parametric query (MPQ) optimization.
Immanuel Trummer, Christoph Koch From Communications of the ACM | October 2017
"Scribe," by Walter S. Lasecki, et al., is one of the first in a recent set of crowdsourcing papers that demonstrated how human workers can collaborate with computing...Ed H. Chi From Communications of the ACM | September 2017
We discuss how our Scribe system combines human labor and machine intelligence in real time to reliably convert speech to text with less than 4s latency.
Walter S. Lasecki, Christopher D. Miller, Iftekhar Naim, Raja Kushalnagar, Adam Sadilek, Daniel Gildea, Jeffrey P. Bigham From Communications of the ACM | September 2017
"Exploiting the Analog Properties of Digital Circuits for Malicious Hardware," by Kaiyuan Yang, et al., assumes semiconductor foundries (and others in chip fabrication)...Charles (Chuck) Thacker From Communications of the ACM | September 2017
We show how a fabrication-time attacker can leverage analog circuits to create a hardware attack that is small and stealthy.
Kaiyuan Yang, Matthew Hicks, Qing Dong, Todd Austin, Dennis Sylvester From Communications of the ACM | September 2017
To avoid costly feedback loops between design, engineering, and fabrication, research in computer graphics has recently tried to incorporate key aspects of function...Helmut Pottmann From Communications of the ACM | August 2017
In this article, we describe an algorithm to generate designs for spinning objects by optimizing their mass distribution.
Moritz Bächer, Bernd Bickel, Emily Whiting, Olga Sorkine-Hornung From Communications of the ACM | August 2017
This paper introduces an interface-driven approach to building scalable software.
Austin T. Clements, M. Frans Kaashoek, Eddie Kohler, Robert T. Morris, Nickolai Zeldovich From Communications of the ACM | August 2017
"IronFleet: Proving Safety and Liveness of Practical Distributed Systems," by Chris Hawblitzel, et al., describes mechanically checked proofs for two non-trivial...Fred B. Schneider From Communications of the ACM | July 2017
We demonstrate the methodology on a complex implementation of a Paxos-based replicated state machine library and a lease-based sharded key-value store. With our...Chris Hawblitzel, Jon Howell, Manos Kapritsos, Jacob R. Lorch, Bryan Parno, Michael L. Roberts, Srinath Setty, Brian Zill From Communications of the ACM | July 2017
In "Fast and Powerful Hashing Using Tabulation," Mikkel Thorup describes a variation of simple but surprisingly effective and powerful hash functions based on using...Michael Mitzenmacher From Communications of the ACM | July 2017
The past few years have seen a revolution in our understanding of arithmetic circuits. "Unexpected Power of Low-Depth Arithmetic Circuits" by Gupta et al. on the...Avi Wigderson From Communications of the ACM | June 2017
Several earlier results have shown that it is possible to rearrange basic computational elements in surprising ways to give more efficient algorithms. The main...Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi From Communications of the ACM | June 2017