Alas, this page is often (and currently) out of date. Ping me at for any questions...

My Curriculum vita is much more up to date, although it still lags. I'm busy...

Items of note:

Contact information

E. Jason Riedy

Senior Research Scientist
School of Computational Science and Engineering
College of Computing
Georgia Institute of Technology

1316 Klaus Advanced Computing Building
266 Ferst Drive
Atlanta, GA 30332-0765

Curriculum vita
(personal external web site)


Not so recent from full list, see my CV for more:


Much of the software is at our group's trac instance. All of the software is collaborative.

Biographical sketch

Dr. E. Jason Riedy is a Senior Research Scientist in the School of Computational Science and Engineering at Georgia Tech. His current research focuses primarily on massive scale and streaming graph analysis as encapsulated in the STINGER software framework. He developed a scalable community detection code that won the 10th DIMACS Implementation Challenge's mix competition, and his work in STINGER has produced the first algorithms for multiple streaming graph analysis metrics. STINGER received a best paper award at IEEE HPEC 2012. He continues research in sparse and dense linear algebra including development of the widely used reference BLAS (Basic Linear Algebra Subprograms) and LAPACK (Linear Algebra PACKage) software. He currently serves on the IEEE 754 (IEEE Standard on Floating Point Arithmetic) revision committee and has extended the proposed standard to further support extra precision and reproducible operations. Dr. Riedy has been a Georgia Tech research teaching fellow and continues teaching an undergraduate research class monitoring honey bees and other pollinators in the metro Atlanta area with IoT (Internet of Things) platforms. He also was a research fellow in the Institute for Data and High Performance Computing. His dual B.S. in Computer Science and Mathematics is from the University of Florida in 1998. His Ph.D. in Computer Science is from the University of California, Berkeley in 2010 in combinatorial optimization and targeted high-precision arithmetic.

Version: 3.1
GCS/M d-(++) s+: a+ C++++(---)$@ UBLA*++++$ P+++$ L+++$>++++ E++$>+++ !W++ N++
!o K++ w--- O- M-- V- PS+>+++ PE- Y++>$ PGP++ t++>+++ 5++ X+ !R tv b+>++
DI D--- G+ e++++ h--- r+++ z+++**