Jason DeVinney

According to our database, Jason DeVinney authored at least 4 papers between 2002 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2018

A Unified Runtime for PGAS and Event-Driven Programming.

Sri Raj Paul, Kun Chen, Akihiro Hayashi, Max Grossman, Vivek Sarkar, Jason DeVinney, Bill Carlson

Proceedings of the 4th International Workshop on Extreme Scale Programming Models and Middleware, 2018

2006

A new family of proximity graphs: Class cover catch digraphs.

Jason DeVinney, Carey E. Priebe

Discret. Appl. Math., 2006

2003

Classification Using Class Cover Catch Digraphs.

Carey E. Priebe, David J. Marchette, Jason DeVinney, Diego A. Socolinsky

J. Classif., 2003

2002

An efficient network flow code for finding all minimum cost <i>s</i>-<i>t</i> cutsets.

Norman D. Curet, Jason DeVinney, Matthew E. Gaston

Comput. Oper. Res., 2002