Tamara (Tammy) Kolda is a Distinguished Member of Technical
Staff in the Informatics and Systems Assessments department at Sandia
National Laboratories in Livermore, California. Her research interests
include multilinear algebra and tensor decompositions, graph models and
algorithms, data mining, optimization, nonlinear solvers, parallel
computing and the design of scientific software. Tamara has received
SDM2013 and ICDM2008 Best Paper Prizes and a 2003 Presidential Early
Career Award for Scientists and Engineers (PECASE). She currently
serves on the SIAM Board of Trustees, as Section Editor for the
Software and High Performance Computing Section of SISC, and as
Associate Editor for SIMAX. More...
Or see full CV...
Selected Papers: [Click here for complete publication
list with abstracts]
Recent Papers on Graphs
in Massive Graphs with MapReduce (with A. Pinar, T.
Plantenga, C. Seshadrhi, and C. Task),
SISC 36(5), Nov. 2014
A Scalable Generative Graph Model with Community Structure
(with A. Pinar, T. Plantenga, and C. Seshadrhi),
SISC 36(5), Sep. 2014
Wedge Sampling for
Computing Clustering Coefficients and Triangle Counts on Large Graphs
(with C. Seshadrhi and A. Pinar), Statistical
Analysis and Data Mining 7(4), Aug. 2014
Using Triangles to Improve Community Detection
in Directed Networks (with C. Klymko and D. Gleich),
in ASE BigDataScience, May 2014
Community Detection by Using K-core Subgraphs
(with C. Peng and A. Pinar), arXiv:1403.2226, Mar. 2014
Closure Measures for Networks with Reciprocity (with C.
Seshadrhi, A. Pinar, and N. Durak), arXiv:1302.6220, Sep. 2013
- An In-Depth Analysis
of Stochastic Kronecker Graphs (with C. Seshadrhi and A.
Pinar), JACM 60(2), Apr. 2013
- Triadic Measures on
Graphs: The Power of Wedge Sampling (with C. Seshadrhi and A.
Pinar), SDM13, Apr. 2013 (best paper prize)
- Community structure
and scale-free collections of Erdös-Rényi graphs (with C.
Seshadrhi and A. Pinar), Phys. Rev. E 85(5), May
- The Similarity
between Stochastic Kronecker and Chung-Lu Graph Models (with
A. Pinar and C. Seshadrhi), SDM12, Apr. 2012
Recent Papers on Tensors
Symmetric Orthogonal Tensor Decomposition is Trivial,
arXiv:1503.01375, Mar. 2015
Optimization for Symmetric Tensor Decomposition, Math. Prog. B,
accepted Feb. 2014
Optimization for Nonnegative Tensor Factorizations (with S.
Hansen and T. Plantenga), OMS, accepted Jan. 2015
An Adaptive Shifted Power
Method for Computing Generalized Tensor Eigenpairs (with J.
Mayo), SIMAX 35(4), Dec. 2014
in Tensors for High Performance (with M. Schatz, T.-M. Low,
and R. A. van de Geijn), SISC 36(5), Sep. 2014
- On Tensors, Sparsity,
and Nonnegative Factorizations (with E. Chi),
SIMAX, 33(4), Dec. 2012
Decompositions and Applications (with B. W. Bader), SIREV,
51(3):455-500, Sep. 2009
862: MATLAB Tensor Classes for Fast Algorithm Prototyping
(with B. Bader), ACM TOMS 32(4):635-653, Dec. 2006
Overview of the Trilinos Project (with M. Heroux et al.), ACM
TOMS 31(3):397-423, Sep. 2011
- Optimization by
Direct Search: New Perspectives on Some Classical and Modern Methods
(with R. M. Lewis and V. Torczon), SIREV
45(3):385-482, Aug. 2003
- Orthogonal Tensor
Decompositions, SIMAX 23(1):243-255, July
Partitioning Models for Parallel Computing (with B.
Hendrickson), Parallel Computing 26(12):1519-1534,
- A Semidiscrete
Matrix Decomposition for Latent Semantic Indexing Information Retrieval
(with D. P. O'Leary), ACM TOIS 16(4):322-346, Oct.
Current Professional Service: