Ali Pinar
Ali Pinar
Computer Scientist
Verified email at
Cited by
Cited by
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
Improving performance of sparse matrix-vector multiplication
A Pinar, MT Heath
Proceedings of the 1999 ACM/IEEE conference on Supercomputing, 30-es, 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
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
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
Triadic Measures on Graphs: The Power of Wedge Sampling
C Seshadhri, A Pinar, TG Kolda
arXiv preprint arXiv:1202.5230, 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
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
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
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
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
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
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
Fast optimal load balancing algorithms for 1D partitioning
A Pınar, C Aykanat
Journal of Parallel and Distributed Computing 64 (8), 974-996, 2004
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
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
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
Fast hierarchy construction for dense subgraphs
AE Sariyuce, A Pinar
arXiv preprint arXiv:1610.01961, 2016
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
Local algorithms for hierarchical dense subgraph discovery
AE Sariyuce, C Seshadhri, A Pinar
arXiv preprint arXiv:1704.00386, 2017
The system can't perform the operation now. Try again later.
Articles 1–20