Sandia National Laboratories
Ali Pinar
Home Page
Biography
Software

Ali Pinar's Publications

Journal Publications

  1. R. Chen, N. Fan, A. Pinar, and J. Watson, Contingency-Constrained Unit Commitment with Post-Contingency Corrective Recourse, Annals of Operations Research, 2014. preprint available as arXiv:1404.2964
  2. M. Jha, C. Seshadhri, and A. Pinar, A space efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox , in ACM Transactions on Knowledge Discovery from Data, Vol. 9, No: 3, preprint available as arXiv:1212.2264.
  3. J. Ray, A. Pinar, and C. Seshadhri, A stopping criterion for Markov chains when generating independent random graphs, Journal of Complex Networks 2014; also available as arXiv:1210.8184.
  4. T. Kolda, A. Pinar, T. Plantenga, and C. Seshadhri, A Scalable Generative Graph Model with Community Structure, SIAM J. Scientific Computing, Vol. 36, No. 5, pages: C424-C452, 2014 preprint available as arXiv:1302.6636
  5. C. Seshadhri, A. Pinar, and T. Kolda, Wedge Sampling for Computing Clustering Coefficients and Triangle Counts on Large Graphs, Statistical Analysis and Data Mining special issue for Best of SDM 2013, preprint available as arXiv:1309:3321>
  6. R. Chen, A. Cohn, N. Fan, and A. Pinar, Contingency-Risk Informed Power System Design, IEEE T. Power Systems, Vol. 29, No. 5, pages: 2087--2096, preprint available as arXiv:1305.0780
  7. T. Kolda, A.Pinar, T. Plantenga, C. Seshadhri, and C. Task, Counting Triangles in Massive Graphs with MapReduce, SIAM J. Scientific Computing, Vol. 36, No. 5, pages: S48-S77, preprint available as arXiv:1301.5887
  8. C. Seshadhri, A. Pinar, and T. Kolda, An In-Depth Analysis of Stochastic Kronecker Graphs Journal of the ACM, Vol. 60, No. 2, pages: 13:1-13:32, 2013
  9. M. Rocklin and A. Pinar, On Clustering of Graphs with Multiple Edge Types, Internet Mathematics Vol. 9, No. 1, pages: 82-112, 2013
  10. C. Seshadhri, T. Kolda, and A. Pinar, Community structure and scale-free collections of Erdos--Renyi graphs, Physical Review E, Vol. 85 No. 5, 2012
  11. I. Stanton and A. Pinar, Constructing and uniform sampling of graphs with prescribed joint degree distribution using Markov Chains in ACM Journal on Experimental Algorithmics, Vol. 17, No. 1, 2012
  12. E. Kayaaslan, A. Pinar, U. Catalyurek, and C. Aykanat, Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs, SIAM Journal on Scientific Computing Vol. 34, No.2, pages A970-A992, 2012
  13. C. Janssen, H. Adalsteinsson, S. Cranford, J. Kenny, A. Pinar, D. Evensky, and J. Mayo, A Simulator for Large-scale Parallel Computer Architectures International Journal of Distributed Systems and Technology, Vol. 1. No. 2, pages 57--73, 2010
  14. A. Pinar, J. Meza, V. Donde, and B. Lesieutre, Optimization Strategies for the Vulnerability Analysis of the Power Grid SIAM Journal on Optimization, Vol. 20, No. 4, pages 1786--1810, 2010.
  15. S. Kamil, L. Oliker, A. Pinar, and J. Shalf, Communication Requirements and Interconnect Optimization for High-End Scientific Applications IEEE Transactions on Parallel and Distributed Computing, Vol. 21, No. 2, pages 188--202, 2010.
  16. A. Pinar, E. Tabak, and C. Aykanat, One dimensional partitioning for heterogeneous systems} Journal of Parallel and Distributed Computing, Vol. 68, No. 11, pages 1473--1486, 2008.
  17. V. Donde, V. Lopez, B. Lesieutre, A. Pinar, C. Yang, and J. Meza, Severe Multiple Contingency Screening in Electric Power Systems IEEE Transactions on Power Systems, Vol. 23, No. 2, pages 406--417, 2008.
  18. A. Pinar, E. Chow, and A. Pothen, Combinatorial Techniques for Constructing Sparse Null-space Bases Electronic Transactions on Numerical Analysis, special volume on saddle point problems: numerical solution and applications, Vol. 22, pages 122--145, 2006.
  19. A. Pinar and B. Hendrickson, Improving Load Balance with Flexibly Assignable Tasks IEEE Transactions on Parallel and Distributed Systems, Vol. 16, No. 10, pages 956--965, 2005.
  20. A. Pinar and V. Vassilevska, Finding Nonoverlapping Substructures of a Sparse Matrix Electronic Transactions on Numerical Analysis, special volume on combinatorial scientific computing, Vol. 21, pages 107--124, 2005.
  21. A. Pinar and B. Hendrickson, Interprocessor Communication with Limited Memory IEEE Transactions on Parallel and Distributed Systems, Vol. 15, No. 7, pages 606--616, 2004.
  22. A. Pinar and C. Aykanat, Fast Optimal Load Balancing Algorithms for 1D Partitioning Journal of Parallel and Distributed Computing, Vol. 64, No. 8, pages 974--996, 2004.
  23. C. Aykanat, A. Pinar, and U. Catalyurek, Permuting Sparse Rectangular Matrices into Block-Diagonal Form SIAM Journal on Scientific Computing, Vol. 25, No. 6, pages 1860--1879, 2004.
  24. A. Pinar and C.L. Liu, Compacting Sequences with Invariant Transition Frequencies ACM Transactions on Design Automation of Electronic Systems, Vol. 8, No. 2, pages 214--221, 2003.

