70 citations · 72 across the 3 of their papers we have counts for
3 papers
math.NA2015★ 2 cited
Robust split-step Fourier methods for simulating the propagation of ultra-short pulses in single- and two-mode optical communication fibers
Ralf Deiterding, Stephen W. Poole
Extensions of the split-step Fourier method (SSFM) for Schrödinger-type pulse propagation equations for simulating femto-second pulses in single- and two-mode optical communication…
cs.MS2014★ 70 cited
Standards for Graph Algorithm Primitives
Tim Mattson, David Bader, Jon Berry +16
It is our view that the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operations is mature enough to support the emergence of…
cs.PF2010
A New Benchmark For Evaluation Of Graph-Theoretic Algorithms
Andy B. Yoo, Yang Liu, Sheila Vaidya +1
We propose a new graph-theoretic benchmark in this paper. The benchmark is developed to address shortcomings of an existing widely-used graph benchmark. We thoroughly studied a lar…