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.
DEPARTMENT: Editor's letter
Moshe Vardi's column, "The Agency Trilemma and ACM," misrepresents some decisions and actions made in regard to ACM's Open Access model.
DEPARTMENT: Career paths in computing
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. …
Mark Guzdial shares how he assesses the efforts of other computer science teachers.
Formulating a decades-old geometric conjecture as a satisfiability problem opened the door to its final resolution.
Applying neural networks to images helps identify counterfeit goods.
Who will be the space traffic controller for orbiting objects?
Addressing the trust issues underlying the current limits on data sharing.
COLUMN: Law and technology
In pursuit of professional status for computing professionals.
Perhaps a more appropriate question is 'Why not both'?
Why law matters for computer scientists and other folk.
Focusing on the human element of remote software engineer productivity.
Seeking to rectify the two mutually exclusive ways of comparing computational power — encoding and simulation.
Legal considerations and broader implications
A closer look at the technology that makes portable electronics possible.
SECTION: Contributed articles
How to avoid insider cyber-attacks by creating a corporate culture that infuses trust.
As a new era in computing emerges, so too must our fundamental thinking patterns.
The evolution that serverless computing represents, the economic forces that shape it, why it could fail, and how it might fulfill its potential.
SECTION: Review articles
Symbolic automata better balances how automata are implemented in practice.
SECTION: Research highlights
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.
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.
"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.
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.
COLUMN: Last byte
Opportunity can come calling when you least expect it.