Ali Pinar
Ali Pinar üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Alıntı yapanlar
Alıntı yapanlar
Improving performance of sparse matrix-vector multiplication
A Pinar, MT Heath
SC'99: Proceedings of the 1999 ACM/IEEE Conference on Supercomputing, 30-30, 1999
Community structure and scale-free collections of Erdős-Rényi graphs
C Seshadhri, TG Kolda, A Pinar
Physical Review E 85 (5), 056109, 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
On identifying strongly connected components in parallel
LK Fleischer, B Hendrickson, A Pınar
International Parallel and Distributed Processing Symposium, 505-511, 2000
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
Triadic Measures on Graphs: The Power of Wedge Sampling
C Seshadhri, A Pinar, TG Kolda
arXiv preprint arXiv:1202.5230, 2012
A simulator for large-scale parallel computer architectures
CL Janssen, H Adalsteinsson, S Cranford, JP Kenny, A Pinar, ...
International Journal of Distributed Systems and Technologies (IJDST) 1 (2 …, 2010
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
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
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
Fast optimal load balancing algorithms for 1D partitioning
A Pınar, C Aykanat
Journal of Parallel and Distributed Computing 64 (8), 974-996, 2004
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
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
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
Identification of severe multiple contingencies in electric power networks
V Donde, V Lopez, B Lesieutre, A Pinar, C Yang, J Meza
Power Symposium, 2005. Proceedings of the 37th Annual North American, 59-66, 2005
Communication requirements and interconnect optimization for high-end scientific applications
S Kamil, L Oliker, A Pinar, J Shalf
IEEE Transactions on Parallel and Distributed Systems 21 (2), 188-202, 2009
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
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
Power system extreme event screening using graph partitioning
BC Lesieutre, S Roy, V Donde, A Pinar
2006 38th North American Power Symposium, 503-510, 2006
Reconfigurable hybrid interconnection for static and dynamic scientific applications
S Kamil, A Pinar, D Gunter, M Lijewski, L Oliker, J Shalf
Proceedings of the 4th international conference on Computing frontiers, 183-194, 2007
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20