Ali Pinar

Dikutip oleh

	Semua	Sejak 2020
Kutipan	5996	2401
indeks-h	40	28
indeks-i10	82	60

520

260

130

390

20022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202517 17 34 42 55 61 75 88 133 145 204 266 313 336 390 415 463 434 512 498 471 460 403 57

Akses publik

Lihat semua

90 artikel

3 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

C. SeshadhriUniversity of California, Santa CruzEmail yang diverifikasi di ucsc.edu
Tamara G. KoldaMathSci.ai (independent consulting)Email yang diverifikasi di mathsci.ai
Ümit V. ÇatalyürekProfessor, Computational Science and Engineering, Georgia Institute of TechnologyEmail yang diverifikasi di gatech.edu
A. Erdem SariyuceAssociate Professor, Computer Science & Engineering, University at BuffaloEmail yang diverifikasi di buffalo.edu
Madhav JhaSandia National LabsEmail yang diverifikasi di sandia.gov
Cevdet AykanatProfessor of Computer Engineering, Bilkent UniversityEmail yang diverifikasi di cs.bilkent.edu.tr
Bruce HendricksonLawrence Livermore National LaboratoryEmail yang diverifikasi di llnl.gov
Bernie LesieutreUniversity of Wisconsin-MadisonEmail yang diverifikasi di wisc.edu
Jean-Paul WatsonLawrence Livermore National Laboratory, Livermore, California, USAEmail yang diverifikasi di llnl.gov
Cosmin SaftaSandia National LabsEmail yang diverifikasi di sandia.gov
Habib NajmSandia National LaboratoriesEmail yang diverifikasi di sandia.gov
Sucheta SoundarajanSyracuse UniversityEmail yang diverifikasi di syr.edu
Tina Eliassi-RadProfessor & The Inaugural Joseph E. Aoun Chair, Northeastern UniversityEmail yang diverifikasi di eliassi.org
Nurcan DurakPostdoctoral Researcher, Sandia National LabsEmail yang diverifikasi di sandia.gov
Cynthia PhillipsLaboratory Fellow, Sandia National Laboratories, Albuquerque, NMEmail yang diverifikasi di sandia.gov
Jaideep RaySandia National LaboratoriesEmail yang diverifikasi di sandia.gov
Juan C. MezaProfessor of Applied Mathematics, UC MercedEmail yang diverifikasi di ucmerced.edu
Joseph P. KennySandia National LaboratoriesEmail yang diverifikasi di sandia.gov
Amy CohnProfessor of Industrial and Operations Engineering, University of MichiganEmail yang diverifikasi di umich.edu
Janine C. BennettSandia National LaboratoriesEmail yang diverifikasi di sandia.gov

Ikuti

Ali Pinar

Computer Scientist

Email yang diverifikasi di llnl.gov

Graph mining cyber analytics combinatorial scientific computing


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
Community structure and scale-free collections of Erdős-Rényi graphs C Seshadhri, TG Kolda, A Pinar Physical Review E—Statistical, Nonlinear, and Soft Matter Physics 85 (5 …, 2012	365	2012
Improving performance of sparse matrix-vector multiplication A Pinar, MT Heath Proceedings of the 1999 ACM/IEEE conference on Supercomputing, 30-es, 1999	361	1999
On identifying strongly connected components in parallel LK Fleischer, B Hendrickson, A Pınar Parallel and Distributed Processing: 15 IPDPS 2000 Workshops Cancun, Mexico …, 2000	218	2000
Escape: Efficiently counting all 5-vertex subgraphs A Pinar, C Seshadhri, V Vishal Proceedings of the 26th international conference on world wide web, 1431-1440, 2017	216	2017
A scalable generative graph model with community structure TG Kolda, A Pinar, T Plantenga, C Seshadhri SIAM Journal on Scientific Computing 36 (5), C424-C452, 2014	207	2014
Triadic Measures on Graphs: The Power of Wedge Sampling C Seshadhri, A Pinar, TG Kolda arXiv preprint arXiv:1202.5230, 2012	202*	2012
Permuting sparse rectangular matrices into block-diagonal form C Aykanat, A Pinar, ÜV Çatalyürek SIAM Journal on scientific computing 25 (6), 1860-1879, 2004	196	2004
A simulator for large-scale parallel computer architectures CL Janssen, H Adalsteinsson, S Cranford, JP Kenny, A Pinar, ... Technology Integration Advancements in Distributed Systems and Computing …, 2012	190	2012
Optimization strategies for the vulnerability analysis of the electric power grid A Pinar, J Meza, V Donde, B Lesieutre SIAM Journal on Optimization 20 (4), 1786-1810, 2010	188	2010
Path sampling: A fast and provable method for estimating 4-vertex subgraph counts M Jha, C Seshadhri, A Pinar Proceedings of the 24th international conference on world wide web, 495-505, 2015	179	2015
A space efficient streaming algorithm for triangle counting using the birthday paradox M Jha, C Seshadhri, A Pinar Proceedings of the 19th ACM SIGKDD international conference on Knowledge …, 2013	178	2013
Finding the hierarchy of dense subgraphs using nucleus decompositions AE Sariyuce, C Seshadhri, A Pinar, UV Catalyurek proceedings of the 24th international conference on world wide web, 927-937, 2015	171	2015
Severe multiple contingency screening in electric power systems V Donde, V López, B Lesieutre, A Pinar, C Yang, J Meza IEEE Transactions on Power Systems 23 (2), 406-417, 2008	166	2008
Fast optimal load balancing algorithms for 1D partitioning A Pınar, C Aykanat Journal of Parallel and Distributed Computing 64 (8), 974-996, 2004	151	2004
Peeling bipartite networks for dense subgraph discovery AE Sarıyüce, A Pinar Proceedings of the Eleventh ACM International Conference on Web Search and …, 2018	119	2018
Counting triangles in massive graphs with MapReduce TG Kolda, A Pinar, T Plantenga, C Seshadhri, C Task SIAM Journal on Scientific Computing 36 (5), S48-S77, 2014	108	2014
Constructing and uniform sampling of graphs with prescribed joint degree distribution using Markov Chains I Stanton, A Pinar ACM Journal on Experimental Algorithmics 17 (1), 2012	99*	2012
Fast hierarchy construction for dense subgraphs AE Sariyuce, A Pinar arXiv preprint arXiv:1610.01961, 2016	96	2016
Local algorithms for hierarchical dense subgraph discovery AE Sariyuce, C Seshadhri, A Pinar arXiv preprint arXiv:1704.00386, 2017	95*	2017
Measuring and modeling bipartite graphs with community structure SG Aksoy, TG Kolda, A Pinar Journal of Complex Networks 5 (4), 581-603, 2017	94	2017

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama