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
- Using Triangles to Improve Community Detection
in Directed Networks (with C. Klymko and D. Gleich), to
appear in ASE BigDataScience, May 2014
- A Scalable
Generative Graph Model with Community Structure (with A.
Pinar, T. Plantenga, and C. Seshadrhi), accepted to SISC,
Community Detection by Using K-core Subgraphs (with C. Peng
and A. Pinar), arXiv:1403.2226, Mar. 2014
- Wedge Sampling for
Computing Clustering Coefficients and Triangle Counts on Large Graphs
(with C. Seshadrhi and A. Pinar), accepted to Statistical
Analysis and Data Mining, Feb. 2014
- Counting Triangles
in Massive Graphs with MapReduce (with A. Pinar, T.
Plantenga, C. Seshadrhi, and C. Task), accepted to SISC,
Closure Measures for Networks with Reciprocity (with C.
Seshadrhi, A. Pinar, and N. Durak), arXiv:1302.6220v1, Sep. 2013
- An In-Depth Analysis
of Stochastic Kronecker Graphs (with C. Seshadrhi and A.
Pinar), JACM 60(2), Apr. 2013
- Dynamics of Trust
Reciprocation in Heterogenous MMOG Networks (with K. Subbian,
A. Singhal, A. Pinar, and J. Srivastava), ASONAM,
- A Scalable Null Model
for Directed Graphs Matching All Degree Distributions: In, Out, and
Reciprocal (with N. Durak, A. Pinar, and C. Seshadhri), NSW,
- Triadic Measures on
Graphs: The Power of Wedge Sampling (with C. Seshadrhi and A.
Pinar), SDM13, Apr. 2013 (best paper prize)
- Degree Relations of
Triangles in Real-world Networks and Models (with N. Durak,
A. Pinar, and C. Seshadhri), CIKM'12, Nov. 2012
- 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
- Exploiting Symmetry
in Tensors for High Performance (with M. Schatz, T.-M. Low,
and R. A. van de Geijn), accepted to SISC, Mar. 2014
- An Adaptive Shifted Power
Method for Computing Generalized Tensor Eigenpairs (with J.
Mayo), arXiv:1401.1183v1, Jan. 2104
Optimization for Nonnegative Tensor Factorizations (with S.
Hansen and T. Plantenga), arXiv:1304.4964v2, Dec. 2013
- On Tensors, Sparsity,
and Nonnegative Factorizations (with E. Chi), SIMAX,
33(4):1272-1299, 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: