John Feo

Generating author description...

All published works

Action	Title	Year	Authors
+	Combining Tensor Decompositions and Graph Analytics to Provide Cyber Situational Awareness at HPC Scale	2019	James Ezick Tom Henretty Muthu Manikandan Baskaran Richard Lethin John Feo Tai-Ching Tuan Christopher Coley Leslie Leonard Rajeev Agrawal Ben Parsons
+	A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs	2015	Sutanay Choudhury Lawrence B. Holder George Chin Khushbu Agarwal John Feo
+	A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs	2015	Sutanay Choudhury Lawrence B. Holder George Chin Khushbu Agarwal John Feo
+	Query Optimization for Dynamic Graphs.	2014	Sutanay Choudhury Lawrence B. Holder George Chin Patrick Mackey Khushbu Agarwal John Feo
+ PDF Chat	Parallel Implementation of Fast Randomized Algorithms for Low Rank Matrix Decomposition	2014	Andrew Lucas Mark A. Stalzer John Feo
+	Query Optimization for Dynamic Graphs	2014	Sutanay Choudhury Lawrence B. Holder George Chin Patrick Mackey Khushbu Agarwal John Feo
+ PDF Chat	Standards for graph algorithm primitives	2013	Tim Mattson David A. Bader Jon Berry Aydın Buluç Jack Dongarra Christos Faloutsos John Feo John R. Gilbert Joseph E. Gonzalez Bruce Hendrickson
+ PDF Chat	Fast search for dynamic multi-relational graphs	2013	Sutanay Choudhury Lawrence B. Holder John Feo George Chin
+	Fast Search for Dynamic Multi-Relational Graphs	2013	Sutanay Choudhury Lawrence B. Holder George Chin John Feo
+	StreamWorks - A system for Dynamic Graph Search	2013	Sutanay Choudhury Lawrence B. Holder George Chin Abhik Ray Sherman Beus John Feo
+	Fast Search for Dynamic Multi-Relational Graphs	2013	Sutanay Choudhury Lawrence B. Holder George Chin John Feo
+ PDF Chat	Scalable Triadic Analysis of Large-Scale Graphs: Multi-core vs. Multi-processor vs. Multi-threaded Shared Memory Architectures	2012	George Chin Andrés Márquez Sutanay Choudhury John Feo
+	Scalable Triadic Analysis of Large-Scale Graphs: Multi-Core vs. Multi- Processor vs. Multi-Threaded Shared Memory Architectures	2012	George Chin Andrés Márquez Sutanay Choudhury John Feo
+	Continuous Queries for Multi-Relational Graphs	2012	Sutanay Choudhury Lawrence B. Holder Abhik Ray George Chin John Feo
+	Graph Coloring Algorithms for Muti-core and Massively Multithreaded Architectures	2012	Ümit V. Çatalyürek John Feo Assefaw H. Gebremedhin Mahantesh Halappanavar Alex Pothen
+	Scalable Triadic Analysis of Large-Scale Graphs: Multi-Core vs. Multi- Processor vs. Multi-Threaded Shared Memory Architectures	2012	George Chin Andrés Márquez Sutanay Choudhury John Feo
+ PDF Chat	Large-scale continuous subgraph queries on streams	2011	Sutanay Choudhury Lawrence B. Holder George Chin John Feo
+	Sparse Direct Methods	2011	Jack Dongarra Piotr Łuszczek Felix Wolf Jesper Larsson Träff Patrice Quinton Hermann Hellwagner Martin Fränzle Christian Lengauer Luís Ceze Kei Hiraki

Common Coauthors

