DEPARTMENT: From the president
Have you wondered why a person you admire has not received an ACM award? As a former ACM Awards Chair, I'd like to share some insights on what makes nominations effective.
DEPARTMENT: Cerf's up
Some actions or decisions are irreversible. We would do ourselves a great favor if we were to design our digital systems to the maximum extent possible to avoid irreversible traps.
DEPARTMENT: Letters to the editor
In their column "Learning Machine Learning" (Dec. 2018), Ted G. Lewis and Peter J. Denning raised a crucial question about machine learning systems.
Mark Guzdial suggests ways to cut the long lines for college students seeking to meet with their computer science advisors.
A college student discovered a classical computing algorithm that experts overlooked. It promises to change both classical and quantum machine learning.
Self-driving cars will need good communication skills.
Interactions with robotics teach us more about people.
Considering how block-based programming environments and tools might be used at the introductory level and beyond.
COLUMN: Economic and business dimensions
How boundaries on speech could free the market for speech.
COLUMN: Kode vicious
On writing documentation.
Connecting the unique factors that influenced the origination and subsequent development of the World Wide Web.
Five diverse technology companies show how it's done.
An executive crash course.
Know when to let go of emotional attachment to your work.
SECTION: Contributed articles
A Harvard-based pilot program integrates class sessions on ethical reasoning into courses throughout its computer science curriculum.
Key lessons for designing static analysis tools deployed to find bugs in hundreds of millions of lines of code.
SECTION: Review articles
The ability to build a construct that organizes work from different devices and information resources is as complex as it is invaluable.
Tracing the tangled web of unsolicited and undesired email and possible strategies for its demise.
SECTION: Research highlights
The main focus of "Heavy Hitters via Cluster-Preserving Clustering" by Kasper Green Larsen et al. is on building up sufficient information to allow a more effective search process.
We develop a new algorithm for the turnstile heavy hitters problem in general turnstile streams, the EXPANDERSKETCH, which finds the approximate top-k items in a universe of size n using the same asymptotic O(k log n) words of …
COLUMN: Last byte
In trying to "drown" the opposition with daily online elections, I didn't realize they could wash me away.