Communications of the ACM
Research Archive
The Research archive provides access to all Research articles published in past issues of Communications of the ACM.
September 2010
From Communications of the ACM
Constraint Satisfaction Problems and Global Cardinality Constraints
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many…
From Communications of the ACM
Privacy Integrated Queries: An Extensible Platform For Privacy-Preserving Data Analysis
Privacy Integrated Queries (PINQ) is an extensible data analysis platform designed to provide unconditional privacy guarantees for the records of the underlying data sets. PINQ's analysis language and its implementation provide…
From Communications of the ACM
Technical Perspective: Programming With Differential Privacy
Government agencies worldwide release statistical information about population, education, and health, crime, and economic activities. In the U.S., protecting this data…
From Communications of the ACM
Technical Perspective: Constraint Satisfaction Problems and Computational Complexity
It takes little imagination to come up with a wealth of problems in scheduling and planning that can be expressed as Constraint Satisfaction Problems (CSPs). It's no surprise…