Communications of the ACM
Latest Research
From Communications of the ACM
Technical Perspective: Hiding Secrets in Programs
"Indistinguishability Obfuscation from Well-Founded Assumptions," by Aayush Jain et al., gives a new construction of indistinguishability obfuscation that is provably...
From Communications of the ACM
Indistinguishability Obfuscation from Well-Founded Assumptions
We examine a formalization of the "one-way compiler" concept with the notion of indistinguishability obfuscation.
From Communications of the ACM
Technical Perspective: How Easy Is It to Describe Hard Polynomials?
"Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits," by Nutan Limaye et al., achieves a landmark in the larger quest of understanding hardness,...
From Communications of the ACM
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
In this paper, we prove the first superpolynomial lower bounds against algebraic circuits of all constant depths over all fields of characteristic 0.
From Communications of the ACM
Technical Perspective: Bridging AI with Real-Time Systems
"Taming Algorithmic Priority Inversion in Mission-Critical Perception Pipelines," by Shengzhong Liu et al., proposes a new methodology for overcoming the limitations...
From Communications of the ACM
Taming Algorithmic Priority Inversion in Mission-Critical Perception Pipelines
This paper discusses algorithmic priority inversion in mission-critical machine inference pipelines used in modern neural-network-based perception subsystems and...
From Communications of the ACM
Technical Perspective: Maximum Flow through a Network: A Storied Problem and a Groundbreaking Solution
"Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow," by Li Chen et al., comes within striking distance of answering the question: "Does maximum...
From Communications of the ACM