Tuesday 12/5/2023 2pm  Nishil Talati  University of Michigan  HighPerformance GPU Code Generation for Mining Motifs in Temporal Graphs

Tuesday 10/17/2023 2pm  Rohan Yadav  Stanford University  Distributed Sparse Computing in Python

Thursday 5/11/2023  Gal Sela  Technion  Israel Institute of Technology  Size Operation for Concurrent Data Structures 
Thursday 4/20/2023  Jialin Li  National University of Singapore  The Case for Network Ordering in Distributed Systems Design

Wednesday 10/5/2022  Rezaul Chowdhury  Stony Brook University  Fast Stencil Computations using FFT and Gaussian Approximations

Wednesday 9/28/2022  Harsha Simhadri  Microsoft Research  Approximate Nearest Neighbor Search algorithms for webscale search and recommendation 
Wednesday 9/14/2022  David Tench  Rutgers University 
Dynamic Graph Connectivity: To Infinity And Beyond 
Wednesday 6/1/2022 
Hans Vandierendonck  Queen's University Belfast 
Memory Locality Optimisations for Graph Processing

Wednesday 4/20/2022  Jessica Shi  MIT 
Bridging Theory and Practice in Parallel Subgraph Computations

Wednesday 4/6/2022  Neil Thompson  MIT 
How close are algorithms to being optimal?

Wednesday 2/16/2022  William Kuszmaul  MIT 
Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering

Wednesday 12/8/2021  Yuanhao Wei  CMU 
Multipoint Queries on Concurrent Data Structures

Wednesday 11/17/2021  Naama BenDavid  VMware Research  Algorithms for Practical Distributed Agreement

Wednesday 11/3/2021  Irene Zhang  Microsoft Research  The Demikernel Datapath OS Architecture for Microsecondscale Datacenter Systems

Wednesday 10/13/2021  Jan Vitek  Northeastern University  Productivity and Performance Reconciled: The Julia Story

Wednesday 5/12/2021  Daniel Lemire  University of Quebec  Parsing numbers at a gigabyte per second

Wednesday 4/28/2021  Xuhao Chen  MIT  Software and Hardware Systems for Emerging Graph Algorithms

Wednesday 4/7/2021  Helen Xu  MIT 
Data Structure Design for Skewed Dynamic Graph Processing

Wednesday 3/31/2021  Tim Davis  Texas A&M 
SuiteSparse:GraphBLAS: graph algorithms in the language of sparse linear algebra

Wednesday 3/24/2021  Martin FarachColton  Rutgers University 
The Algorithmics of Address Translation 
Wednesday 3/17/2021  Maryam Mehri Dehnavi  University of Toronto  Inspecting Irregular Computation Patterns to Generate Fast Code

Wednesday 3/10/2021  Sam Westrick  CMU 
Disentanglement: Provably Efficient Parallel Functional Programming (Slides)

Wednesday 2/24/2021  Edgar Solomonik  UIUC  Scalable Algorithms for Tensor Computations (Slides)

Monday 1/25/2021
 Ariful Azad  Indiana University  Computational Building Blocks for Machine Learning on Graphs (Slides)

Monday 1/11/2021  Xuehai Qian  USC 
High Performance Graph Mining Systems (Slides)

Monday 12/7/2020  Yuanming Hu  MIT 
Taichi: A Language for HighPerformance Computation on Spatially Sparse Data Structures

Monday 11/30/2020  Scott Beamer  UC Santa Cruz 
Efficiently Exploiting LowActivity Factors to Accelerate RTL Simulation

Monday 11/9/2020  Bradley Kuszmaul  Google 
Everyone Loves File: File Storage Service (FSS) in Oracle Cloud Infrastructure

Monday 11/2/2020  Michael Bender  Stony Brook University 
Filters

Monday 10/26/2020  Alex Pothen  Purdue University 
Approximation: A Paradigm for Designing Parallel Graph Algorithms

Monday 10/19/2020  Rezaul Chowdhury  Stony Brook University 
Automatic Derivation of Efficient Parallel Recursive Divide&Conquer Algorithms for Dynamic Programs

Monday 9/28/2020  Michael Mahoney  ICSI and UC Berkeley 
ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learning

