Technical Perspective: Can Data Structures Treat Us Fairly?
In "Sampling Near Neighbors in Search for Fairness," Aumüller et al. investigate a basic problem in similarity search called near neighbor in the context of fair data structures.
Theory
Advertisement
Advances in the Quantum Internet
A deep dive into the quantum Internet's potential to transform and disrupt.
Algorithmic fairness aims to remedy issues stemming from algorithmic bias.
ACM Fellow and A.M. Turing Award recipient Dana Scott reflects on his career.
Transforming Science through Cyberinfrastructure
NSF's vision for the U.S. cyberinfrastructure ecosystem for science and engineering in the 21st century.
Some small companies are making crowdwork part of their formal business via teams that can complete multifaceted, complex tasks requiring specialized expertise.
The Future of Information Work
Considering the recent effects of remote work on network structure.
Toward Verified Artificial Intelligence
Making AI more trustworthy with a formal methods-based approach to AI system verification and validation.
Language Models: Past, Present, and Future
A language modeling overview, highlighting basic concepts, intuitive explanations, technical achievements, and fundamental challenges.
When Satisfiability Solving Meets Symbolic Computation
The science of less-than-brute force.
How detachment from your community blocks your success at leading innovations, and what to do about it.
Our House Is On Fire: The Climate Emergency and Computing's Responsibility
Efficiencies delivered by computing technology could play a vital role in enabling continued functionality within a resource-constrained future.
Lamboozling Attackers: A New Generation of Deception
Software engineering teams can exploit attackers' human nature by building deception environments.
The Software Industry Is Still the Problem
The time is (also) way overdue for IT professional liability.
The growing popularity of computational workflows is also a cause for concern. How can we enjoy the common benefits of the workflows and eliminate the risks?
Perspectives on the role and responsibility of the data-management research community in designing, developing, using, and overseeing automated decision systems.
Technical Perspective: The Compression Power of the BWT
"Resolution of the Burrows-Wheeler Transform Conjecture," by Dominik Kempa and Tomasz Kociumaka, finally settles the question of how well r in the BWT captures repetitiveness.
Resolution of the Burrows-Wheeler Transform Conjecture
In this paper, we show that r = (z log2 n) holds for every text. This result has numerous implications for text indexing and data compression.
Learning New Things and Avoiding Obstacles
ACM A.M. Turing Award recipient Jack Dongarra never intended to work with computers.
This paper presents a study on the practicality of operating system kernel debloating, that is, reducing kernel code that is not needed by the target applications.
Cybersecurity as Illuminator for the Future of Computing Research
Considering the shifting fundamentals of cybersecurity research.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More