Pending Journal Publications

  1. Jianqiang Cheng, Richard L.-Y. Chen, Habib N. Najm, Ali Pinar, Cosmin Safta, and Jean-Paul~Watson, "Chance Constrained Economic Dispatch Problem with Renewable Energy and Energy Storage," submitted to IEEE T. Power Systems .
  2. Cosmin Safta, Richard L.-Y. Chen, Habib N. Najm, Ali Pinar, and Jean-Paul~Watson, "Efficient Uncertainty Quantification in Stochastic Economic Dispatch," submitted to IEEE T. Power Systems, preprint available as: arXiv:1508.04731.
  3. C. Quinn, A. Pinar, and N. Kiyavash, "Bounded Degree Approximations of Stochastic Networks," submitted to Journal of Machine Learning Research, preprint available as: arXiv:1506.04767
  4. J. Bennett, A. Bhagatwala, J. Chen, C. Seshadhri, A. Pinar, and M. Salloum, "Trigger Detection for Adaptive Scientific Workflows Using Percentile Sampling," submitted to SIAM Journal on Scientific Computing, preprint available as: arXiv:1506.08258
  5. C. Seshadhri, A. Pinar, N. Durak, and T. Kolda, Directed closure measures for networks with reciprocity, submitted; available as: arXiv:1302:6220

Book Chapter

  1. C. Seshadhri, A. Pinar, D. Thompson, and J. Bennett, Sublinear Algorithms for Extreme-scale Data Analysis, Topological and Statistical Methods for Complex Data: Tackling Large-Scale, High-Dimensional, and Multivariate Data Sets, editors: J. Bennett, F. Vivodtzev, and V. Pascucci, Springer, 2014.
  2. A. Pinar and B. Hendrickson, Combinatorial Parallel and Scientific Computing chapter in Parallel Processing for Scientific Computing, editors: M. Heroux, P. Raghavan, and H. Simon, SIAM, 2006.

