The role of ACM members, as professionals in the computing realm, makes them candidates for the provision of expert testimony in both criminal and civil judicial proceedings.
Vinton G. Cerf Page 5DEPARTMENT: BLOG@CACM
"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?"
Shang-Hua Teng Page 84
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.
Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva Pages 85-92COLUMN: Last Byte
2023-2024 ACM Athena Lecturer Margo Seltzer recalls the motivations behind the development of the Berkeley DB database software library, and other achievements during her career.
Leah Hoffmann Pages 96-ff