activity
20072023
most citedMathematical Foundations of the GraphBLAS

187 citations · 321 across the 15 of their papers we have counts for

collaborators

15 papers

cs.LG2023

Minibatching Offers Improved Generalization Performance for Second Order Optimizers

Eric Silk, Swarnita Chakraborty, Nairanjana Dasgupta +3

Training deep neural networks (DNNs) used in modern machine learning is computationally expensive. Machine learning scientists, therefore, rely on stochastic first-order methods fo…

cs.DC2022

High-order Line Graphs of Non-uniform Hypergraphs: Algorithms, Applications, and Experimental Analysis

Xu T. Liu, Jesun Firoz, Sinan Aksoy +5

Hypergraphs offer flexible and robust data representations for many applications, but methods that work directly on hypergraphs are not readily available and tend to be prohibitive…

eess.IV2020★ 16 cited

Real-Time Refocusing using an FPGA-based Standard Plenoptic Camera

Christopher Hahne, Andrew Lumsdaine, Amar Aggoun +1

Plenoptic cameras are receiving increasing attention in scientific and commercial applications because they capture the entire structure of light in a scene, enabling optical trans…

cs.DM2020

Parallel Algorithms and Heuristics for Efficient Computation of High-Order Line Graphs of Hypergraphs

Xu T. Liu, Jesun Firoz, Andrew Lumsdaine +4

This paper considers structures of systems beyond dyadic (pairwise) interactions and investigates mathematical modeling of multi-way interactions and connections as hypergraphs, wh…

cs.DC2019★ 5 cited

A Comparative Study of Asynchronous Many-Tasking Runtimes: Cilk, Charm++, ParalleX and AM++

Abhishek Kulkarni, Andrew Lumsdaine

We evaluate and compare four contemporary and emerging runtimes for high-performance computing(HPC) applications: Cilk, Charm++, ParalleX and AM++. We compare along three bases: pr…

cs.DC2017

Families of Distributed Memory Parallel Graph Algorithms from Self-Stabilizing Kernels-An SSSP Case Study

Thejaka Kanewala, Marcin Zalewski, Martina Barnas +1

Self-stabilizing algorithms are an important because of their robustness and guaranteed convergence. Starting from any arbitrary state, a self-stabilizing algorithm is guaranteed t…