research
∙
10/04/2022
The DAG Visit approach for Pebbling and I/O Lower Bounds
We introduce the notion of an r-visit of a Directed Acyclic Graph DAG G=...
share
research
∙
09/30/2020
Communication-Optimal Parallel Standard and Karatsuba Integer Multiplication in the Distributed Memory Model
We present COPSIM a parallel implementation of standard integer multipli...
research
∙
12/15/2019
On the I/O complexity of hybrid algorithms for Integer Multiplication
Almost asymptotically tight lower bounds are derived for the I/O complex...
research
∙
10/04/2019
A Rademacher Complexity Based Method fo rControlling Power and Confidence Level in Adaptive Statistical Analysis
While standard statistical inference techniques and machine learning gen...
research
∙
04/29/2019
The I/O complexity of hybrid algorithms for square matrix multiplication
Asymptotically tight lower bounds are derived for the I/O complexity of ...
research
∙
11/01/2018