| Higher-order organization of complex networks AR Benson, DF Gleich, J Leskovec Science 353 (6295), 163-166, 2016 | 569 | 2016 |
| Motifs in temporal networks A Paranjape, AR Benson, J Leskovec Proceedings of the Tenth ACM International Conference on Web Search and Data …, 2017 | 307 | 2017 |
| Local higher-order graph clustering H Yin, AR Benson, J Leskovec, DF Gleich Proceedings of the 23rd ACM SIGKDD international conference on knowledge …, 2017 | 294 | 2017 |
| Simplicial closure and higher-order link prediction AR Benson, R Abebe, MT Schaub, A Jadbabaie, J Kleinberg Proceedings of the National Academy of Sciences 115 (48), E11221-E11230, 2018 | 117 | 2018 |
| Tensor spectral clustering for partitioning higher-order network structures AR Benson, DF Gleich, J Leskovec Proceedings of the 2015 SIAM International Conference on Data Mining, 118-126, 2015 | 94 | 2015 |
| Silent error detection in numerical time-stepping schemes AR Benson, S Schmit, R Schreiber The International Journal of High Performance Computing Applications 29 (4 …, 2015 | 83 | 2015 |
| A framework for practical parallel fast matrix multiplication AR Benson, G Ballard ACM SIGPLAN Notices 50 (8), 42-53, 2015 | 78 | 2015 |
| Direct QR factorizations for tall-and-skinny matrices in MapReduce architectures AR Benson, DF Gleich, J Demmel 2013 IEEE international conference on big data, 264-272, 2013 | 64 | 2013 |
| The spacey random walk: A stochastic process for higher-order data AR Benson, DF Gleich, LH Lim SIAM Review 59 (2), 321-345, 2017 | 63 | 2017 |
| Modeling user consumption sequences AR Benson, R Kumar, A Tomkins Proceedings of the 25th International Conference on World Wide Web, 519-529, 2016 | 61 | 2016 |
| Higher-order clustering in networks H Yin, AR Benson, J Leskovec Physical Review E 97 (5), 052306, 2018 | 50 | 2018 |
| General tensor spectral co-clustering for higher-order data T Wu, AR Benson, DF Gleich arXiv preprint arXiv:1603.00395, 2016 | 46 | 2016 |
| Neural Jump Stochastic Differential Equations J Jia, AR Benson arXiv preprint arXiv:1905.10403, 2019 | 43 | 2019 |
| Random walks on simplicial complexes and the normalized Hodge 1-Laplacian MT Schaub, AR Benson, P Horn, G Lippner, A Jadbabaie SIAM Review 62 (2), 353-391, 2020 | 41 | 2020 |
| Scalable methods for nonnegative matrix factorizations of near-separable tall-and-skinny matrices AR Benson, JD Lee, B Rajwa, DF Gleich arXiv preprint arXiv:1402.6964, 2014 | 34 | 2014 |
| On the relevance of irrelevant alternatives AR Benson, R Kumar, A Tomkins Proceedings of the 25th International Conference on World Wide Web, 963-973, 2016 | 32 | 2016 |
| Improving the numerical stability of fast matrix multiplication G Ballard, AR Benson, A Druinsky, B Lipshitz, O Schwartz SIAM Journal on Matrix Analysis and Applications 37 (4), 1382-1418, 2016 | 31 | 2016 |
| Three hypergraph eigenvector centralities AR Benson SIAM Journal on Mathematics of Data Science 1 (2), 293-312, 2019 | 27 | 2019 |
| Choosing to grow a graph: Modeling network formation as discrete choice J Overgoor, A Benson, J Ugander The World Wide Web Conference, 1409-1420, 2019 | 26 | 2019 |
| Sampling methods for counting temporal motifs P Liu, AR Benson, M Charikar Proceedings of the Twelfth ACM International Conference on Web Search and …, 2019 | 24* | 2019 |
David GleichPurdue UniversityVerified email at purdue.edu
