125 citations · 130 across the 11 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
The Einsum-Enabled Design Space for Graph Algorithms: A BFS Case Study
Toluwanimi O. Odemuyiwa, Serban D. Porumbescu, Muhammad Osama +2
We propose a principled approach to reasoning about various graph algorithm implementations. We leverage the extended general Einsum notation (EDGE) which allows us to factor compl…
cs.DS2024
The EDGE Language: Extended General Einsums for Graph Algorithms
Toluwanimi O. Odemuyiwa, Serban D. Porumbescu, Nandeeka Nayak +3
In this work, we propose a unified abstraction for graph algorithms: the Extended General Einsums language, or EDGE. The EDGE language expresses graph algorithms in the language of…