| Approaching optimality for solving SDD linear systems I Koutis, GL Miller, R Peng Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on …, 2010 | 360* | 2010 |
| A nearly-mlogn time solver for SDD linear systems I Koutis, GL Miller, R Peng Proceedings of the 2011 IEEE 52st Annual Symposium on Foundations of …, 2011 | 307 | 2011 |
| Faster algebraic algorithms for path and packing problems I Koutis Automata, Languages and Programming, 575-586, 2008 | 228 | 2008 |
| Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing I Koutis, GL Miller, D Tolliver Computer Vision and Image Understanding, 2011 | 186 | 2011 |
| Limits and applications of group algebras for parameterized problems I Koutis, R Williams Automata, Languages and Programming, 653-664, 2009 | 158* | 2009 |
| Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation CE Tsourakakis, P Drineas, E Michelakis, I Koutis, C Faloutsos Social Network Analysis and Mining, 1-7, 2011 | 106* | 2011 |
| Faster spectral sparsification and numerical algorithms for SDD matrices I Koutis, A Levin, R Peng ACM Transactions on Algorithms (TALG) 12 (2), 1-16, 2015 | 94* | 2015 |
| Near linear-work parallel sdd solvers, low-diameter decomposition, and low-stretch subgraphs GE Blelloch, A Gupta, I Koutis, GL Miller, R Peng, K Tangwongsan Proceedings of the 23rd ACM symposium on Parallelism in algorithms and …, 2011 | 82 | 2011 |
| On fully dynamic graph sparsifiers I Abraham, D Durfee, I Koutis, S Krinninger, R Peng 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 76 | 2016 |
| Simple parallel and distributed algorithms for spectral graph sparsification I Koutis, SC Xu ACM Transactions on Parallel Computing (TOPC) 3 (2), 1-14, 2016 | 70 | 2016 |
| Simple and scalable constrained clustering: a generalized spectral method M Cucuringu, I Koutis, S Chawla, G Miller, R Peng Artificial Intelligence and Statistics, 445-454, 2016 | 68* | 2016 |
| A linear work, O (n 1/6) time, parallel algorithm for solving planar Laplacians I Koutis, GL Miller Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007 | 66 | 2007 |
| A faster parameterized algorithm for set packing I Koutis Information Processing Letters 94 (1), 7-9, 2005 | 56 | 2005 |
| A fast solver for a class of linear systems I Koutis, GL Miller, R Peng Communications of the ACM 55 (10), 99-107, 2012 | 54 | 2012 |
| Spanning edge centrality: Large-scale computation and applications C Mavroforakis, R Garcia-Lebron, I Koutis, E Terzi Proceedings of the 24th international conference on world wide web, 732-742, 2015 | 48 | 2015 |
| Improved large-scale graph learning through ridge spectral sparsification D Calandriello, A Lazaric, I Koutis, M Valko International Conference on Machine Learning, 688-697, 2018 | 42 | 2018 |
| Algebraic fingerprints for faster algorithms I Koutis, R Williams Communications of the ACM 59 (1), 98-105, 2015 | 39 | 2015 |
| Constrained multilinear detection for faster functional motif discovery I Koutis Information Processing Letters 112 (22), 889-892, 2012 | 36 | 2012 |
| Graph partitioning into isolated, high conductance clusters: Theory, computation and applications to preconditioning I Koutis, GL Miller Proceedings of the twentieth annual symposium on Parallelism in algorithms …, 2008 | 35 | 2008 |
| Combinatorial and algebraic algorithms for optimal multilevel algorithms I Koutis PhD thesis, Carnegie Mellon University, Pittsburgh, 2007 | 30* | 2007 |
Gary L. MillerCarnegie Mellon University在 cs.cmu.edu 的电子邮件经过验证
