Algorithms
Complexity Theory for MapReduce Algorithms
For many problems, algorithms implemented in MapReduce or similar two-ranks-of-parallel-tasks systems exhibit a tradeoff between memory size and communication. More precisely, the tradeoff is between “reducer size” (the number of inputs received by the second…
End of Internship Talks
End for Internship talks given by: Perry Wang Title: “Low* and subset of F* that will compile down to C” Time : 10-10:45 Laure Thompson Title: “Spartan and proving implementations of cryptographic algorithms correct” Time…
Microsoft researchers enable secure data exchange in the cloud
By John Roach, Writer, Microsoft Research In the future, machine learning algorithms may examine our genomes to determine our susceptibility to maladies such as heart disease and cancer. Between now and then, computer scientists need…
Compiler Optimizations for Graph Algorithms on GPUs
Graphics Processing Units (GPUs) are an attractive target for graph algorithms because they support massively parallel execution and possess much higher memory bandwidths than CPUs and FPGAs. However, graph programs are also highly irregular and…
