Systems and Networking
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 flow have a scalable algorithm?”
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow
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, and capacities in m1+o(1) time.
What Does Digitization Mean, and When Did It Begin?
All Photos are Fake Until Proven Real
Quantum Speedup for the Fast Fourier Transform?
The Infrapolitics of Algorithmic Resistance
How to Ace IT Product Localization: The 101 Guide
The Israeli Social Protest from a Data Science Perspective: Part One
"Locating Everyday Objects Using NFC Textiles," by Jingxian Wang et al., describes the potential of Near-Field Communication for advanced home automation.
Using Psychology to Bolster Cybersecurity
Generative AI as a New Innovation Platform
Certification of Safety-Critical Systems
Locating Everyday Objects Using NFC Textiles
This paper builds a Near-Field Communication-based localization system that allows ordinary surfaces to locate surrounding objects with high accuracy in the near-field.
The Life-or-Death Importance of Medical Device Security
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