DEPARTMENT:
Departments
The Agency Trilemma and ACM
Three-way conflict arises in professional societies, such as ACM, which have members, elected officials, and permanent staff. Aligning the interests of these three groups can be challenging.
Moshe Y. Vardi
Page 4
DEPARTMENT:
Editor's letter
In Response to 'Vardi's Insights'
Moshe Vardi's column, "The Agency Trilemma and ACM," misrepresents some decisions and actions made in regard to ACM's Open Access model.
Cherri M. Pancake, Andrew A. Chien
Page 5
DEPARTMENT:
Career paths in computing
Promote Sustainability and Help Underserved Communities
Sustainability is the greatest challenge threatening mankind. The U.N.'s Sustainable Development Goals promote solutions for this threat. Computing, through a series of serendipitous events, has enabled me to join this fight. …
Caven Cade Mitchell
Page 7
DEPARTMENT:
BLOG@CACM
Teaching Other Teachers How to Teach CS Better
Mark Guzdial shares how he assesses the efforts of other computer science teachers.
Mark Guzdial
Pages 8-9
COLUMN:
News
A Satisfying Result
Formulating a decades-old geometric conjecture as a satisfiability problem opened the door to its final resolution.
Don Monroe
Pages 10-12
A Traffic Cop for Low Earth Orbit
Who will be the space traffic controller for orbiting objects?
Keith Kirkpatrick
Pages 15-17
Catching the Fakes
Applying neural networks to images helps identify counterfeit goods.
Neil Savage
Pages 13-14
COLUMN:
Security
Trustworthy Scientific Computing
Addressing the trust issues underlying the current limits on data sharing.
Sean Peisert
Pages 18-21
COLUMN:
Law and technology
Software Professionals, Malpractice Law, and Codes of Ethics
In pursuit of professional status for computing professionals.
Bryan H. Choi
Pages 22-24
COLUMN:
Education
CS Unplugged or Coding Classes?
Perhaps a more appropriate question is 'Why not both'?
Tim Bell
Pages 25-27
SECTION:
Research highlights
Technical Perspective: Robust Statistics Tackle New Problems
"Robustness Meets Algorithms," by Ilias Diakonikolas, et al., represents the beginning of a long and productive line of work on robust statistics in high dimensions.
Jacob S. Steinhardt
Page 106
COLUMN:
Viewpoint
Understanding Law and the Rule of Law: A Plea to Augment CS Curricula
Why law matters for computer scientists and other folk.
Mireille Hildebrandt
Pages 28-31
Let's Be Honest
Seeking to rectify the two mutually exclusive ways of comparing computational power — encoding and simulation.
Nachum Dershowitz
Pages 37-41
The 10 Best Practices for Remote Software Engineering
Focusing on the human element of remote software engineer productivity.
Vanessa Sochat
Pages 32-36
SECTION:
Practice
Battery Day
A closer look at the technology that makes portable electronics possible.
Jessie Frazelle
Pages 52-59
Enclaves in the Clouds
Legal considerations and broader implications
Jatinder Singh, Jennifer Cobbe, Do Le Quoc, Zahra Tarkhani
Pages 42-51
SECTION:
Contributed articles
HCDA: From Computational Thinking to a Generalized Thinking Paradigm
As a new era in computing emerges, so too must our fundamental thinking patterns.
Yuhang Liu, Xian-He Sun, Yang Wang, Yungang Bao
Pages 66-75
Implementing Insider Defenses
How to avoid insider cyber-attacks by creating a corporate culture that infuses trust.
Eric Grosse, Fred B. Schneider, Lynette L. Millett
Pages 60-65
What Serverless Computing Is and Should Become: The Next Phase of Cloud Computing
The evolution that serverless computing represents, the economic forces that shape it, why it could fail, and how it might fulfill its potential.
Johann Schleier-Smith, Vikram Sreekanti, Anurag Khandelwal, Joao Carreira, Neeraja J. Yadwadkar, Raluca Ada Popa, Joseph E. Gonzalez, Ion Stoica, David A. Patterson
Pages 76-84
SECTION:
Research highlights
Robustness Meets Algorithms
We give the first efficient algorithm for estimating the parameters of a high-dimensional Gaussian that is able to tolerate a constant fraction of corruptions that is independent of the dimension.
Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart
Pages 107-115
Isomorphism, Canonization, and Definability for Graphs of Bounded Rank Width
In this paper we study the graph isomorphism problem and the closely related graph canonization problem as well as logical definability and descriptive complexity on graph classes of bounded rank width.
Martin Grohe, Daniel Neuen
Pages 98-105
Technical Perspective: A Logical Step Toward the Graph Isomorphism Problem
In "Isomorphism, Canonization, and Definability for Graphs of Bounded Rank Width," Grohe and Neuen show that the Weisfeiler-Leman algorithm in its plain form solves the isomorphism problem for bounded-rank width graphs.
Pascal Schweitzer
Page 97
COLUMN:
Last byte
Behold the Ch!Ld
Opportunity can come calling when you least expect it.
P-Ray
Pages 120-ff
SECTION:
Review articles
Automata Modulo Theories
Symbolic automata better balances how automata are implemented in practice.
Loris D'Antoni, Margus Veanes
Pages 86-95