Refereed Conference Publications

  1. G. Ballard, T. Kolda, A. Pinar, and C. Seshadhri, "Diamond Sampling for Approximate Maximum All-pairs Dot-product (MAD) Search," to appear in ICDM 2015; preprint available as arXiv:1506:03872.Best Paper Prize
  2. Maher Salloum, Janine C. Bennett, Ali Pinar, Ankit Bhagatwala, Jacqueline H. Chen, Enabling adaptive scientific workflows via trigger detection, to appear in Proc. ISAV 2015: In Situ Infrastructures for Enabling Extreme-scale Analysis and Visualization , 2015; preprint available as: arXiv:1508.04731
  3. E. Sariyuce, C. Seshadhri, A. Pinar, and U. Catalyurek, Finding Overlapping and Hierarchical Dense Subgraphs using Nuclear Decompositions, Proc. WWW 2015, pages 927--937, 2015; preprint available as arXiv:1411.4942 . Best Paper Prize finalist
  4. M. Jha, A. Pinar, and C. Seshadhri, Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts," Proc. WWW 2015; pages 495--505, 2015; preprint available as arXiv:1411.3312 .
  5. M. Jha, C. Seshadhri, and A. Pinar, ``Counting Triangles in Real-World Graph Streams: Dealing with Repeated Edges and Time Windows," to appear in Proc. Asilomar 2015. preprint available as arXiv:1310:7665 , 2014.
  6. C. Safta, R. Chen, H. Najm, A. Pinar, and J. Watson, Toward Using Surrogates to Accelerate Solution of Stochastic Electricity Grid Operations Problems," in Proc. 47th North American Power Symposium, Pullman, WA, September 2014; preprint available as arXiv:1407.2232.
  7. D. Thompson, J. Bennett, C. Seshadhri, and A. Pinar, A provably-robust sampling method for generating colormaps of large data, Proc. IEEE Symposium on Large-Scale Data Analysis and Visualization (LDAV), 2013.
  8. K. Subbian, A. Singhal, T. Kolda, A. Pinar, and J. Srivastava, Dynamics of Trust Reciprocation in Multi-Relational Networks, Proc. the IEEE/ACM International Conference on Social Networks Analysis and Mining (ASONAM~2013), preprint available as arXiv:1303.6385
  9. M. Jha, C. Seshadhri, and A. Pinar, A Space Efficient Streaming Algorithm for Triangle Counting using the Birthday Paradox, Proc. KDD 13 Best Student Paper Prize
  10. K. Subbian, A. Singhal, T. Kolda, A. Pinar, and J. Srivastava, Dynamics of Trust Reciprocation in Multi-Relational Networks, Proc. the IEEE/ACM International Conference on Social Networks Analysis and Mining (ASONAM~2013), preprint available as arXiv:1303.6385
  11. C. Quinn, A. Pinar, and N. Kiyavash, Optimal Bounded-Degree Approximations of Joint Distributions of Networks of Stochastic Processes, Proc. IEEE International Symposium on Information Theory(ISIT 13), 2013.
  12. N. Durak, T. Kolda, A. Pinar, and C. Seshadhri, A Scalable Null Model to Match All Degree Distributions: In, Out, and Reciprocal, Proc. Second IEEE W. Network Science; preprint available as arXiv:1210.5288
  13. C. Seshadhri, A. Pinar, and T. Kolda, Triadic Measures on Graphs: The Power of Wedge Sampling, Proc. SIAM Data Mining, 2013, preprint available as arXiv:1202.5230 Best Paper Prize
  14. N. Durak, A. Pinar, T. Kolda, C. Seshadhri, The degree relations of triangles in real-world networks and graph models, Proc. CIKM 12 preprint available as arXiv:1207.7125
  15. J. Ray, A. Pinar, and C. Sehadhri, Are we there yet? When to stop a Markov chain while generating random graphs Proc. WAW12
  16. R. Chen, A. Cohn, N. Fan, and A. Pinar, N-k-\epsilon Survivable Power System Design to appear in 12th International Conference on Probabilistic Methods Applied to Power Systems (PMAPS12).
  17. A. Pinar, C. Seshadhri, and T. Kolda, The Similarity of Stochastic Kronecker Graphs to Edge-Configuration Models Proc. SIAM Data Mining, 2012
  18. C. Seshadhri, A. Pinar, and T. Kolda, An In-Depth Study of Stochastic Kronecker Graphs Proc. ICDM 2011.
  19. R. Chen, A. Cohn, and A. Pinar, An Implicit Optimization Approach for Survivable Network Design Proc. 2011 IEEE First International Network Science Workshop (NSW 2011) .
  20. M. Rocklin and A. Pinar, Latent Clustering on Graphs with Multiple Edge Types Proc. 8th Workshop on Algorithms and Models for the Web Graph (WAW11).
  21. I. Stanton and A. Pinar, Constructing and sampling graphs with prescribed joint degree distribution using Markov Chains Proc. ALENEX 11 .
  22. M. Rocklin and A. Pinar, Computing an Aggregate Edge-weight function for Clustering Graphs with Multiple Edge Types, in Proc. 7th Workshop on Algorithms and Models for the Web Graph (WAW10) .
  23. B. Lesieutre, A. Pinar, and S. Roy, Power System Extreme Event Detection: The Vulnerability Frontier in Proc. 41st Hawaii International Conference on System Sciences, pages 184, Waikoloa, Big Island, HI, 2008.
  24. S. Kamil, A. Pinar, D. Gunter, M. Lijewski, L. Oliker, and J. Shalf, Reconfigurable hybrid interconnection for static and dynamic scientific applications Proc. of the 4th International Conference on Computing Frontiers, pages 183--195, Ischia, Italy, 2007.
  25. A. Pinar, A. Reichert, and B. Lesieutre, Computing Criticality of Lines in a Power System Proc. 2007 IEEE International Symposium on Circuits and Systems, pages 65--68, New Orleans, LA, May 2007.
  26. B. Lesieutre, S. Roy, V. Donde, and A. Pinar, Power system extreme event analysis using graph partitioning Proc. 39th North American Power Symposium, Carbondale, IL, October 2006.
  27. A. Pinar, T. Tao, and H. Ferhatosmanoglu, Compressing Bitmap Indices by Data Reorganization Proc. 21st International Conference on Data Engineering (ICDE05), pages 310--321.
  28. V. Donde, V. Lopez, B. Lesieutre, A. Pinar, C. Yang, and J. Meza, Identification of severe multiple contingencies in electric power networks Proc. 38th North American Power Symposium, Ames, IA, October 2005.
  29. A. Pinar and B. Hendrickson, Exploiting Flexibly Assignable Work to Improve Load Balance Proc. ACM 14th Symp. Parallel Algorithms and Architectures (SPAA) 2002, pages 155--163.
  30. A. Pinar and B. Hendrickson, Graph Partitioning for Complex Objectives Proc. 15th International Parallel and Distributed Processing Symp. (IPDPS), IEEE, 2001.
  31. A. Pinar and B. Hendrickson, Communication Support for Adaptive Computation in Proc. SIAM Conf. on Parallel Processing for Scientific Computing, 2001.
  32. A. Pinar and B. Hendrickson, Interprocessor Communication with Memory Constraints Proc. ACM Symp. Parallel Algorithms and Architectures (SPAA) 2000, pages 39--45.
  33. L. Fleischer, B. Hendrickson, and A. Pinar, On Identifying Strongly Connected Components in Parallel Lecture Notes in Computer Science, Vol. 1586, pages 505--511.
  34. A. Pinar and M. Heath, Improving Performance of Sparse Matrix-Vector Multiplication Proc. Supercomputing 99, 1999.
  35. A. Pinar and C.L. Liu, Power Invariant Vector Sequence Compaction Proc. 1998 IEEE/ACM International Conf. Computer Aided Design, pages 473--476, 1998.
  36. A. Pinar and C. Aykanat, Sparse Matrix Decomposition with Optimal Load Balancing Proc. International Conf. High Performance Computing (HiPC) 97, pages 224--229, 1997.
  37. A. Pinar and C. Aykanat, An Effective Model to Decompose Linear Programs for Parallel Solution Lecture Notes in Computer Science, Vol. 1184, pages 592--601.
  38. A. Pinar, U. Catalyurek, C. Aykanat, and M. Pinar, Decomposing Linear Programs for Parallel Solution Lecture Notes in Computer Science, Vol. 1041, pages 473--482.
  39. A. Pinar, " A New Genetic Algorithm for Hypergraph Partitioning, " Proc. Turkish Artificial Intelligence and Neural Networks Symp. (TAINN) 96 pages 167--176, 1996.
  40. A. Pinar and U. Cetintemel, " Wide-Area Distributed Selective Dissemination of Information, " Proc. Tenth International Symp. on Computer and Information Sciences (ISCIS), pages 281--288, 1995.

