Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
The paper introduces Network-on-Chip (NoC) design methodology and low cost mechanisms for supporting efficient cache access and cache coherency in future high-performance Chip Mul...
Evgeny Bolotin, Zvika Guz, Israel Cidon, Ran Ginos...