Sign In

Communications of the ACM

Table of Contents

DEPARTMENT: Policy letter

USACM's Policy Role

ACM members have a professional duty to ensure that the public comprehends and benefits from advances in computing.
DEPARTMENT: Letters to the editor

Seven Principles For Secure E-Voting

E-voting can be as secure and confidential as paper-based voting, as discussed in "The U.S. Should Ban Paperless Electronic Voting Machines" (Oct. 2008). However, to work properly …

The Dot-Org Difference

One of the first things you'll notice about the new Communications Web site ( is that it has different content than the monthly magazine. A distinctive …

Photography's Bright Future

Researchers working in computational photography are using computer vision, computer graphics, and applied optics to bring a vast array of new capabilities to digital cameras.

Making Sense of Sensors

Researchers are recognizing the potential of position sensors to help them overcome the limitations of traditional user interfaces.

The First Internet President

Barack Obama's presidential campaign utilized the Internet and information technology unlike any previous political campaign. How politicians and the public interact will never be the same.

SIGGRAPH Debuts in Asia

ACM's premier computer graphics conference hosts its first-ever graphics event in Asia, with a more global focus.
COLUMN: Viewpoints

Economic and Business Dimensions: The Extent of Globalization of Software Innovation

Will the software development laboratories follow the production mills?

Human Computing Skills: Rethinking the K-12 Experience

Establishing the fundamentals of computational thinking is essential to improving computer science education.

International Communications Tapped For Intelligence-Gathering

Governments concerned with national-security threats use the Internet to gather intelligence from communications traffic that transits local facilities. This surveillance is expanding — to the detriment of communications privacy …

Inside Risks: U.S. Election After-Math

Recounting problems still associated with election integrity, transparency, and accountability.

Point/Counterpoint: Network Neutrality Nuances

A discussion of divergent paths to unrestricted access of content and applications via the Internet.
COLUMN: Practice

Parallel Programming with Transactional Memory

While still primarily a research project, transactional memory shows promise for making parallel programming easier.

Improving Performance on the Internet

Given the Internet's bottlenecks, how can we build fast, scalable, content-delivery systems?
SECTION: Contributed articles

Toward 2w, Beyond Web 2.0

2W is a result of the exponentially growing Web building on itself to move from a Web of content to a Web of applications.

Compiler Research: The Next 50 Years

Four recommendations address the major challenges to keeping compilers and high-level languages vibrant.
SECTION: Review articles

Women in Computing Take 2

What strategies can employers and educators use to successfully recruit, retain, and inspire women in computing? 
SECTION: Research highlights

Technical Perspective: Tools For Information to Flow Securely and Swift-ly

Back in the old days of the Web (before 1995), Web browsers were fairly simple devices. The server's Web interface was simple enough that an auditor could at least look at it and reason about its security. Today, it's a different …

Building Secure Web Applications With Automatic Partitioning

Swift is a new, principled approach to building Web applications that are secure by construction. Swift automatically partitions application code while providing assurance that the resulting placement is secure and efficient. …

Technical Perspective: The Complexity of Computing Nash Equilibrium

Computer science and game theory go back to the same individual, John von Neumann, and both subjects deal with the mathematization of rational decision making. Yet, for many …

The Complexity of Computing a Nash Equilibrium

Traditionally, computational problems fall into two classes: those that have a polynomial-time algorithm and those that are NP-hard. However, the concept of NP-hardness cannot be applied to the rare problems where "every instance …
COLUMN: Last byte

Puzzled: Will My Algorithm Terminate?

Welcome to three new challenging mathematical puzzles. Solutions to the first two will be published next month; the third is as yet unsolved. In them all, I concentrate on algorithm termination, outlining some simple procedures …
SECTION: Virtual extension

Networks of Contextualized Data: a Framework For Cyberinfrastructure Data Management

For Sale By Owner Online: Who Gets the Saved Commission?

Oracle, Where Shall I Submit My Papers?

Automatically Profiling the Author of an Anonymous Text

Shadow Systems: the Good, the Bad and the Ugly

Why Is Management Is In Trouble and How to Save It: Lessons Learned in the Automotive Industry

Why File Sharing Networks Are Dangerous?

Technical Opinion: Multitasking With Laptops During Meetings