"Indistinguishability Obfuscation from Well-Founded Assumptions," by Aayush Jain et al., gives a new construction of indistinguishability obfuscation that is provably...Daniel Wichs From Communications of the ACM | March 2024
"Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits," by Nutan Limaye et al., achieves a landmark in the larger quest of understanding hardness,...Nitin Saxena From Communications of the ACM | February 2024
In this paper, we prove the first superpolynomial lower bounds against algebraic circuits of all constant depths over all fields of characteristic 0.
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas From Communications of the ACM | February 2024
"Taming Algorithmic Priority Inversion in Mission-Critical Perception Pipelines," by Shengzhong Liu et al., proposes a new methodology for overcoming the limitations...Giorgio Buttazzo From Communications of the ACM | February 2024
This paper discusses algorithmic priority inversion in mission-critical machine inference pipelines used in modern neural-network-based perception subsystems and...Shengzhong Liu, Shuochao Yao, Xinzhe Fu, Rohan Tabish, Simon Yu, Ayoosh Bansal, Heechul Yun, Lui Sha, Tarek Abdelzaher From Communications of the ACM | February 2024
"Nonverbal Communication through Expressive Objects," by Stephanie Valencia et al., describes the design of a physical object to support communication and focuses...Annalu Waller From Communications of the ACM | January 2024
In this work, we work closely with an Augmentative and Alternative Communication (AAC) user to understand how motion through a physical expressive object can support...Stephanie Valencia, Mark Steidl, Michael L. Rivera, Cynthia L. Bennett, Jeffrey P. Bigham, Henny Admoni From Communications of the ACM | January 2024
"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...Shang-Hua Teng From Communications of the ACM | December 2023
We present an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs...Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva From Communications of the ACM | December 2023
"Boosting Fuzzer Efficiency: An Information Theoretic Perspective," by Marcel Böhme, Valentin J.M. Manès, and Sang Kil Cha, presents a novel twist to fuzzing that...Gordon Fraser From Communications of the ACM | November 2023
"Locating Everyday Objects Using NFC Textiles," by Jingxian Wang et al., describes the potential of Near-Field Communication for advanced home automation.
Polly Huang From Communications of the ACM | October 2023
This paper builds a Near-Field Communication-based localization system that allows ordinary surfaces to locate surrounding objects with high accuracy in the near...Jingxian Wang, Junbo Zhang, Ke Li, Chengfeng Pan, Carmel Majidi, Swarun Kumar From Communications of the ACM | October 2023
"Leveraging Social Media to Buy Fake Reviews," by Sherry He et al., represents a breakthrough in our empirical understanding of fake reviews on Amazon.
Shreyas Sekar From Communications of the ACM | October 2023
"Model Counting Meets Distinct Elements," by A. Pavan et al., gives a surprising connection between model counting and streaming, providing a generic transformation...David P. Woodruff From Communications of the ACM | September 2023
In this work, we seek to investigate whether bridging the seeming communication gap between two different domains of computer science may pave the way to richer...A. Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel From Communications of the ACM | September 2023
In "A Manifold View of Connectivity in the Private Backbone Networks of Hyperscalers," Salamatian et al. assemble techniques from the two broad strategies developed...Sara Alouf From Communications of the ACM | August 2023
We present a new empirical approach for elucidating connectivity in privately owned and operated backbone networks.
Loqman Salamatian, Scott Anderson, Joshua Mathews, Paul Barford, Walter Willinger, Mark Crovella From Communications of the ACM | August 2023