The Growth of Powers of a Nonnegative Matrix. - Shmuel Friedland; Hans Schneider (SIAM J. Algebraic Discret. Methods, 1980)

Regular subgraphs of almost regular graphs. - Noga Alon; Shmuel Friedland; Gil Kalai (J. Comb. Theory B, 1984)

Every 4-regular graph plus an edge contains a 3-regular subgraph. - Noga Alon; Shmuel Friedland; Gil Kalai (J. Comb. Theory B, 1984)

Coherent algebras and the graph isomorphism problem. - Shmuel Friedland (Discret. Appl. Math., 1989)

Every 7-regular digraph contains an even cycle. - Shmuel Friedland (J. Comb. Theory B, 1989)

Inverse Eigenvalue Problems for Symmetric Toeplitz Matrices. - Shmuel Friedland (SIAM J. Matrix Anal. Appl., 1992)

An Upper Bound for the Real Part of Nonmaximal Eigenvalues of Nonnegative Irreducible Matrices. - Shmuel Friedland; Leonid Gurvits (SIAM J. Matrix Anal. Appl., 1994)

Row Sums and Inverse Row Sums for Nonnegative Matrices. - Shmuel Friedland; Rohan Hemasinha; Hans Schneider; Jeffrey Stuart; James Weaver (SIAM J. Matrix Anal. Appl., 1994)

The Sparse Basis Problem and Multilinear Algebra. - Richard A. Brualdi; Shmuel Friedland; Alex Pothen (SIAM J. Matrix Anal. Appl., 1995)

On Cheeger-type inequalities for weighted graphs. - Shmuel Friedland; Reinhard Nabben (J. Graph Theory, 2002)

Normal Matrices and the Completion Problem. - Shmuel Friedland (SIAM J. Matrix Anal. Appl., 2002)

Multi-Dimensional Capacity, Pressure and Hausdorff Dimension. - Shmuel Friedland (Mathematical Systems Theory in Biology, Communications, Computation, and Finance, 2003)

Explicit construction of families of LDPC codes with no 4-cycles. - Jon-Lark Kim; Uri N. Peled; I. Perepelitsa; Vera Pless; Shmuel Friedland (IEEE Trans. Inf. Theory, 2004)

Theory of computation of multidimensional entropy with an application to the monomer-dimer problem. - Shmuel Friedland; Uri N. Peled (Adv. Appl. Math., 2005)

A New Approach to Generalized Singular Value Decomposition. - Shmuel Friedland (SIAM J. Matrix Anal. Appl., 2005)

An Algorithm for Missing Value Estimation for DNA Microarray Data. - Shmuel Friedland; Amir Niknejad; Mostafa Kaveh; Hossein Zare (ICASSP (2), 2006)

Fast Monte-Carlo low rank approximations for matrices. - Shmuel Friedland; Amir Niknejad; Mostafa Kaveh; Hossein Zare (SoSE, 2006)

A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs - Shmuel Friedland; Daniel Levy (CoRR, 2006)

Towards generic theory of data compression. - Anatoli Torokhti; Shmuel Friedland; Phil G. Howlett (ISIT, 2007)

FPRAS for computing a lower bound for weighted matching polynomial of graphs - Shmuel Friedland (CoRR, 2007)

Generalized Rank-Constrained Matrix Approximations. - Shmuel Friedland; Anatoli Torokhti (SIAM J. Matrix Anal. Appl., 2007)

The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence. - Noga Alon; Shmuel Friedland (Electron. J. Comb., 2008)

Minimum Rank of Matrices Described by a Graph or Pattern over the Rational, Real and Complex Numbers. - Avi Berman; Shmuel Friedland; Leslie Hogben; Uriel G. Rothblum; Bryan L. Shader (Electron. J. Comb., 2008)

On the First Eigenvalue of Bipartite Graphs. - Amitava Bhattacharya; Shmuel Friedland; Uri N. Peled (Electron. J. Comb., 2008)

On the Number of Matchings in Regular Graphs. - Shmuel Friedland; Elliot Krop; Klas Markström (Electron. J. Comb., 2008)

On the graph isomorphism problem - Shmuel Friedland (CoRR, 2008)

Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer-Dimer Entropy. - Shmuel Friedland; Leonid Gurvits (Comb. Probab. Comput., 2008)

Graph isomorphism and volumes of convex bodies - Shmuel Friedland (CoRR, 2009)

Towards theory of generic Principal Component Analysis. - Anatoli Torokhti; Shmuel Friedland (J. Multivar. Anal., 2009)

The 1-vertex transfer matrix and accurate estimation of channel capacity. - Shmuel Friedland; Per Håkan Lundow; Klas Markström (IEEE Trans. Inf. Theory, 2010)

Spectrum Management in Multiuser Cognitive Wireless Networks: Optimality and Algorithm. - Chee Wei Tan 001; Shmuel Friedland; Steven H. Low (IEEE J. Sel. Areas Commun., 2011)

Local extrema of entropy functions under tensor products. - Shmuel Friedland; Gilad Gour; Aidan Roy (Quantum Inf. Comput., 2011)

Nonnegative Matrix Inequalities and their Application to Nonconvex Power Control Optimization. - Chee Wei Tan 001; Shmuel Friedland; Steven H. Low (SIAM J. Matrix Anal. Appl., 2011)

Generalized tensor compressive sensing. - Qun Li 003; Dan Schonfeld; Shmuel Friedland (ICME, 2013)

Upper Bounds for Perfect Matchings in Pfaffian and Planar Graphs. - Afshin Behmaram; Shmuel Friedland (Electron. J. Comb., 2013)

On best rank one approximation of tensors. - Shmuel Friedland; Volker Mehrmann; Renato Pajarola; Susanne K. Suter (Numer. Linear Algebra Appl., 2013)

The Minimum Entropy Output of a Quantum Channel Is Locally Additive. - Gilad Gour; Shmuel Friedland (IEEE Trans. Inf. Theory, 2013)

Computational Complexity of Tensor Nuclear Norm. - Shmuel Friedland; Lek-Heng Lim (CoRR, 2014)

Two algorithms for compressed sensing of sparse tensors. - Shmuel Friedland; Qun Li 003; Dan Schonfeld; Edgar A. Bernal (CoRR, 2014)

The Number of Singular Vector Tuples and Uniqueness of Best Rank-One Approximation of Tensors. - Shmuel Friedland; Giorgio Ottaviani (Found. Comput. Math., 2014)

Compressive Sensing of Sparse Tensors. - Shmuel Friedland; Qun Li 003; Dan Schonfeld (IEEE Trans. Image Process., 2014)

Matrices - Algebra, Analysis and Applications - Shmuel Friedland (Matrices, 2015)

A Simple Spectral Algorithm for Recovering Planted Partitions. - Sam Cole; Shmuel Friedland; Lev Reyzin (CoRR, 2015)

Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges. - M. Aghabali; Saieed Akbari; Shmuel Friedland; Klas Markström; Zakeieh Tajfirouz (Eur. J. Comb., 2015)

Matchings in m-generalized fullerene graphs. - Afshin Behmaram; Tomislav Doslic; Shmuel Friedland (Ars Math. Contemp., 2016)

The Computational Complexity of Duality. - Shmuel Friedland; Lek-Heng Lim (SIAM J. Optim., 2016)

Remarks on the Symmetric Rank of Symmetric Tensors. - Shmuel Friedland (SIAM J. Matrix Anal. Appl., 2016)

Nuclear norm of higher-order tensors. - Shmuel Friedland; Lek-Heng Lim (Math. Comput., 2018)

Partial minimization of strict convex functions and tensor scaling. - Shmuel Friedland (CoRR, 2019)

Grothendieck constant is norm of Strassen matrix multiplication tensor. - Shmuel Friedland; Lek-Heng Lim; Jinjie Zhang (Numerische Mathematik, 2019)

Symmetric Grothendieck inequality. - Shmuel Friedland; Lek-Heng Lim (CoRR, 2020)

Tensor optimal transport, distance between sets of measures and tensor scaling. - Shmuel Friedland (CoRR, 2020)

Spectral norm of a symmetric tensor and its computation. - Shmuel Friedland; Li Wang 033 (Math. Comput., 2020)

Special Issue: Polynomial and Tensor Optimization. - Shmuel Friedland; Jean-Bernard Lasserre; Lek-Heng Lim; Jiawang Nie (Math. Program., 2022)

Bit-complexity estimates in geometric programming, and application to the polynomial-time computation of the spectral radius of nonnegative tensors. - Shmuel Friedland; Stéphane Gaubert (CoRR, 2023)

A semidefinite programming characterization of the Crawford number. - Shmuel Friedland; Cynthia Vinzant (CoRR, 2024)

On Semidefinite Programming Characterizations of the Numerical Radius and Its Dual Norm. - Shmuel Friedland; Chi-Kwong Li (SIAM J. Matrix Anal. Appl., 2024)