Ioannis Koutis

Citat de

	Toate	Din 2020
Referințe bibliografice	2478	882
h-index	23	17
i10-index	30	21

220

110

165

20072008200920102011201220132014201520162017201820192020202120222023202420258 14 36 63 108 99 158 157 199 169 166 164 210 167 145 157 174 199 39

Acces public

Afișați-le pe toate

17 articole

0 articole

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

Gary L. MillerCarnegie Mellon UniversityAdresă de e-mail confirmată pe cs.cmu.edu
Richard PengCarnegie Mellon UniversityAdresă de e-mail confirmată pe cs.cmu.edu
Christos FaloutsosCMUAdresă de e-mail confirmată pe cs.cmu.edu
Petros DrineasProfessor, Computer Science Department, Purdue UniversityAdresă de e-mail confirmată pe purdue.edu
Charalampos E. TsourakakisBoston UniversityAdresă de e-mail confirmată pe bu.edu
Guy BlellochProfessor of Computer Science, Carnegie Mellon UniversityAdresă de e-mail confirmată pe cs.cmu.edu
Kanat TangwongsanMahidol University International CollegeAdresă de e-mail confirmată pe mahidol.edu
sanjay chawlaQatar Computing Research Institute, HBKUAdresă de e-mail confirmată pe sydney.edu.au
Mihai CucuringuProfessor of Mathematics, UCLA; Department of Statistics, University of OxfordAdresă de e-mail confirmată pe math.ucla.edu
Richard Garcia-LebronUniversity of Texas at San AntonioAdresă de e-mail confirmată pe utsa.edu
Michal ValkoChief Models Officer @ Stealth Startup, Inria & MVA - Ex: Llama at Meta; Gemini and BYOL @ DeepmindAdresă de e-mail confirmată pe meta.com
Alessandro LazaricResearch Scientist, Facebook Artificial Intelligence ResearchAdresă de e-mail confirmată pe inria.fr
Daniele CalandrielloResearch Scientist, DeepMindAdresă de e-mail confirmată pe google.com
Ittai AbrahamIntelAdresă de e-mail confirmată pe cs.huji.ac.il
Shen Chen XuCarnegie Mellon UniversityAdresă de e-mail confirmată pe cs.cmu.edu
Andreas BjörklundAdresă de e-mail confirmată pe itu.dk
Evimaria TerziProfessor of Computer Science, Boston UniversityAdresă de e-mail confirmată pe cs.bu.edu
Charalampos MavroforakisFacebookAdresă de e-mail confirmată pe fb.com
Efstratios GallopoulosComputer Engineering and Informatics Department (CEID), University of Patras, GreeceAdresă de e-mail confirmată pe ceid.upatras.gr
Efi KokiopoulouSenior Research Scientist, GoogleAdresă de e-mail confirmată pe google.com

Urmăriți

Ioannis Koutis

New Jersey Institute of Technology

Adresă de e-mail confirmată pe njit.edu

Theoretical Computer Science


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
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	367*	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	302	2011
Faster algebraic algorithms for path and packing problems I Koutis Automata, Languages and Programming, 575-586, 2008	235	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	190	2011
Limits and applications of group algebras for parameterized problems I Koutis, R Williams Automata, Languages and Programming, 653-664, 2009	164*	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	114*	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
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	81	2016
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	79	2011
Simple parallel and distributed algorithms for spectral graph sparsification I Koutis, SC Xu ACM Transactions on Parallel Computing (TOPC) 3 (2), 1-14, 2016	73	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	70*	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 fast solver for a class of linear systems I Koutis, GL Miller, R Peng Communications of the ACM 55 (10), 99-107, 2012	58	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	57	2015
A faster parameterized algorithm for set packing I Koutis Information Processing Letters 94 (1), 7-9, 2005	54	2005
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	45	2018
Algebraic fingerprints for faster algorithms I Koutis, R Williams Communications of the ACM 59 (1), 98-105, 2015	40	2015
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	36	2008
Constrained multilinear detection for faster functional motif discovery I Koutis Information Processing Letters 112 (22), 889-892, 2012	35	2012
Model checking EM Clarke, EA Emerson, J Sifakis Communications of the ACM 52 (11), 74-84, 2009	34*	2009

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori