Ali Pinar

Orcid: 0000-0002-0912-9623

According to our database1, Ali Pinar authored at least 110 papers between 1995 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Experimental Validation of a Command and Control Traffic Detection Model.
IEEE Trans. Dependable Secur. Comput., 2024

2023
Defender Policy Evaluation and Resource Allocation With MITRE ATT&CK Evaluations Data.
IEEE Trans. Dependable Secur. Comput., 2023

2022
Batch Dynamic Algorithm to Find k-Cores and Hierarchies.
CoRR, 2022

Batch dynamic algorithm to find <i>k</i>-core hierarchies.
Proceedings of the GRADES-NDA '22: Proceedings of the 5th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), 2022

2021
Defender Policy Evaluation and Resource Allocation Using MITRE ATT&CK Evaluations Data.
CoRR, 2021

A Unifying Framework to Identify Dense Subgraphs on Streams: Graph Nuclei to Hypergraph Cores.
Proceedings of the WSDM '21, 2021

Provable Advantages for Graph Algorithms in Spiking Neural Networks.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

EIGA: elastic and scalable dynamic graph analysis.
Proceedings of the International Conference for High Performance Computing, 2021

Shared-Memory Scalable k-Core Maintenance on Dynamic Graphs and Hypergraphs.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2021

A Robust Control Scheme for Time Delay Switch Attacks.
Proceedings of the AMSec '21: Proceedings of the 2021 Workshop on Additive Manufacturing (3D Printing) Security, 2021

The Multiple Instance Learning Gaussian Process Probit Model.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Provable Neuromorphic Advantages for Computing Shortest Paths.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Residual Core Maximization: An Efficient Algorithm for Maximizing the Size of the <i>k</i>-Core.
Proceedings of the 2020 SIAM International Conference on Data Mining, 2020

A scalable graph generation algorithm to sample over a given shell distribution.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium Workshops, 2020

Cyber threat modeling and validation: port scanning and detection.
Proceedings of the 7th Annual Symposium on Hot Topics in the Science of Security, 2020

2019
RetSynth: determining all optimal and sub-optimal synthetic pathways that facilitate synthesis of target compounds in chassis organisms.
BMC Bioinform., 2019

Dynamic Programming with Spiking Neural Computing.
Proceedings of the International Conference on Neuromorphic Systems, 2019

2018
Distributionally Robust Optimization with Principal Component Analysis.
SIAM J. Optim., 2018

Local Algorithms for Hierarchical Dense Subgraph Discovery.
Proc. VLDB Endow., 2018

Chance-constrained economic dispatch with renewable energy and storage.
Comput. Optim. Appl., 2018

Measuring and Improving the Core Resilience of Networks.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Peeling Bipartite Networks for Dense Subgraph Discovery.
Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

Local Detection of Critical Nodes in Active Graphs.
Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

2017
Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs.
ACM Trans. Web, 2017

Bounded-Degree Connected Approximations of Stochastic Networks.
IEEE Trans. Mol. Biol. Multi Scale Commun., 2017

Active Betweenness Cardinality: Algorithms and Applications.
CoRR, 2017

Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions.
CoRR, 2017

Directed closure measures for networks with reciprocity.
J. Complex Networks, 2017

Measuring and modeling bipartite graphs with community structure.
J. Complex Networks, 2017

Contingency-constrained unit commitment with post-contingency corrective recourse.
Ann. Oper. Res., 2017

ESCAPE: Efficiently Counting All 5-Vertex Subgraphs.
Proceedings of the 26th International Conference on World Wide Web, 2017

ε - WGX: Adaptive Edge Probing for Enhancing Incomplete Networks.
Proceedings of the 2017 ACM on Web Science Conference, 2017

2016
Trigger Detection for Adaptive Scientific Workflows Using Percentile Sampling.
SIAM J. Sci. Comput., 2016

