Alex Pothen

Orcid: 0000-0002-3421-3325

Affiliations:
  • Purdue University, West Lafayette, IN, USA


According to our database1, Alex Pothen authored at least 87 papers between 1988 and 2024.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2022, "For contributions to and leadership in combinatorial scientific computing".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
GreedyML: A Parallel Algorithm for Maximizing Submodular Functions.
CoRR, 2024

2023
Dynamic Asset Allocation with Expected Shortfall via Quantum Annealing.
Entropy, March, 2023

Streaming Algorithms for Weighted k-Disjoint Matchings.
CoRR, 2023

AMG Preconditioners based on Parallel Hybrid Coarsening and Multi-objective Graph Matching.
Proceedings of the 31st Euromicro International Conference on Parallel, 2023

2022
A 2/3-approximation algorithm for vertex-weighted matching.
Discret. Appl. Math., 2022

Generative modeling of the enteric nervous system employing point pattern analysis and graph construction.
CoRR, 2022

A novel statistical methodology for quantifying the spatial arrangements of axons in peripheral nerves.
CoRR, 2022

VWC-BERT: Scaling Vulnerability-Weakness-Exploit Mapping on Modern AI Accelerators.
Proceedings of the IEEE International Conference on Big Data, 2022

2021
EXAGRAPH: Graph and combinatorial methods for enabling exascale applications.
Int. J. High Perform. Comput. Appl., 2021

A Parallel Approximation Algorithm for Maximizing Submodular b-Matching.
CoRR, 2021

V2W-BERT: A Framework for Effective Hierarchical Multiclass Classification of Software Vulnerabilities.
Proceedings of the 8th IEEE International Conference on Data Science and Advanced Analytics, 2021

A Parallel Approximation Algorithm for Maximizing Submodular <i>b</i>-Matching.
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020
AMPS: Real-time mesh cutting with augmented matrices for surgical simulations.
Numer. Linear Algebra Appl., 2020

Graphs with Tunable Chromatic Numbers for Parallel Coloring.
Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, 2020

A Parallel 2/3-Approximation Algorithm for Vertex-Weighted Matching.
Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, 2020

2019
A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs.
SIAM J. Sci. Comput., 2019

Approximation algorithms in combinatorial scientific computing.
Acta Numer., 2019

Mapping Arbitrarily Sparse Two-Body Interactions on One-Dimensional Quantum Circuits.
Proceedings of the 26th IEEE International Conference on High Performance Computing, 2019

Parallel algorithms through approximation: graphs, data privacy and machine learning.
Proceedings of the 16th ACM International Conference on Computing Frontiers, 2019

Close-Range Rendezvous with a Moving Target Spacecraft using Udwadia- Kalaba Equation.
Proceedings of the 2019 American Control Conference, 2019

2018
Using automatic differentiation for compressive sensing in uncertainty quantification.
Optim. Methods Softw., 2018

AMPS: A Real-time Mesh Cutting Algorithm for Surgical Simulations.
CoRR, 2018

New Approximation Algorithms for Minimum Weighted Edge Cover.
Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, 2018

Adaptive anonymization of data using b-edge cover.
Proceedings of the International Conference for High Performance Computing, 2018

Parallel Algorithms Through Approximation: B-Edge Cover.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Phenotyping Immune Cells in Tumor and Healthy Tissue Using Flow Cytometry Data.
Proceedings of the 2018 ACM International Conference on Bioinformatics, 2018

2017
Fast Parallel Stochastic Subspace Algorithms for Large-Scale Ambient Oscillation Monitoring.
IEEE Trans. Smart Grid, 2017

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting.
IEEE Trans. Parallel Distributed Syst., 2017

AMPS: An Augmented Matrix Formulation for Principal Submatrix Updates with Application to Power Grids.
SIAM J. Sci. Comput., 2017

Introduction to HiCOMB Workshop.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

2016
Interactively Cutting and Constraining Vertices in Meshes Using Augmented Matrices.
ACM Trans. Graph., 2016

Efficient Approximation Algorithms for Weighted b-Matching.
SIAM J. Sci. Comput., 2016

Capitalizing on <i>live</i> variables: new algorithms for efficient Hessian computation via automatic differentiation.
Math. Program. Comput., 2016

flowVS: channel-specific variance stabilization in flow cytometry.
BMC Bioinform., 2016

Edge Pushing is Equivalent to Vertex Elimination for Computing Hessians.
Proceedings of the 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, 2016

A New 3/2-Approximation Algorithm for the <i>b</i>-Edge Cover Problem.
Proceedings of the 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, 2016

Designing scalable <i>b</i>-Matching algorithms on distributed memory multiprocessors by approximation.
Proceedings of the International Conference for High Performance Computing, 2016

2015
Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures.
Computer, 2015

How to match in parallel: approximation algorithms and multicore machines.
Proceedings of the 5th Workshop on Irregular Applications - Architectures and Algorithms, 2015

PCO Keynote.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015

A Parallel Tree Grafting Algorithm for Maximum Cardinality Matching in Bipartite Graphs.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

2014
Immunophenotypes of Acute Myeloid Leukemia From Flow Cytometry Data Using Templates.
CoRR, 2014

2013
ColPack: Software for graph coloring and related problems in scientific computing.
ACM Trans. Math. Softw., 2013

Classifying Immunophenotypes With Templates From Flow Cytometry.
Proceedings of the ACM Conference on Bioinformatics, 2013

2012
Graph coloring algorithms for multi-core and massively multithreaded architectures.
Parallel Comput., 2012

Approximate weighted matching on emerging manycore and multithreaded architectures.
Int. J. High Perform. Comput. Appl., 2012

Graph Coloring Algorithms for Muti-core and Massively Multithreaded Architectures
CoRR, 2012

Matching phosphorylation response patterns of antigen-receptor-stimulated T cells via flow cytometry.
BMC Bioinform., 2012

A multithreaded algorithm for network alignment via approximate matching.
Proceedings of the SC Conference on High Performance Computing Networking, 2012

Multithreaded Algorithms for Matching in Graphs with Application to Data Analysis in Flow Cytometry.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

Multithreaded Algorithms for Maxmum Matching in Bipartite Graphs.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

2011
Computing maximum matching in parallel on bipartite graphs: worth the effort?
Proceedings of the first workshop on Irregular applications: architectures and algorithm, 2011

Distributed-Memory Parallel Algorithms for Matching and Coloring.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

New Multithreaded Ordering and Coloring Algorithms for Multicore Architectures.
Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

2010
Identifying Rare Cell Populations in Comparative Flow Cytometry.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

Discovering overlapping modules and bridge proteins in proteomic networks.
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, 2010

2009
Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation.
INFORMS J. Comput., 2009

Evaluation of Hierarchical Mesh Reorderings.
Proceedings of the Computational Science, 2009

2007
New Acyclic and Star Coloring Algorithms with Application to Computing Hessians.
SIAM J. Sci. Comput., 2007

2006
Combinatorial Scientific Computing: The Enabling Power of Discrete Algorithms in Computational Science.
Proceedings of the High Performance Computing for Computational Science, 2006

2005
What Color Is Your Jacobian? Graph Coloring for Computing Derivatives.
SIAM Rev., 2005

The Architecture of a Proteomic Network in the Yeast.
Proceedings of the Computational Life Sciences, First International Symposium, 2005

2004
Elimination Structures in Scientific Computing.
Proceedings of the Handbook of Data Structures and Applications., 2004

Computational protein biomarker prediction: a case study for prostate cancer.
BMC Bioinform., 2004

Oblio: Design and Performance.
Proceedings of the Applied Parallel Computing, 2004

A Hypergraph Model for the Yeast Protein Complex Network.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2002
Parallel Distance-k Coloring Algorithms for Numerical Optimization.
Proceedings of the Euro-Par 2002, 2002

2001
A Scalable Parallel Algorithm for Incomplete Factor Preconditioning.
SIAM J. Sci. Comput., 2001

The design of I/O-efficient sparse direct solvers.
Proceedings of the 2001 ACM/IEEE conference on Supercomputing, 2001

1999
Efficient Parallel Computation of ILU(k) Preconditioners.
Proceedings of the ACM/IEEE Conference on Supercomputing, 1999

Parallel Computation of ILU(k) Preconditioners Without Serial Bottlenecks.
Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, 1999

Object-Oriented Parallel Factorization for Sparse Symmetric Systems.
Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, 1999

1998
An Object-Oriented Collection of Minimum Degree Algorithms.
Proceedings of the Computing in Object-Oriented Parallel Environments, 1998

Object-Oriented Design for Sparse Direct Solvers.
Proceedings of the Computing in Object-Oriented Parallel Environments, 1998

1997
An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems.
SIAM J. Matrix Anal. Appl., July, 1997

1996
A robust and flexible microeconomic scheduler for parallel computers.
Proceedings of the 3rd International Conference on High Performance Computing, 1996

1995
The Sparse Basis Problem and Multilinear Algebra.
SIAM J. Matrix Anal. Appl., 1995

A spectral algorithm for envelope reduction of sparse matrices.
Numer. Linear Algebra Appl., 1995

A Microeconomic Scheduler for Parallel Computers.
Proceedings of the Job Scheduling Strategies for Parallel Processing, 1995

1994
Stability of the Partitioned Inverse Method for Parallel Solution of Sparse Triangular Systems.
SIAM J. Sci. Comput., 1994

1993
A Mapping Algorithm for Parallel Sparse Cholesky Factorization.
SIAM J. Sci. Comput., 1993

1992
A Fast Reordering Algorithm for Parallel Sparse Triangular Solution.
SIAM J. Sci. Comput., 1992

Towards a Fast Implementation of Spectral Nested Dissection.
Proceedings of the Proceedings Supercomputing '92, 1992

1991
Distributed Multifrontal Factorization Using Clique Trees.
Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing, 1991

1990
Computing the block triangular form of a sparse matrix.
ACM Trans. Math. Softw., 1990

1989
Spectral Algorithms for Ordering Sparse Matrices in Parallel.
Proceedings of the Fourth SIAM Conference on Parallel Processing for Scientific Computing, 1989

1988
Distributed orthogonal factorization.
Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications, 1988


  Loading...