☰

Ali Pinar, Ph.D. - Publications

Affiliations: 
2001 University of Illinois, Urbana-Champaign, Urbana-Champaign, IL 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

37 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2018 Cheng J, Li-Yang Chen R, Najm HN, Pinar A, Safta C, Watson J. Distributionally Robust Optimization with Principal Component Analysis Siam Journal On Optimization. 28: 1817-1841. DOI: 10.1137/16M1075910  0.362
2018 Cheng J, Chen RL, Najm HN, Pinar A, Safta C, Watson J. Chance-constrained economic dispatch with renewable energy and storage Computational Optimization and Applications. 70: 479-502. DOI: 10.1007/S10589-018-0006-2  0.319
2017 Sariyüce AE, Seshadhri C, Pinar A, Çatalyürek ÜV. Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs Acm Transactions On the Web. 11: 1-27. DOI: 10.1145/3057742  0.426
2017 Safta C, Chen RL, Najm HN, Pinar A, Watson J. Efficient Uncertainty Quantification in Stochastic Economic Dispatch Ieee Transactions On Power Systems. 32: 2535-2546. DOI: 10.1109/Tpwrs.2016.2615334  0.325
2017 Quinn CJ, Pinar A, Kiyavash N. Bounded-Degree Connected Approximations of Stochastic Networks Ieee Transactions On Molecular, Biological and Multi-Scale Communications. 3: 79-88. DOI: 10.1109/Tmbmc.2017.2686387  0.358
2017 Quinn CJ, Pinar A, Gao J, Su L. Robust Sparse Approximations for Stochastic Dynamical Systems Ifac-Papersonline. 50: 14010-14015. DOI: 10.1016/J.Ifacol.2017.08.2423  0.342
2016 Aksoy SG, Kolda TG, Pinar A. Measuring and modeling bipartite graphs with community structure Journal of Complex Networks. 5: 581-603. DOI: 10.1093/Comnet/Cnx001  0.413
2015 Jha M, Seshadhri C, Pinar A. Path Sampling: A fast and provable method for estimating 4-Vertex Subgraph Counts Www 2015 - Proceedings of the 24th International Conference On World Wide Web. 495-505. DOI: 10.1145/2736277.2741101  0.323
2015 Jha M, Seshadhri C, Pinar A. A space-efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox Acm Transactions On Knowledge Discovery From Data. 9: 15. DOI: 10.1145/2700395  0.414
2015 Ray J, Pinar A, Seshadhri C. A stopping criterion for Markov chains when generating independent random graphs Journal of Complex Networks. 3: 204-220. DOI: 10.1093/Comnet/Cnu041  0.39
2014 Kolda TG, Pinar A, Plantenga T, Seshadhri C. A scalable generative graph model with community structure Siam Journal On Scientific Computing. 36: C424-C452. DOI: 10.1137/130914218  0.428
2014 Kolda TG, Pinar A, Plantenga T, Seshadhri C, Task C. Counting triangles in massive graphs with mapreduce Siam Journal On Scientific Computing. 36: S48-S77. DOI: 10.1137/13090729X  0.427
2014 Chen RLY, Cohn A, Fan N, Pinar A. Contingency-risk informed power system design Ieee Transactions On Power Systems. 29: 2087-2096. DOI: 10.1109/Tpwrs.2014.2301691  0.372
2014 Chen RLY, Fan N, Pinar A, Watson JP. Contingency-constrained unit commitment with post-contingency corrective recourse Annals of Operations Research. DOI: 10.1007/S10479-014-1760-X  0.377
2014 Seshadhri C, Pinar A, Kolda TG. Wedge sampling for computing clustering coefficients and triangle counts on large graphs Statistical Analysis and Data Mining. 7: 294-307. DOI: 10.1002/Sam.11224  0.398
2013 Seshadhri C, Pinar A, Kolda TG. An in-depth analysis of stochastic Kronecker graphs Journal of the Acm. 60. DOI: 10.1145/2450142.2450149  0.418
2013 Durak N, Kolda TG, Pinar A, Seshadhri C. A scalable null model for directed graphs matching all degree distributions: In, out, and reciprocal Proceedings of the 2013 Ieee 2nd International Network Science Workshop, Nsw 2013. 23-30. DOI: 10.1109/NSW.2013.6609190  0.339
2013 Rocklin M, Pinar A. On clustering on graphs with multiple edge types Internet Mathematics. 9: 82-112. DOI: 10.1080/15427951.2012.678191  0.326
2013 Seshadhri C, Pinar A, Kolda TG. Triadic measures on graphs: The power of wedge sampling Siam International Conference On Data Mining 2013, Smd 2013. 10-18.  0.323
2012 Seshadhri C, Kolda TG, Pinar A. Community structure and scale-free collections of Erdős-Rényi graphs. Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics. 85: 056109. PMID 23004823 DOI: 10.1103/Physreve.85.056109  0.361
2012 Durak N, Pinar A, Kolda TG, Seshadhri C. Degree relations of triangles in real-world networks and graph models Acm International Conference Proceeding Series. 1712-1716. DOI: 10.1145/2396761.2398503  0.301
2012 Stanton I, Pinar A. Constructing and sampling graphs with a prescribed joint degree distribution Acm Journal of Experimental Algorithms. 17. DOI: 10.1145/2133803.2330086  0.426
2012 Kayaaslan E, Pinar A, Çatalyürek U, Aykanat C. Partitioning hypergraphs in scientific computing applications through vertex separators on graphs Siam Journal On Scientific Computing. 34. DOI: 10.1137/100810022  0.456
2011 Seshadhri C, Pinar A, Kolda TG. An in-depth study of stochastic Kronecker graphs Proceedings - Ieee International Conference On Data Mining, Icdm. 587-596. DOI: 10.1109/ICDM.2011.23  0.332
2011 Stanton I, Pinar A. Sampling graphs with a prescribed joint degree distribution using Markov chains 2011 Proceedings of the 13th Workshop On Algorithm Engineering and Experiments, Alenex 2011. 151-163.  0.31
2010 Pinar A, Meza J, Donde V, Lesieutre B. Optimization strategies for the vulnerability analysis of the electric power grid* Siam Journal On Optimization. 20: 1786-1810. DOI: 10.1137/070708275  0.387
2010 Kamil S, Oliker L, Pinar A, Shalf J. Communication requirements and interconnect optimization for high-end scientific applications Ieee Transactions On Parallel and Distributed Systems. 21: 188-202. DOI: 10.1109/Tpds.2009.61  0.347
2008 Otoo EJ, Rotem D, Pinar A, Tsao S. A File Allocation Strategy for Energy-Efficient Disk Storage Systems Lawrence Berkeley National Laboratory. DOI: 10.2172/934979  0.343
2008 Pinar A, Kartal Tabak E, Aykanat C. One-dimensional partitioning for heterogeneous systems: Theory and practice Journal of Parallel and Distributed Computing. 68: 1473-1486. DOI: 10.1016/J.Jpdc.2008.07.005  0.365
2007 Cesarz P, Pomann G, Torre Ldl, Villarosa G, Flournoy T, Pinar A, Juan M. Detecting Network Vulnerabilities Through Graph TheoreticalMethods Lawrence Berkeley National Laboratory. DOI: 10.2172/918500  0.403
2005 Pinar A, Hendrickson B. Improving load balance with flexibly assignable tasks Ieee Transactions On Parallel and Distributed Systems. 16: 956-965. DOI: 10.1109/Tpds.2005.123  0.391
2004 Aykanat C, Pinar A, Çatalyürek UV. Permuting sparse rectangular matrices into block-diagonal form Siam Journal On Scientific Computing. 25: 1860-1879. DOI: 10.1137/S1064827502401953  0.395
2004 Pinar A, Hendrickson B. Interprocessor communication with limited memory Ieee Transactions On Parallel and Distributed Systems. 15: 606-616. DOI: 10.1109/Tpds.2004.22  0.371
2004 Pinar A, Aykanat C. Fast optimal load balancing algorithms for 1D partitioning Journal of Parallel and Distributed Computing. 64: 974-996. DOI: 10.1016/J.Jpdc.2004.05.003  0.35
2003 Coppersmith D, Fleischer L, Hendrickson B, Pinar A. A Divide-and-conquer Algorithm for Identifying Strongly Connected Components ? Lawrence Berkeley National Laboratory. DOI: 10.2172/889876  0.366
2003 Pinar A, Liu CL. Compacting sequences with invariant transition frequencies Acm Transactions On Design Automation of Electronic Systems. 8: 214-221. DOI: 10.1145/762488.762492  0.327
2002 Pinar A, Liu CL. Sequence Compaction to Preserve Transition Frequencies Lawrence Berkeley National Laboratory. DOI: 10.2172/807439  0.347
Show low-probability matches.