Other Publications

  1. C. Peng, T. Kolda, and A. Pinar, Accelerating Community Detection by Using k-core subgraphs, arXiv:1403.2226
  2. D. Brown, P. Messina, D. Keyes, J. Morrison, R. Lucas, J. Shalf, P. Beckman, R. Brightwell, A. Geist, J. Vetter, B. Chamberlain, E. Lusk, J,. Bell, M. Shephard, M. Anitescu, D. Estep, B. Hendrickson, A. Pinar, and M. Heroux, Scientific grand challenges: Crosscutting technologies for computing at the exascale, Tech. report, Pacific Northwest National Laboratory, PNNL-20168, February, 2010.
  3. F. Alexander, M. Anitescu, J. Bell, D. Brown, M. Ferris, M. Luskin, S. Mehrotra, B. Moser, A. Pinar, A. Tartakovsky, K. Willcox, S. Wright, and V. Zavala, A Multifaceted Mathematical Approach for Complex Systems, DOE Office of Advanced Scientific Computing Research.
  4. E. Otoo, A. Pinar, and D. Rotem, A Linear Approximation Algorithm for 2-Dimensional Vector Packing arXiv:1103.0260.
  5. S. Poon, A. Pinar, C. Aragon, and P. Nugent, ``Time-Domain Visual Analytics for Astronomical Scheduling , Sandia Technical Report 5282050, 2010.
  6. E. Otoo, A. Pinar, D. Rotem, and S. C. Tsao, A File Allocation Strategy for Energy-Efficient Disk Storage Systems, Technical Report: LBNL-637E, Lawrence Berkeley National Laboratory, Berkeley, CA.
  7. A. Pinar, Y. Fogel, and B. Lesieutre, The Inhibiting Bisection Problem, Technical Report: LBNL-62142, Lawrence Berkeley National Laboratory, Berkeley, CA.
  8. P. Cesarz, G. Pomann, L. Torre, G. Villarosa, T. Flournoy, A. Pinar, and J. Meza, ``Detecting Network Vulnerabilities Through Graph Theoretical Methods, Technical Report: LBNL-63487, Lawrence Berkeley National Laboratory, Berkeley, CA.
  9. D. Coppersmith, L. Fleischer, B. Hendrickson, and A. Pinar, A Divide-and-conquer Algorithm for Identifying Strongly Connected Components in Parallel, IBM Technical Report RC23744, 2005.
  10. A. Pinar, High Performance Combinatorial Algorithms, Technical Report: LBNL- 53989, Lawrence Berkeley National Laboratory, Berkeley, CA.
  11. A. Pinar, M. Singh, and E. Ng, Nested Dissection Orderings for LU Factorization of Unsymmetric Matrices with Static Pivoting, extended abstract in Proc. SIAM Workshop on Combinatorial Scientific Computing.
  12. A. Pinar, Combinatorial Algorithms in Scientific Computing, PhD. Thesis, University of Illinois at Urbana-Champaign, July 2001.
  13. A. Pinar, Decomposing Linear Programs for Parallel Solution, M.S. Thesis, Bilkent University, Ankara, Turkey, July 1996.

Top of page

Ali's Photo


Contact
Ali Pinar
(apinar--sandia--gov)
Phone: (925) 294 4683
Fax: (925) 294 2234

Google Scholar Profile
Publications on arXiv
Twitter: @alipinar9