We give a logical characterization of the polynomial-time properties of graphs with excluded minors.Martin Grohe From Communications of the ACM | June 2011
CDOs are examples of financial derivatives, with a value that depends on the underlying assets with which they are linked. These kinds of complex financial products...David C. Parkes From Communications of the ACM | May 2011
Securitization of cash flows using financial derivatives transformed the financial industry over the last three decades. Derivatives...Sanjeev Arora, Boaz Barak, Markus Brunnermeier, Rong Ge From Communications of the ACM | May 2011
The question of determining which (weak) forms of randomness "fool" (or seem totally random to) a given algorithm is a basic...Mark Braverman From Communications of the ACM | April 2011
Is the number 9021960864034418159813 random? To my limited mind, the string appears random. Is there a way to use some formal mathematics...Madhu Sudan From Communications of the ACM | April 2011
This paper reports on the results of a multidisciplinary project involving lawyers and computer scientists with the aim to put forward a set of methods and tools...Daniel Le Métayer, Manuel Maarek, Eduardo Mazza, Marie-Laure Potet, Stéphane Frénot, Valérie Viet Triem Tong, Nicolas Craipeau, Ronan Hardouin From Communications of the ACM | April 2011
The paper by LeMétayer et al. addresses one technical issue in a large and serious problem in the production...Daniel M. Berry From Communications of the ACM | April 2011
VL2 is a practical network architecture that scales to support huge data centers with uniform high capacity between servers, performance isolation between services...Albert Greenberg, James R. Hamilton, Navendu Jain, Srikanth Kandula, Changhoon Kim, Parantap Lahiri, David A. Maltz, Parveen Patel, Sudipta Sengupta From Communications of the ACM | March 2011
The Internet is increasingly a platform for online services running on rack after rack of servers. With the advent of large data centers, the study of the networks...Jennifer Rexford From Communications of the ACM | March 2011
A system for musical accompaniment is presented in which a computer-driven orchestra follows and learns from a soloist in a concerto-like setting. The system's...Christopher Raphael From Communications of the ACM | March 2011
In the opening of Sibelius' Violin Concerto, a soloist plays delicately. The orchestra responds in kind. As...Juan Bello, Yann LeCun, Robert Rowe From Communications of the ACM | March 2011
While a large body of work exists on DRAM in lab conditions, little has been reported on real DRAM failures in large production clusters. In this paper, we analyze...Bianca Schroeder, Eduardo Pinheiro, Wolf-Dietrich Weber From Communications of the ACM | February 2011
In order to advance the field, knowledge of the types of memory errors at the system level, their frequencies, and conditions that exacerbate or are unrelated to...Norman P. Jouppi From Communications of the ACM | February 2011
This paper studies data transfers under two classes of multipath control, coordinated control where the rates...Peter Key, Laurent Massoulié, Don Towsley From Communications of the ACM | January 2011
Multipath transmission for the Internet—that is, allowing users to send some of their packets along one path and...Damon Wischik From Communications of the ACM | January 2011
Sora, a fully programmable software radio platform on commodity PC architectures, combines the performance and fidelity of hardware software-defined radio platforms...Kun Tan, He Liu, Jiansong Zhang, Yongguang Zhang, Ji Fang, Geoffrey M. Voelker From Communications of the ACM | January 2011
The objective of Sora is to build a software defined radio that combines the performance and fidelity of hardware...Dina Katabi From Communications of the ACM | January 2011
The collection of computational problems having quantum interactive proof systems consists precisely of those problems solvable with an ordinary classical computer...Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous From Communications of the ACM | December 2010
It is now clear that for a wide range of problems, quantum computers offer little or no advantage over their classical counterparts.
Scott Aaronson From Communications of the ACM | December 2010
Multithreaded programs are notoriously prone to race conditions. Prior work developed precise dynamic race detectors that never report false alarms. However, these...Cormac Flanagan, Stephen N. Freund From Communications of the ACM | November 2010