Coauthor	Papers Together
Sutanay Choudhury	13
George Chin	13
Lawrence B. Holder	10
Khushbu Agarwal	4
Andrés Márquez	3
Patrick Mackey	2
Jack Dongarra	2
David A. Bader	2
John R. Gilbert	2
Abhik Ray	2
Felix Wolf	1
Steve Reinhardt	1
Frederica Darema	1
Edgar Solomonik	1
Sudhakar Yalamanchili	1
Ümit V. Çatalyürek	1
Charles E. Leiserson	1
Matous Sedlacek	1
Christopher Coley	1
William Glodek	1
Konstantin Makarychev	1
Christos Faloutsos	1
Aydın Buluç	1
Michael Bäder	1
Laura Grigori	1
Stephen W Poole	1
José Flich	1
Meiyue Shao	1
Eric Polizzi	1
Assefaw H. Gebremedhin	1
Laxmikant V. Kalé	1
Arthur B. Maccabe	1
Hermann Hellwagner	1
Alex Pothen	1
Josep Torrellas	1
Lawrence Rauchwerger	1
Kamesh Madduri	1
Mike Stonebraker	1
Franz Franchetti	1
Mark A. Stalzer	1
Jesper Larsson Träff	1
Madha V. Marathe	1
Thomas Huckle	1
Hans‐Joachim Bungartz	1
Jon Berry	1
Tai-Ching Tuan	1
Jeremy Kepner	1
Joseph E. Gonzalez	1
Piotr Łuszczek	1
Andrew Lumsdaine	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Interesting Multi-relational Patterns	2011	Eirini Spyropoulou Tijl De Bie	3
+	A space efficient streaming algorithm for triangle counting using the birthday paradox	2013	Madhav Jha C. Seshadhri Ali Pınar	2
+ PDF Chat	A subquadratic triad census algorithm for large sparse networks with small maximum degree	2001	Vladimir Batagelj Andrej Mrvar	2
+	Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study	2005	Thomas Schank Dorothea Wagner	2
+	Scalable iterative solution of sparse linear systems	1994	Mark T. Jones Paul E. Plassmann	1
+	A Parallel Graph Coloring Heuristic	1993	Mark T. Jones Paul E. Plassmann	1
+	Estimation of Sparse Jacobian Matrices and Graph Coloring Blems	1983	Thomas F. Coleman Jorge J. Morè	1
+	New Acyclic and Star Coloring Algorithms with Application to Computing Hessians	2007	Assefaw H. Gebremedhin Arijit Tarafdar Fredrik Manne Alex Pothen	1
+ PDF Chat	On Tensors, Sparsity, and Nonnegative Factorizations	2012	C. Eric Tamara G. Kolda	1
+	Parallelizing and optimizing sparse tensor computations	2014	Muthu Manikandan Baskaran Benoît Meister Richard Lethin	1
+	Low-overhead load-balanced scheduling for sparse tensor computations	2014	Muthu Manikandan Baskaran Benoît Meister Richard Lethin	1
+ PDF Chat	A Randomized Algorithm for Principal Component Analysis	2009	Vladimir Rokhlin Arthur Szlam Mark Tygert	1
+	Numerics of Gram-Schmidt orthogonalization	1994	Åke Björck	1
+	A randomized algorithm for the decomposition of matrices	2010	Per‐Gunnar Martinsson Vladimir Rokhlin Mark Tygert	1
+	GigaTensor	2012	U Kang Evangelos E. Papalexakis Abhay Harpale Christos Faloutsos	1
+ PDF Chat	Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions	2011	Nathan Halko Per‐Gunnar Martinsson Joel A. Tropp	1
+ PDF Chat	Efficient subgraph matching on billion node graphs	2012	Zhao Sun Hongzhi Wang Haixun Wang Bin Shao Jianzhong Li	1
+ PDF Chat	MultiAspectForensics: Pattern Mining on Large-Scale Heterogeneous Networks with Tensor Analysis	2011	Koji Maruhashi Fan Guo Christos Faloutsos	1
+	A Randomized Algorithm for the Approximation of Matrices	2006	Per‐Gunnar Martinsson Vladimir Rockhlin Mark Tygert	1
+	Why Almost All k-Colorable Graphs Are Easy to Color	2009	Amin Coja‐Oghlan Michael Krivelevich Dan Vilenchik	1
+ PDF Chat	Estimation of sparse hessian matrices and graph coloring problems	1984	Thomas F. Coleman Jorge J. Morè	1
+	Fast triangle counting through wedge sampling.	2012	C. Seshadhri Ali Pınar Tamara G. Kolda	1
+	Efficient and scalable computations with sparse tensors	2012	Muthu Manikandan Baskaran Benoît Meister Nicolas Vasilache Richard Lethin	1
+	Memory-efficient parallel tensor decompositions	2017	Muthu Manikandan Baskaran Tom Henretty Benoît Pradelle M. Harper Langston David Bruns-Smith James Ezick Richard Lethin	1
+	All-at-once Decomposition of Coupled Billion-scale Tensors in Apache Spark	2018	Aditya Gudibanda Tom Henretty Muthu Manikandan Baskaran James Ezick Richard Lethin	1
+	A randomized algorithm for principal component analysis	2008	Vladimir Rokhlin Arthur Szlam Mark Tygert	1
+	Fast and Scalable Distributed Tensor Decompositions	2019	Muthu Manikandan Baskaran Thomas Henretty James Ezick	1
+	MalSpot: Multi2 Malicious Network Behavior Patterns Analysis	2014	Hing-Hao Mao Chung‐Jung Wu Evangelos E. Papalexakis Christos Faloutsos Kuo-Chen Lee Tien-Cheu Kao	1
+ PDF Chat	What Color Is Your Jacobian? Graph Coloring for Computing Derivatives	2005	Assefaw H. Gebremedhin Fredrik Manne Alex Pothen	1
+ PDF Chat	Randomized algorithms for the low-rank approximation of matrices	2007	Edo Liberty Franco Woolfe Per‐Gunnar Martinsson Vladimir Rokhlin Mark Tygert	1
+	A randomized algorithm for a tensor-based generalization of the singular value decomposition	2006	Petros Drineas Michael W. Mahoney	1