| 2021 | AISTATS | The Multiple Instance Learning Gaussian Process Probit Model. | Fulton Wang, Ali Pinar |
| 2021 | CCS | A Robust Control Scheme for Time Delay Switch Attacks. | Luka Malashkhia, Laura P. Swiler, Ali Pinar, Yan Wang |
| 2021 | SC | EIGA: elastic and scalable dynamic graph analysis. | Kasimir Gabert, Kaan Sancak, M. Yusuf zkaya, Ali Pinar, mit V. atalyrek |
| 2021 | WSDM | A Unifying Framework to Identify Dense Subgraphs on Streams: Graph Nuclei to Hypergraph Cores. | Kasimir Gabert, Ali Pinar, mit V. atalyrek |
| 2021 | SPAA | Provable Advantages for Graph Algorithms in Spiking Neural Networks. | James B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang |
| 2020 | SDM | Residual Core Maximization: An Efficient Algorithm for Maximizing the Size of the | Ricky Laishram, Ahmet Erdem Sariyce, Tina Eliassi-Rad, Ali Pinar, Sucheta Soundarajan |
| 2020 | SPAA | Provable Neuromorphic Advantages for Computing Shortest Paths. | James B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang |
| 2018 | WWW | Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples. | Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri |
| 2018 | WWW | Measuring and Improving the Core Resilience of Networks. | Ricky Laishram, Ahmet Erdem Sariyce, Tina Eliassi-Rad, Ali Pinar, Sucheta Soundarajan |
| 2018 | WSDM | Peeling Bipartite Networks for Dense Subgraph Discovery. | Ahmet Erdem Sariyce, Ali Pinar |
| 2017 | WWW | ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. | Ali Pinar, C. Seshadhri, Vaidyanathan Vishal |
| 2016 | ISIT | Sparse approximations of directed information graphs. | Christopher J. Quinn, Ali Pinar, Jing Gao, Lu Su |
| 2015 | ACSSC | Counting triangles in real-world graph streams: Dealing with repeated edges and time windows. | Madhav Jha, Ali Pinar, C. Seshadhri |
| 2015 | ICDM | Diamond Sampling for Approximate Maximum All-Pairs Dot-Product (MAD) Search. | Grey Ballard, Tamara G. Kolda, Ali Pinar, C. Seshadhri |
| 2015 | WWW | Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts. | Madhav Jha, C. Seshadhri, Ali Pinar |
| 2015 | WWW | Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. | Ahmet Erdem Sariyce, C. Seshadhri, Ali Pinar, mit V. atalyrek |
| 2015 | SC | Enabling Adaptive Scientific Workflows Via Trigger Detection. | Maher Salloum, Janine C. Bennett, Ali Pinar, Ankit Bhagatwala, Jacqueline H. Chen |
| 2013 | ISIT | Optimal bounded-degree approximations of joint distributions of networks of stochastic processes. | Christopher J. Quinn, Ali Pinar, Negar Kiyavash |
| 2013 | KDD | A space efficient streaming algorithm for triangle counting using the birthday paradox. | Madhav Jha, C. Seshadhri, Ali Pinar |
| 2013 | SDM | Triadic Measures on Graphs: The Power of Wedge Sampling. | Tamara G. Kolda, Ali Pinar, C. Seshadhri |
| 2012 | CIKM | Degree relations of triangles in real-world networks and graph models. | Nurcan Durak, Ali Pinar, Tamara G. Kolda, C. Seshadhri |
| 2012 | SDM | The Similarity Between Stochastic Kronecker and Chung-Lu Graph Models. | C. Seshadhri, Ali Pinar, Tamara G. Kolda |
| 2012 | WAW | Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs. | Jaideep Ray, Ali Pinar, C. Seshadhri |
| 2011 | ALENEX | Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains. | Isabelle Stanton, Ali Pinar |
| 2011 | ICDM | An In-depth Study of Stochastic Kronecker Graphs. | C. Seshadhri, Ali Pinar, Tamara G. Kolda |
| 2011 | WAW | Latent Clustering on Graphs with Multiple Edge Types. | Matthew Rocklin, Ali Pinar |
| 2010 | WAW | Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types. | Matthew Rocklin, Ali Pinar |
| 2007 | ISCAS | Computing Criticality of Lines in Power Systems. | Ali Pinar, Adam Reichert, Bernard C. Lesieutre |
| 2005 | ICDE | Compressing Bitmap Indices by Data Reorganization. | Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu |
| 2002 | SPAA | Exploiting flexibly assignable work to improve load balance. | Ali Pinar, Bruce Hendrickson |
| 2000 | SPAA | Interprocessor communication with memory constraints. | Ali Pinar, Bruce Hendrickson |
| 1999 | SC | Improving Performance of Sparse Matrix-Vector Multiplication. | Ali Pinar, Michael T. Heath |
| 1998 | ICCAD | Power invariant vector sequence compaction. | Ali Pinar, C. L. Liu |
| 1997 | HiPC | Sparse matrix decomposition with optimal load balancing. | Ali Pinar, Cevdet Aykanat |