default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli Pinar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j31]Eric D. Vugrin
, Seth Hanson, Jerry Cruz, Casey Glatter, Thomas D. Tarman, Ali Pinar:
Experimental Validation of a Command and Control Traffic Detection Model. IEEE Trans. Dependable Secur. Comput. 21(3): 1084-1097 (2024)- 2023
- [j30]Alexander V. Outkin, Patricia V. Schulz, Timothy Schulz, Thomas D. Tarman, Ali Pinar:
Defender Policy Evaluation and Resource Allocation With MITRE ATT&CK Evaluations Data. IEEE Trans. Dependable Secur. Comput. 20(3): 1909-1926 (2023) - 2022
- [c52]Kasimir Gabert, Ali Pinar, Ümit V. Çatalyürek:
Batch dynamic algorithm to find k-core hierarchies. GRADES-NDA@SIGMOD 2022: 9:1-9:10 - [i43]Kasimir Gabert, Ali Pinar, Ümit V. Çatalyürek:
Batch Dynamic Algorithm to Find k-Cores and Hierarchies. CoRR abs/2203.13095 (2022) - 2021
- [c51]Fulton Wang, Ali Pinar:
The Multiple Instance Learning Gaussian Process Probit Model. AISTATS 2021: 3034-3042 - [c50]Luka Malashkhia, Laura P. Swiler, Ali Pinar, Yan Wang:
A Robust Control Scheme for Time Delay Switch Attacks. AMSec@CCS 2021: 23-30 - [c49]Kasimir Gabert, Ali Pinar, Ümit V. Çatalyürek:
Shared-Memory Scalable k-Core Maintenance on Dynamic Graphs and Hypergraphs. IPDPS Workshops 2021: 998-1007 - [c48]Kasimir Gabert, Kaan Sancak, M. Yusuf Özkaya, Ali Pinar, Ümit V. Çatalyürek:
EIGA: elastic and scalable dynamic graph analysis. SC 2021: 50 - [c47]James B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang:
Provable Advantages for Graph Algorithms in Spiking Neural Networks. SPAA 2021: 35-47 - [c46]Kasimir Gabert, Ali Pinar, Ümit V. Çatalyürek:
A Unifying Framework to Identify Dense Subgraphs on Streams: Graph Nuclei to Hypergraph Cores. WSDM 2021: 689-697 - [i42]Alexander V. Outkin, Patricia V. Schulz, Timothy Schulz, Thomas D. Tarman, Ali Pinar:
Defender Policy Evaluation and Resource Allocation Using MITRE ATT&CK Evaluations Data. CoRR abs/2107.04075 (2021) - 2020
- [c45]Eric D. Vugrin, Jerry Cruz, Christian Reedy, Thomas D. Tarman, Ali Pinar:
Cyber threat modeling and validation: port scanning and detection. HotSoS 2020: 6:1-6:10 - [c44]M. Yusuf Özkaya, Muhammed Fatih Balin, Ali Pinar, Ümit V. Çatalyürek:
A scalable graph generation algorithm to sample over a given shell distribution. IPDPS Workshops 2020: 227-236 - [c43]Ricky Laishram, Ahmet Erdem Sariyüce, Tina Eliassi-Rad, Ali Pinar, Sucheta Soundarajan:
Residual Core Maximization: An Efficient Algorithm for Maximizing the Size of the k-Core. SDM 2020: 325-333 - [c42]James B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang:
Provable Neuromorphic Advantages for Computing Shortest Paths. SPAA 2020: 497-499
2010 – 2019
- 2019
- [j29]Leanne S. Whitmore, Bernard Nguyen, Ali Pinar, Anthe George, Corey M. Hudson:
RetSynth: determining all optimal and sub-optimal synthetic pathways that facilitate synthesis of target compounds in chassis organisms. BMC Bioinform. 20(1): 461:1-461:14 (2019) - [c41]James B. Aimone, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Helen Xu:
Dynamic Programming with Spiking Neural Computing. ICONS 2019: 20:1-20:9 - 2018
- [j28]Jianqiang Cheng, Richard Li-Yang Chen, Habib N. Najm, Ali Pinar, Cosmin Safta, Jean-Paul Watson:
Chance-constrained economic dispatch with renewable energy and storage. Comput. Optim. Appl. 70(2): 479-502 (2018) - [j27]Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar:
Local Algorithms for Hierarchical Dense Subgraph Discovery. Proc. VLDB Endow. 12(1): 43-56 (2018) - [j26]Jianqiang Cheng, Richard Li-Yang Chen, Habib N. Najm, Ali Pinar, Cosmin Safta, Jean-Paul Watson:
Distributionally Robust Optimization with Principal Component Analysis. SIAM J. Optim. 28(2): 1817-1841 (2018) - [c40]M. Yusuf Özkaya, Ahmet Erdem Sanyuce, Ali Pinar, Ümit V. Çatalyürek:
Local Detection of Critical Nodes in Active Graphs. ASONAM 2018: 107-110 - [c39]Ahmet Erdem Sariyüce, Ali Pinar:
Peeling Bipartite Networks for Dense Subgraph Discovery. WSDM 2018: 504-512 - [c38]Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri:
Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples. WWW 2018: 449-458 - [c37]Ricky Laishram, Ahmet Erdem Sariyüce, Tina Eliassi-Rad, Ali Pinar, Sucheta Soundarajan:
Measuring and Improving the Core Resilience of Networks. WWW 2018: 609-618 - 2017
- [j25]Richard Li-Yang Chen, Neng Fan, Ali Pinar, Jean-Paul Watson:
Contingency-constrained unit commitment with post-contingency corrective recourse. Ann. Oper. Res. 249(1-2): 381-407 (2017) - [j24]C. Seshadhri, Ali Pinar, Nurcan Durak, Tamara G. Kolda:
Directed closure measures for networks with reciprocity. J. Complex Networks 5(1): 32-47 (2017) - [j23]Sinan Aksoy, Tamara G. Kolda, Ali Pinar:
Measuring and modeling bipartite graphs with community structure. J. Complex Networks 5(4): 581-603 (2017) - [j22]Christopher J. Quinn, Ali Pinar, Negar Kiyavash:
Bounded-Degree Connected Approximations of Stochastic Networks. IEEE Trans. Mol. Biol. Multi Scale Commun. 3(2): 79-88 (2017) - [j21]Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek:
Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs. ACM Trans. Web 11(3): 16:1-16:27 (2017) - [c36]Sucheta Soundarajan, Tina Eliassi-Rad, Brian Gallagher, Ali Pinar:
ε - WGX: Adaptive Edge Probing for Enhancing Incomplete Networks. WebSci 2017: 161-170 - [c35]Ali Pinar, C. Seshadhri, Vaidyanathan Vishal:
ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. WWW 2017: 1431-1440 - [i41]Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar:
Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions. CoRR abs/1704.00386 (2017) - [i40]Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri:
Provable and practical approximations for the degree distribution using sublinear graph samples. CoRR abs/1710.08607 (2017) - [i39]Yusuf Özkaya, Ahmet Erdem Sariyüce, Ümit V. Çatalyürek, Ali Pinar:
Active Betweenness Cardinality: Algorithms and Applications. CoRR abs/1711.10634 (2017) - 2016
- [j20]Ahmet Erdem Sariyüce, Ali Pinar:
Fast Hierarchy Construction for Dense Subgraphs. Proc. VLDB Endow. 10(3): 97-108 (2016) - [j19]Janine C. Bennett, Ankit Bhagatwala, Jacqueline H. Chen, Ali Pinar, Maher Salloum, C. Seshadhri:
Trigger Detection for Adaptive Scientific Workflows Using Percentile Sampling. SIAM J. Sci. Comput. 38(5) (2016) - [c34]Sucheta Soundarajan, Tina Eliassi-Rad, Brian Gallagher, Ali Pinar:
MaxReach: Reducing network incompleteness through node probes. ASONAM 2016: 152-157 - [c33]Christopher J. Quinn, Ali Pinar, Jing Gao, Lu Su:
Sparse approximations of directed information graphs. ISIT 2016: 1735-1739 - [i38]Sinan Aksoy, Tamara G. Kolda, Ali Pinar:
Measuring and Modeling Bipartite Graphs with Community Structure. CoRR abs/1607.08673 (2016) - [i37]Ahmet Erdem Sariyüce, Ali Pinar:
Fast Hierarchy Construction for Dense Subgraphs. CoRR abs/1610.01961 (2016) - [i36]Ali Pinar, C. Seshadhri, Vaidyanathan Vishal:
ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. CoRR abs/1610.09411 (2016) - [i35]Ahmet Erdem Sariyüce, Ali Pinar:
Butterfly Effect: Peeling Bipartite Networks. CoRR abs/1611.02756 (2016) - 2015
- [j18]Jaideep Ray, Ali Pinar, C. Seshadhri:
A stopping criterion for Markov chains when generating independent random graphs. J. Complex Networks 3(2): 204-220 (2015) - [j17]Madhav Jha, C. Seshadhri, Ali Pinar:
A Space-Efficient Streaming Algorithm for Estimating Transitivity and Triangle Counts Using the Birthday Paradox. ACM Trans. Knowl. Discov. Data 9(3): 15:1-15:21 (2015) - [c32]Madhav Jha, Ali Pinar, C. Seshadhri:
Counting triangles in real-world graph streams: Dealing with repeated edges and time windows. ACSSC 2015: 1507-1514 - [c31]Grey Ballard, Tamara G. Kolda, Ali Pinar, C. Seshadhri:
Diamond Sampling for Approximate Maximum All-Pairs Dot-Product (MAD) Search. ICDM 2015: 11-20 - [c30]Maher Salloum, Janine C. Bennett, Ali Pinar, Ankit Bhagatwala, Jacqueline H. Chen:
Enabling Adaptive Scientific Workflows Via Trigger Detection. ISAV@SC 2015: 41-45 - [c29]Madhav Jha, C. Seshadhri, Ali Pinar:
Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts. WWW 2015: 495-505 - [c28]Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek:
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. WWW 2015: 927-937 - [p2]C. Seshadhri, Ali Pinar, David C. Thompson, Janine C. Bennett:
Sublinear Algorithms for Extreme-Scale Data Analysis. Topological and Statistical Methods for Complex Data, Tackling Large-Scale, High-Dimensional, and Multivariate Data Spaces 2015: 39-54 - [i34]Grey Ballard, Ali Pinar, Tamara G. Kolda, C. Seshadhri:
Diamond Sampling for Approximate Maximum All-pairs Dot-product (MAD) Search. CoRR abs/1506.03872 (2015) - [i33]Christopher J. Quinn, Ali Pinar, Negar Kiyavash:
Bounded Degree Approximations of Stochastic Networks. CoRR abs/1506.04767 (2015) - [i32]Janine C. Bennett, Ankit Bhagatwala, Jacqueline H. Chen, C. Seshadhri, Ali Pinar, Maher Salloum:
Trigger detection for adaptive scientific workflows using percentile sampling. CoRR abs/1506.08258 (2015) - [i31]Maher Salloum, Janine C. Bennett, Ali Pinar, Ankit Bhagatwala, Jacqueline H. Chen:
Enabling adaptive scientific workflows via trigger detection. CoRR abs/1508.04731 (2015) - [i30]Cosmin Safta, Richard Li-Yang Chen, Habib N. Najm, Ali Pinar, Jean-Paul Watson:
Efficient Representation of Uncertainty for Stochastic Economic Dispatch. CoRR abs/1508.05176 (2015) - [i29]Sucheta Soundarajan, Tina Eliassi-Rad, Brian Gallagher, Ali Pinar:
MaxOutProbe: An Algorithm for Increasing the Size of Partially Observed Networks. CoRR abs/1511.06463 (2015) - 2014
- [j16]C. Seshadhri, Ali Pinar, Tamara G. Kolda:
Wedge sampling for computing clustering coefficients and triangle counts on large graphs. Stat. Anal. Data Min. 7(4): 294-307 (2014) - [j15]Tamara G. Kolda, Ali Pinar, Todd D. Plantenga, C. Seshadhri:
A Scalable Generative Graph Model with Community Structure. SIAM J. Sci. Comput. 36(5) (2014) - [j14]Tamara G. Kolda, Ali Pinar, Todd D. Plantenga, C. Seshadhri, Christine Task:
Counting Triangles in Massive Graphs with MapReduce. SIAM J. Sci. Comput. 36(5) (2014) - [i28]Chengbin Peng, Tamara G. Kolda, Ali Pinar:
Accelerating Community Detection by Using K-core Subgraphs. CoRR abs/1403.2226 (2014) - [i27]Richard Li-Yang Chen, Neng Fan, Ali Pinar, Jean-Paul Watson:
Contingency-Constrained Unit Commitment with Post-Contingency Corrective Recourse. CoRR abs/1404.2964 (2014) - [i26]Cosmin Safta, Richard L. Chen, Habib N. Najm, Ali Pinar, Jean-Paul Watson:
Toward Using Surrogates to Accelerate Solution of Stochastic Electricity Grid Operations Problems. CoRR abs/1407.2232 (2014) - [i25]Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek:
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. CoRR abs/1411.3312 (2014) - [i24]Madhav Jha, C. Seshadhri, Ali Pinar:
Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts. CoRR abs/1411.4942 (2014) - [i23]Ulrich Carsten Meyer, Henning Meyerhenke, Ali Pinar, Ilya Safro:
High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461). Dagstuhl Reports 4(11): 40-58 (2014) - 2013
- [j13]Matthew Rocklin, Ali Pinar:
On Clustering on Graphs with Multiple Edge Types. Internet Math. 9(1): 82-112 (2013) - [j12]C. Seshadhri, Ali Pinar, Tamara G. Kolda:
An in-depth analysis of stochastic Kronecker graphs. J. ACM 60(2): 13:1-13:32 (2013) - [c27]Ayush Singhal, Karthik Subbian, Jaideep Srivastava, Tamara G. Kolda, Ali Pinar:
Dynamics of trust reciprocation in multi-relational networks. ASONAM 2013: 661-665 - [c26]Christopher J. Quinn, Ali Pinar, Negar Kiyavash:
Optimal bounded-degree approximations of joint distributions of networks of stochastic processes. ISIT 2013: 2264-2268 - [c25]Madhav Jha, C. Seshadhri, Ali Pinar:
A space efficient streaming algorithm for triangle counting using the birthday paradox. KDD 2013: 589-597 - [c24]David C. Thompson, Janine Bennett, C. Seshadhri, Ali Pinar:
A provably-robust sampling method for generating colormaps of large data. LDAV 2013: 77-84 - [c23]Nurcan Durak, Tamara G. Kolda, Ali Pinar, C. Seshadhri:
A scalable null model for directed graphs matching all degree distributions: In, out, and reciprocal. NSW 2013: 23-30 - [c22]Tamara G. Kolda, Ali Pinar, C. Seshadhri:
Triadic Measures on Graphs: The Power of Wedge Sampling. SDM 2013: 10-18 - [i22]Tamara G. Kolda, Ali Pinar, Todd D. Plantenga, C. Seshadhri, Christine Task:
Counting Triangles in Massive Graphs with MapReduce. CoRR abs/1301.5887 (2013) - [i21]C. Seshadhri, Ali Pinar, Nurcan Durak, Tamara G. Kolda:
The importance of directed triangles with reciprocity: patterns and algorithms. CoRR abs/1302.6220 (2013) - [i20]Tamara G. Kolda, Ali Pinar, Todd D. Plantenga, C. Seshadhri:
A Scalable Generative Graph Model with Community Structure. CoRR abs/1302.6636 (2013) - [i19]Karthik Subbian, Ayush Singhal, Tamara G. Kolda, Ali Pinar, Jaideep Srivastava:
On Reciprocity in Massively Multi-player Online Game Networks. CoRR abs/1303.6385 (2013) - [i18]C. Seshadhri, Ali Pinar, Tamara G. Kolda:
Wedge Sampling for Computing Clustering Coefficients and Triangle Counts on Large Graphs. CoRR abs/1309.3321 (2013) - [i17]Madhav Jha, C. Seshadhri, Ali Pinar:
When a Graph is not so Simple: Counting Triangles in Multigraph Streams. CoRR abs/1310.7665 (2013) - 2012
- [j11]Enver Kayaaslan, Ali Pinar, Ümit V. Çatalyürek, Cevdet Aykanat:
Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs. SIAM J. Sci. Comput. 34(2) (2012) - [c21]Nurcan Durak, Ali Pinar, Tamara G. Kolda, C. Seshadhri:
Degree relations of triangles in real-world networks and graph models. CIKM 2012: 1712-1716 - [c20]C. Seshadhri, Ali Pinar, Tamara G. Kolda:
The Similarity Between Stochastic Kronecker and Chung-Lu Graph Models. SDM 2012: 1071-1082 - [c19]Jaideep Ray, Ali Pinar, C. Seshadhri:
Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs. WAW 2012: 153-164 - [i16]Richard Li-Yang Chen, Amy Cohn, Neng Fan, Ali Pinar:
N-k-e Survivable Power System Design. CoRR abs/1201.1530 (2012) - [i15]Jaideep Ray, Ali Pinar, C. Seshadhri:
Are we there yet? When to stop a Markov chain while generating random graphs. CoRR abs/1202.3473 (2012) - [i14]C. Seshadhri, Ali Pinar, Tamara G. Kolda:
Fast Triangle Counting through Wedge Sampling. CoRR abs/1202.5230 (2012) - [i13]Nurcan Durak, Ali Pinar, Tamara G. Kolda, C. Seshadhri:
Degree Relations of Triangles in Real-world Networks and Models. CoRR abs/1207.7125 (2012) - [i12]Nurcan Durak, Tamara G. Kolda, Ali Pinar, C. Seshadhri:
A scalable directed graph model with reciprocal edges. CoRR abs/1210.5288 (2012) - [i11]Jaideep Ray, Ali Pinar, C. Seshadhri:
A stopping criterion for Markov chains when generating independent random graphs. CoRR abs/1210.8184 (2012) - [i10]Madhav Jha, C. Seshadhri, Ali Pinar:
From the Birthday Paradox to a Practical Sublinear Space Streaming Algorithm for Triangle Counting. CoRR abs/1212.2264 (2012) - 2011
- [j10]Isabelle Stanton, Ali Pinar:
Constructing and sampling graphs with a prescribed joint degree distribution. ACM J. Exp. Algorithmics 17(1) (2011) - [c18]Isabelle Stanton, Ali Pinar:
Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains. ALENEX 2011: 151-163 - [c17]C. Seshadhri, Ali Pinar, Tamara G. Kolda:
An In-depth Study of Stochastic Kronecker Graphs. ICDM 2011: 587-596 - [c16]Matthew Rocklin, Ali Pinar:
Latent Clustering on Graphs with Multiple Edge Types. WAW 2011: 38-49 - [i9]C. Seshadhri, Ali Pinar, Tamara G. Kolda:
A Hitchhiker's Guide to Choosing Parameters of Stochastic Kronecker Graphs. CoRR abs/1102.5046 (2011) - [i8]Enver Kayaaslan, Ali Pinar, Ümit V. Çatalyürek, Cevdet Aykanat:
Hypergraph Partitioning through Vertex Separators on Graphs. CoRR abs/1103.0106 (2011) - [i7]Ekow J. Otoo, Ali Pinar, Doron Rotem:
A Linear Approximation Algorithm for 2-Dimensional Vector Packing. CoRR abs/1103.0260 (2011) - [i6]Matthew Rocklin, Ali Pinar:
Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types. CoRR abs/1103.0368 (2011) - [i5]Isabelle Stanton, Ali Pinar:
Constructing and Sampling Graphs with a Prescribed Joint Degree Distribution. CoRR abs/1103.4875 (2011) - [i4]Matthew Rocklin, Ali Pinar:
On Clustering on Graphs with Multiple Edge Types. CoRR abs/1109.1605 (2011) - [i3]Richard Li-Yang Chen, Amy Cohn, Ali Pinar:
An Implicit Optimization Approach for Survivable Network Design. CoRR abs/1109.1801 (2011) - [i2]Ali Pinar, C. Seshadhri, Tamara G. Kolda:
The Similarity between Stochastic Kronecker and Chung-Lu Graph Models. CoRR abs/1110.4925 (2011) - [i1]C. Seshadhri, Tamara G. Kolda, Ali Pinar:
Community structure and scale-free collections of Erdös-Rényi graphs. CoRR abs/1112.3644 (2011) - 2010
- [j9]Curtis L. Janssen, Helgi Adalsteinsson, Scott Cranford, Joseph P. Kenny, Ali Pinar, David A. Evensky, Jackson R. Mayo:
A Simulator for Large-Scale Parallel Computer Architectures. Int. J. Distributed Syst. Technol. 1(2): 57-73 (2010) - [j8]Ali Pinar, Juan C. Meza, Vaibhav Donde, Bernard C. Lesieutre:
Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid. SIAM J. Optim. 20(4): 1786-1810 (2010) - [j7]Shoaib Kamil, Leonid Oliker, Ali Pinar, John Shalf:
Communication Requirements and Interconnect Optimization for High-End Scientific Applications. IEEE Trans. Parallel Distributed Syst. 21(2): 188-202 (2010) - [c15]Matthew Rocklin, Ali Pinar:
Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types. WAW 2010: 25-35
2000 – 2009
- 2008
- [j6]Ali Pinar, E. Kartal Tabak, Cevdet Aykanat:
One-dimensional partitioning for heterogeneous systems: Theory and practice. J. Parallel Distributed Comput. 68(11): 1473-1486 (2008) - [c14]Bernard C. Lesieutre, Ali Pinar, Sandip Roy:
Power System Extreme Event Detection: The Vulnerability Frontier. HICSS 2008: 184 - 2007
- [c13]Shoaib Kamil, Ali Pinar, Daniel K. Gunter, Michael Lijewski, Leonid Oliker, John Shalf:
Reconfigurable hybrid interconnection for static and dynamic scientific applications. Conf. Computing Frontiers 2007: 183-194 - [c12]Ali Pinar, Adam Reichert, Bernard C. Lesieutre:
Computing Criticality of Lines in Power Systems. ISCAS 2007: 65-68 - 2006
- [p1]Ali Pinar, Bruce Hendrickson:
Combinatorial Parallel and Scientific Computing. Parallel Processing for Scientific Computing 2006: 127-141 - 2005
- [j5]Ali Pinar, Bruce Hendrickson:
Improving Load Balance with Flexibly Assignable Tasks. IEEE Trans. Parallel Distributed Syst. 16(10): 956-965 (2005) - [c11]Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu:
Compressing Bitmap Indices by Data Reorganization. ICDE 2005: 310-321 - 2004
- [j4]Ali Pinar, Cevdet Aykanat:
Fast optimal load balancing algorithms for 1D partitioning. J. Parallel Distributed Comput. 64(8): 974-996 (2004) - [j3]Cevdet Aykanat, Ali Pinar, Ümit V. Çatalyürek:
Permuting Sparse Rectangular Matrices into Block-Diagonal Form. SIAM J. Sci. Comput. 25(6): 1860-1879 (2004) - [j2]Ali Pinar, Bruce Hendrickson:
Interprocessor Communication with Limited Memory. IEEE Trans. Parallel Distributed Syst. 15(7): 606-616 (2004) - 2003
- [j1]Ali Pinar, C. L. Liu:
Compacting sequences with invariant transition frequencies. ACM Trans. Design Autom. Electr. Syst. 8(2): 214-221 (2003) - 2002
- [c10]Ali Pinar, Bruce Hendrickson:
Exploiting flexibly assignable work to improve load balance. SPAA 2002: 155-163 - 2001
- [b1]Ali Pinar:
Combinatorial Algorithms in Scientific Computing. University of Illinois Urbana-Champaign, USA, 2001 - [c9]Ali Pinar, Bruce Hendrickson:
Partitioning for Complex Objectives. IPDPS 2001: 121 - [c8]Ali Pinar, Bruce Hendrickson:
Communication Support for Adaptive Computation. PP 2001 - 2000
- [c7]Lisa Fleischer, Bruce Hendrickson, Ali Pinar:
On Identifying Strongly Connected Components in Parallel. IPDPS Workshops 2000: 505-511 - [c6]Ali Pinar, Bruce Hendrickson:
Interprocessor communication with memory constraints. SPAA 2000: 39-45
1990 – 1999
- 1999
- [c5]Ali Pinar, Michael T. Heath:
Improving Performance of Sparse Matrix-Vector Multiplication. SC 1999: 30 - 1998
- [c4]Ali Pinar, C. L. Liu:
Power invariant vector sequence compaction. ICCAD 1998: 473-476 - 1997
- [c3]Ali Pinar, Cevdet Aykanat:
Sparse matrix decomposition with optimal load balancing. HiPC 1997: 224-229 - 1996
- [c2]Ali Pinar, Cevdet Aykanat:
An Effective Model to Decompose Linear Programs for Parallel Solution. PARA 1996: 592-601 - 1995
- [c1]Ali Pinar, Ümit V. Çatalyürek, Cevdet Aykanat, Mustafa Ç. Pinar:
Decomposing Linear Programs for Parallel Solution. PARA 1995: 473-482
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