Fast Hierarchy Construction for Dense Subgraphs.
Proc. VLDB Endow., 2016

Butterfly Effect: Peeling Bipartite Networks.
CoRR, 2016

Sparse approximations of directed information graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2016

MaxReach: Reducing network incompleteness through node probes.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015
A Space-Efficient Streaming Algorithm for Estimating Transitivity and Triangle Counts Using the Birthday Paradox.
ACM Trans. Knowl. Discov. Data, 2015

MaxOutProbe: An Algorithm for Increasing the Size of Partially Observed Networks.
CoRR, 2015

Efficient Representation of Uncertainty for Stochastic Economic Dispatch.
CoRR, 2015

Bounded Degree Approximations of Stochastic Networks.
CoRR, 2015

A stopping criterion for Markov chains when generating independent random graphs.
J. Complex Networks, 2015

Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions.
Proceedings of the 24th International Conference on World Wide Web, 2015

Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts.
Proceedings of the 24th International Conference on World Wide Web, 2015

Enabling Adaptive Scientific Workflows Via Trigger Detection.
Proceedings of the First Workshop on In Situ Infrastructures for Enabling Extreme-Scale Analysis and Visualization, 2015

Diamond Sampling for Approximate Maximum All-Pairs Dot-Product (MAD) Search.
Proceedings of the 2015 IEEE International Conference on Data Mining, 2015

Counting triangles in real-world graph streams: Dealing with repeated edges and time windows.
Proceedings of the 49th Asilomar Conference on Signals, Systems and Computers, 2015

Sublinear Algorithms for Extreme-Scale Data Analysis.
Proceedings of the Green in Software Engineering, 2015

2014
Counting Triangles in Massive Graphs with MapReduce.
SIAM J. Sci. Comput., 2014

A Scalable Generative Graph Model with Community Structure.
SIAM J. Sci. Comput., 2014

Wedge sampling for computing clustering coefficients and triangle counts on large graphs.
Stat. Anal. Data Min., 2014

High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461).
Dagstuhl Reports, 2014

Toward Using Surrogates to Accelerate Solution of Stochastic Electricity Grid Operations Problems.
CoRR, 2014

Accelerating Community Detection by Using K-core Subgraphs.
CoRR, 2014

2013
An in-depth analysis of stochastic Kronecker graphs.
J. ACM, 2013

On Clustering on Graphs with Multiple Edge Types.
Internet Math., 2013

On Reciprocity in Massively Multi-player Online Game Networks
CoRR, 2013

The importance of directed triangles with reciprocity: patterns and algorithms
CoRR, 2013

When a Graph is not so Simple: Counting Triangles in Multigraph Streams.
CoRR, 2013

Triadic Measures on Graphs: The Power of Wedge Sampling.
Proceedings of the 13th SIAM International Conference on Data Mining, 2013

A scalable null model for directed graphs matching all degree distributions: In, out, and reciprocal.
Proceedings of the 2nd IEEE Network Science Workshop, 2013

A provably-robust sampling method for generating colormaps of large data.
Proceedings of the IEEE Symposium on Large-Scale Data Analysis and Visualization, 2013

A space efficient streaming algorithm for triangle counting using the birthday paradox.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

Optimal bounded-degree approximations of joint distributions of networks of stochastic processes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Dynamics of trust reciprocation in multi-relational networks.
Proceedings of the Advances in Social Networks Analysis and Mining 2013, 2013

2012
Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs.
SIAM J. Sci. Comput., 2012

From the Birthday Paradox to a Practical Sublinear Space Streaming Algorithm for Triangle Counting
CoRR, 2012

A scalable directed graph model with reciprocal edges
CoRR, 2012

Degree Relations of Triangles in Real-world Networks and Models
CoRR, 2012

Fast Triangle Counting through Wedge Sampling
CoRR, 2012

N-k-e Survivable Power System Design
CoRR, 2012

Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs.
Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

