| 2011 |
|---|
| 33 | Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains. Isabelle Stanton, Ali Pinar. ALENEX 2011, 151-163. Web SearchBibTeXDownload |
| 32 | On Clustering on Graphs with Multiple Edge Types. Matthew Rocklin, Ali Pinar. CoRR (abs/1109.1605) (2011). Web SearchBibTeXDownload |
| 31 | An Implicit Optimization Approach for Survivable Network Design. Richard Li-Yang Chen, Amy Cohn, Ali Pinar. CoRR (abs/1109.1801) (2011). Web SearchBibTeXDownload |
| 30 | The Similarity between Stochastic Kronecker and Chung-Lu Graph Models. Ali Pinar, C. Seshadhri, Tamara G. Kolda. CoRR (abs/1110.4925) (2011). Web SearchBibTeXDownload |
| 29 | A Hitchhiker's Guide to Choosing Parameters of Stochastic Kronecker Graphs. C. Seshadhri, Ali Pinar, Tamara G. Kolda. CoRR (abs/1102.5046) (2011). Web SearchBibTeXDownload |
| 28 | Community structure and scale-free collections of Erdös-Rényi graphs. C. Seshadhri, Tamara G. Kolda, Ali Pinar. CoRR (abs/1112.3644) (2011). Web SearchBibTeXDownload |
| 27 | Constructing and Sampling Graphs with a Prescribed Joint Degree Distribution. Isabelle Stanton, Ali Pinar. CoRR (abs/1103.4875) (2011). Web SearchBibTeXDownload |
| 26 | A Linear Approximation Algorithm for 2-Dimensional Vector Packing. Ekow J. Otoo, Ali Pinar, Doron Rotem. CoRR (abs/1103.0260) (2011). Web SearchBibTeXDownload |
| 25 | Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types. Matthew Rocklin, Ali Pinar. CoRR (abs/1103.0368) (2011). Web SearchBibTeXDownload |
| 24 | Hypergraph Partitioning through Vertex Separators on Graphs. Enver Kayaaslan, Ali Pinar, Ümit V. Çatalyürek, Cevdet Aykanat. CoRR (abs/1103.0106) (2011). Web SearchBibTeXDownload |
| 23 | An In-depth Study of Stochastic Kronecker Graphs. C. Seshadhri, Ali Pinar, Tamara G. Kolda. ICDM 2011, 587-596. Web SearchBibTeXDownload |
| 22 | Latent Clustering on Graphs with Multiple Edge Types. Matthew Rocklin, Ali Pinar. WAW 2011, 38-49. Web SearchBibTeXDownload |
| 2010 |
|---|
| 21 | Communication Requirements and Interconnect Optimization for High-End Scientific Applications. Shoaib Kamil, Leonid Oliker, Ali Pinar, John Shalf. IEEE Trans. Parallel Distrib. Syst. (21): 188-202 (2010). Web SearchBibTeXDownload |
| 20 | A Simulator for Large-Scale Parallel Computer Architectures. Curtis L. Janssen, Helgi Adalsteinsson, Scott Cranford, Joseph P. Kenny, Ali Pinar, David A. Evensky, Jackson Mayo. IJDST (1): 57-73 (2010). Web SearchBibTeXDownload |
| 19 | Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid. Ali Pinar, Juan Meza, Vaibhav Donde, Bernard C. Lesieutre. SIAM Journal on Optimization (20): 1786-1810 (2010). Web SearchBibTeXDownload |
| 18 | Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types. Matthew Rocklin, Ali Pinar. WAW 2010, 25-35. Web SearchBibTeXDownload |
| 2008 |
|---|
| 17 | Power System Extreme Event Detection: The Vulnerability Frontier. Bernard C. Lesieutre, Ali Pinar, Sandip Roy. HICSS 2008, 184. Web SearchBibTeXDownload |
| 16 | One-dimensional partitioning for heterogeneous systems: Theory and practice. Ali Pinar, E. Kartal Tabak, Cevdet Aykanat. J. Parallel Distrib. Comput. (68): 1473-1486 (2008). Web SearchBibTeXDownload |
| 2007 |
|---|
| 15 | Reconfigurable hybrid interconnection for static and dynamic scientific applications. Shoaib Kamil, Ali Pinar, Daniel Gunter, Michael Lijewski, Leonid Oliker, John Shalf. Conf. Computing Frontiers 2007, 183-194. Web SearchBibTeXDownload |
| 14 | Computing Criticality of Lines in Power Systems. Ali Pinar, Adam Reichert, Bernard C. Lesieutre. ISCAS 2007, 65-68. Web SearchBibTeXDownload |
| 2005 |
|---|
| 13 | Compressing Bitmap Indices by Data Reorganization. Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu. ICDE 2005, 310-321. Cited by 21Web SearchBibTeXDownload |
| 12 | Improving Load Balance with Flexibly Assignable Tasks. Ali Pinar, Bruce Hendrickson. IEEE Trans. Parallel Distrib. Syst. (16): 956-965 (2005). Web SearchBibTeXDownload |
| 2004 |
|---|
| 11 | Interprocessor Communication with Limited Memory. Ali Pinar, Bruce Hendrickson. IEEE Trans. Parallel Distrib. Syst. (15): 606-616 (2004). Web SearchBibTeXDownload |
| 10 | Fast optimal load balancing algorithms for 1D partitioning. Ali Pinar, Cevdet Aykanat. J. Parallel Distrib. Comput. (64): 974-996 (2004). Web SearchBibTeXDownload |
| 2003 |
|---|
| 9 | Compacting sequences with invariant transition frequencies. Ali Pinar, C. L. Liu. ACM Trans. Design Autom. Electr. Syst. (8): 214-221 (2003). Web SearchBibTeXDownload |
| 2002 |
|---|
| 8 | Exploiting flexibly assignable work to improve load balance. Ali Pinar, Bruce Hendrickson. SPAA 2002, 155-163. Web SearchBibTeXDownload |
| 2001 |
|---|
| 7 | Partitioning for Complex Objectives. Ali Pinar, Bruce Hendrickson. IPDPS 2001, 121. Web SearchBibTeX |
| 6 | Communication Support for Adaptive Computation. Ali Pinar, Bruce Hendrickson. PPSC 2001. Web SearchBibTeX |
| 2000 |
|---|
| 5 | On Identifying Strongly Connected Components in Parallel. Lisa Fleischer, Bruce Hendrickson, Ali Pinar. IPDPS Workshops 2000, 505-511. Web SearchBibTeXDownload |
| 4 | Interprocessor communication with memory constraints. Ali Pinar, Bruce Hendrickson. SPAA 2000, 39-45. Web SearchBibTeXDownload |
| 1998 |
|---|
| 3 | Power invariant vector sequence compaction. Ali Pinar, C. L. Liu. ICCAD 1998, 473-476. Web SearchBibTeXDownload |
| 1996 |
|---|
| 2 | An Effective Model to Decompose Linear Programs for Parallel Solution. Ali Pinar, Cevdet Aykanat. PARA 1996, 592-601. Web SearchBibTeXDownload |
| 1995 |
|---|
| 1 | Decomposing Linear Programs for Parallel Solution. Ali Pinar, Ümit V. Çatalyürek, Cevdet Aykanat, Mustafa Pinar. PARA 1995, 473-482. Web SearchBibTeXDownload |