Monday 9/21/2020  Franz Franchetti  Carnegie Mellon University 
SPIRAL's Operator Language: From Textbook Math to High Performance  With Correctness Guarantees

Monday 8/10/2020  James Demmel  UC Berkeley 
Communicationavoiding algorithms for linear algebra, machine learning and beyond

Monday 8/3/2020  Kathy Yelick  UC Berkeley/ Lawrence Berkeley National Lab 
Genomic Analysis and Learning at Scale: Mapping Irregular Computations to Advanced Architectures

Monday 7/27/2020  Larry Rudolph and Steven Martin  Two Sigma Investments, LP/ MIT CSAIL 
QuickQuery: GPUBased Approximate Query Processing for SubSecond Exploration at Scale

Monday 7/20/2020  Stephen Chou  MIT 
Format Abstractions for Sparse Tensor Algebra Compilation

Monday 7/13/2020  Michael Axtmann and Peter Sanders  Karlsruhe Institute of Technology 
Engineering Scalable Parallel Sorting Algorithms

Monday 6/29/2020  Umit Catalyurek  Georgia Tech 
Fast graph analytics on heterogenous and deepmemory architectures

Monday 6/22/2020  Aydin Buluc  Lawrence Berkeley National Lab/UC Berkeley 
Sparse Matrices Beyond Solvers: Graphs, Biology, and Machine Learning (Slides)

Monday 6/15/2020  WenMei Hwu  UIUC 
Fast GPU Code for Graphs (Slides)

Monday 6/8/2020  David Bader  New Jersey Institute of Technology 
Solving Global Grand Challenges with High Performance Data Analytics

Monday 6/1/2020  John Owens  UC Davis 
Dynamic Data Structures on the GPU

Monday 5/11/2020  Alex Aiken  Stanford 
Program Optimization for Machine Learning

Monday 5/4/2020  Ariya Shajii  MIT 
Seq: a highperformance language for bioinformatics

Monday 4/20/2020  Neil Thompson & Yash Sherry  MIT 
How fast are Algorithms Improving?

Tuesday 2/18/2020  S. Tucker Taft  AdaCore 
Safe Parallel Programming  ParaSail, Ada 202X, OpenMP, and Rust

Monday 11/25/2019  Bruce Maggs  Duke University and Emerald Innovations 
A SpeedofLight Internet Service Provider

Monday 11/18/2019  Charith Mendis  MIT 
How to Modernize Compiler Technology

Monday 11/4/2019  Yunming Zhang  MIT 
GraphIt: A DomainSpecific Language for Writing HighPerformance Graph Applications

Monday 10/21/2019  Alex Conway  Rutgers University 
SplinterDB: Closing the Bandwidth Gap on NVMe

Monday 9/30/2019  Valentin Churavy  MIT 
Julia: Making dynamic programs run fast

Monday 9/23/2019  Riyadh Baghdadi  MIT 
Tiramisu: A Polyhedral Compiler for Dense and Sparse Deep Learning

Monday 9/16/2019  Bill Dally  NVIDIA Corporation and Stanford University 
DomainSpecific Accelerators

Tuesday 8/27/2019  Laxman Dhulipala  Carnegie Mellon University 
Algorithms and Systems for Processing Massive Static and Evolving Graphs

Tuesday 8/20/2019  Tao B. Schardl  MIT 
Tapir: Embedding Recursive ForkJoin Parallelism into LLVM's Intermediate Representation

Tuesday 8/6/2019  Jeremy Kepner  MIT Lincoln Laboratory Supercomputing Center 
Optimal system settings: How to not lose before you begin

Tuesday 7/30/2019  ITing Angelina Lee  Washington University in St. Louis 
Advances in Determinacy Race Detection for TaskParallel Code

Tuesday 7/23/2019  Maurice Herlihy  Brown University 
Speculative Concurrency for Ethereum Smart Contracts

Tuesday 7/16/2019  Song Han  MIT 
AutoML for Efficiently Designing Efficient Neural Network Architectures

Tuesday 7/9/2019  Fredrik Kjolstad  MIT 
The Sparse Tensor Algebra Compiler

Tuesday 6/11/2019  Charles Leiserson  MIT 
The Resurgence of Software Performance Engineering
