Ali Pinar, Ph.D.
Affiliations: | 2001 | University of Illinois, Urbana-Champaign, Urbana-Champaign, IL |
Area:
Computer ScienceGoogle:
"Ali Pinar"Parents
Sign in to add mentor| Michael Heath | grad student | 2001 | UIUC | |
| (Combinatorial algorithms in scientific computing.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Cheng J, Li-Yang Chen R, Najm HN, et al. (2018) Distributionally Robust Optimization with Principal Component Analysis Siam Journal On Optimization. 28: 1817-1841 |
| Cheng J, Chen RL, Najm HN, et al. (2018) Chance-constrained economic dispatch with renewable energy and storage Computational Optimization and Applications. 70: 479-502 |
| Sariyüce AE, Seshadhri C, Pinar A, et al. (2017) Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs Acm Transactions On the Web. 11: 1-27 |
| Safta C, Chen RL, Najm HN, et al. (2017) Efficient Uncertainty Quantification in Stochastic Economic Dispatch Ieee Transactions On Power Systems. 32: 2535-2546 |
| Quinn CJ, Pinar A, Kiyavash N. (2017) Bounded-Degree Connected Approximations of Stochastic Networks Ieee Transactions On Molecular, Biological and Multi-Scale Communications. 3: 79-88 |
| Quinn CJ, Pinar A, Gao J, et al. (2017) Robust Sparse Approximations for Stochastic Dynamical Systems Ifac-Papersonline. 50: 14010-14015 |
| Aksoy SG, Kolda TG, Pinar A. (2016) Measuring and modeling bipartite graphs with community structure Journal of Complex Networks. 5: 581-603 |
| Jha M, Seshadhri C, Pinar A. (2015) 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 |
| Jha M, Seshadhri C, Pinar A. (2015) A space-efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox Acm Transactions On Knowledge Discovery From Data. 9: 15 |
| Ray J, Pinar A, Seshadhri C. (2015) A stopping criterion for Markov chains when generating independent random graphs Journal of Complex Networks. 3: 204-220 |