The Similarity Between Stochastic Kronecker and Chung-Lu Graph Models.
Proceedings of the Twelfth SIAM International Conference on Data Mining, 2012

Degree relations of triangles in real-world networks and graph models.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011
Constructing and sampling graphs with a prescribed joint degree distribution.
ACM J. Exp. Algorithmics, 2011

Community structure and scale-free collections of Erdös-Rényi graphs
CoRR, 2011

An Implicit Optimization Approach for Survivable Network Design
CoRR, 2011

A Linear Approximation Algorithm for 2-Dimensional Vector Packing
CoRR, 2011

Hypergraph Partitioning through Vertex Separators on Graphs
CoRR, 2011

A Hitchhiker's Guide to Choosing Parameters of Stochastic Kronecker Graphs
CoRR, 2011

Latent Clustering on Graphs with Multiple Edge Types.
Proceedings of the Algorithms and Models for the Web Graph - 8th International Workshop, 2011

An In-depth Study of Stochastic Kronecker Graphs.
Proceedings of the 11th IEEE International Conference on Data Mining, 2011

Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains.
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

2010
Communication Requirements and Interconnect Optimization for High-End Scientific Applications.
IEEE Trans. Parallel Distributed Syst., 2010

Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid.
SIAM J. Optim., 2010

A Simulator for Large-Scale Parallel Computer Architectures.
Int. J. Distributed Syst. Technol., 2010

Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types.
Proceedings of the Algorithms and Models for the Web-Graph - 7th International Workshop, 2010

2008
One-dimensional partitioning for heterogeneous systems: Theory and practice.
J. Parallel Distributed Comput., 2008

Power System Extreme Event Detection: The Vulnerability Frontier.
Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

2007
Computing Criticality of Lines in Power Systems.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2007), 2007

Reconfigurable hybrid interconnection for static and dynamic scientific applications.
Proceedings of the 4th Conference on Computing Frontiers, 2007

2006
Combinatorial Parallel and Scientific Computing.
Proceedings of the Parallel Processing for Scientific Computing, 2006

2005
Improving Load Balance with Flexibly Assignable Tasks.
IEEE Trans. Parallel Distributed Syst., 2005

Compressing Bitmap Indices by Data Reorganization.
Proceedings of the 21st International Conference on Data Engineering, 2005

2004
Interprocessor Communication with Limited Memory.
IEEE Trans. Parallel Distributed Syst., 2004

Permuting Sparse Rectangular Matrices into Block-Diagonal Form.
SIAM J. Sci. Comput., 2004

Fast optimal load balancing algorithms for 1D partitioning.
J. Parallel Distributed Comput., 2004

2003
Compacting sequences with invariant transition frequencies.
ACM Trans. Design Autom. Electr. Syst., 2003

2002
Exploiting flexibly assignable work to improve load balance.
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

2001
Combinatorial Algorithms in Scientific Computing
PhD thesis, 2001

Communication Support for Adaptive Computation.
Proceedings of the Tenth SIAM Conference on Parallel Processing for Scientific Computing, 2001

Partitioning for Complex Objectives.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

2000
Interprocessor communication with memory constraints.
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

On Identifying Strongly Connected Components in Parallel.
Proceedings of the Parallel and Distributed Processing, 2000

1999
Improving Performance of Sparse Matrix-Vector Multiplication.
Proceedings of the ACM/IEEE Conference on Supercomputing, 1999

1998
Power invariant vector sequence compaction.
Proceedings of the 1998 IEEE/ACM International Conference on Computer-Aided Design, 1998

1997
Sparse matrix decomposition with optimal load balancing.
Proceedings of the Fourth International on High-Performance Computing, 1997

1996
An Effective Model to Decompose Linear Programs for Parallel Solution.
Proceedings of the Applied Parallel Computing, 1996

1995
Decomposing Linear Programs for Parallel Solution.
Proceedings of the Applied Parallel Computing, 1995


  Loading...