acm-header
Sign In

Communications of the ACM

Latest Research



From Communications of the ACM

Technical Perspective: The Rewards of Selfish Mining

"Majority Is Not Enough: Bitcoin Mining Is Vulnerable," by Eyal and Sirer, questions the 2009 Bitcoin white paper's implicit assumption of perfect information—that...

Majority Is Not Enough
From Communications of the ACM

Majority Is Not Enough: Bitcoin Mining Is Vulnerable

We propose a practical modification to the Bitcoin protocol that protects Bitcoin in the general case.

From Communications of the ACM

Technical Perspective: Measuring Optimization Potential with Coz

In "Coz: Finding Code that Counts with Causal Profiling," Curtsinger and Berger describe causal profiling, which tell programmers exactly how much speed-up bang...

Coz
From Communications of the ACM

Coz: Finding Code that Counts with Causal Profiling

This paper introduces causal profiling. Unlike past profiling approaches, causal profiling indicates exactly where programmers should focus their optimization efforts...

From Communications of the ACM

Technical Perspective: Breaking the Mold of Machine Learning

"Never-Ending Learning" is the latest and one of the most compelling incarnations of Tom Mitchell and his collaborators' research investigating how to broaden the...

Never-Ending Learning
From Communications of the ACM

Never-Ending Learning

In this paper we define more precisely the never-ending learning paradigm for machine learning, and present one case study: the Never-Ending Language Learner (NELL)...

From Communications of the ACM

Technical Perspective: Expressive Probabilistic Models and Scalable Method of Moments

The authors of "Learning Topic Models—Provably and Efficiently," developed a new method for fitting topic models and at large scale.

Learning Topic Models - Provably and Efficiently
From Communications of the ACM

Learning Topic Models - Provably and Efficiently

This article shows that some new theoretical algorithms that have provable guarantees can be adapted to yield highly practical tools for topic modeling.

From Communications of the ACM

Technical Perspective: On Heartbleed: A Hard Beginnyng Makth a Good Endyng

When a serious security vulnerability is discovered in the SSL/TLS protocol, one would naturally expect a rapid response. "Analysis of SSL Certificate Reissues...

Analysis of SSL Certificate Reissues and Revocations in the Wake of Heartbleed
From Communications of the ACM

Analysis of SSL Certificate Reissues and Revocations in the Wake of Heartbleed

We use Heartbleed, a widespread OpenSSL vulnerability from 2014, as a natural experiment to determine whether administrators are properly managing their X.509 certificates...

From Communications of the ACM

Technical Perspective: A Graph-Theoretic Framework Traces Task Planning

In "Time-Inconsistent Planning: A Computational Problem in Behavioral Economics," Kleinberg and Oren describe a graph-theoretic framework for task planning with...

Time-Inconsistent Planning
From Communications of the ACM

Time-Inconsistent Planning: A Computational Problem in Behavioral Economics

We propose a graph-theoretic model of tasks and goals, in which dependencies among actions are represented by a directed graph, and a time-inconsistent agent constructs...

From Communications of the ACM

Technical Perspective: Designing Algorithms and the Fairness Criteria They Should Satisfy

"Which Is the Fairest (Rent Division) of Them All?" focuses on the problem of rent division, and stands out in the variety of techniques applied to arrive at a...

Which Is the Fairest (Rent Division) of Them All?
From Communications of the ACM

Which Is the Fairest (Rent Division) of Them All?

What is a fair way to assign rooms to several housemates, and divide the rent between them? We develop a general algorithmic framework that enables the computation...

From Communications of the ACM

Technical Perspective: Building Bug-Free Compilers

What to do about buggy compilers? The authors of "Practical Verification of Peephole Optimizations with Alive" give us a compelling and practical answer.

Practical Verification of Peephole Optimizations with Alive
From Communications of the ACM

Practical Verification of Peephole Optimizations with Alive

We created Alive, a domain-specific language for writing correct peephole optimizations and for automatically either proving them correct or else generating counterexamples...

From Communications of the ACM

Technical Perspective: Can High Performance Be Portable?

"Halide: Decoupling Algorithms from Schedules for High-Performance Image Processing" by Ragan-Kelley et al. on the image processing language Halide explores a substantially...

Halide
From Communications of the ACM

Halide: Decoupling Algorithms from Schedules For High-Performance Image Processing

We propose a new programming language for image processing pipelines, called Halide, that separates the algorithm from its schedule.

From Communications of the ACM

Technical Perspective: Moving Spectrum

The incentive auction scenario provides the backdrop for the breathtaking research contribution presented by Newman et al. in "Deep Optimization for Spectrum Repacking...

Deep Optimization For Spectrum Repacking
From Communications of the ACM

Deep Optimization For Spectrum Repacking

This paper describes the process by which we built the SAT-based Feasibility Checker, a crucial element of the 2016-17 U.S. FCC "incentive auction" design.
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account