Shmuel Friedland

Orcid: 0000-0002-0423-5005

According to our database1, Shmuel Friedland authored at least 57 papers between 1980 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Semidefinite Programming Characterizations of the Numerical Radius and Its Dual Norm.
SIAM J. Matrix Anal. Appl., 2024

A semidefinite programming characterization of the Crawford number.
CoRR, 2024

2023
Bit-complexity estimates in geometric programming, and application to the polynomial-time computation of the spectral radius of nonnegative tensors.
CoRR, 2023

2022
Special Issue: Polynomial and Tensor Optimization.
Math. Program., 2022

2020
Spectral norm of a symmetric tensor and its computation.
Math. Comput., 2020

Tensor optimal transport, distance between sets of measures and tensor scaling.
CoRR, 2020

Symmetric Grothendieck inequality.
CoRR, 2020

2019
Grothendieck constant is norm of Strassen matrix multiplication tensor.
Numerische Mathematik, 2019

Partial minimization of strict convex functions and tensor scaling.
CoRR, 2019

2018
Nuclear norm of higher-order tensors.
Math. Comput., 2018

2016
Remarks on the Symmetric Rank of Symmetric Tensors.
SIAM J. Matrix Anal. Appl., 2016

The Computational Complexity of Duality.
SIAM J. Optim., 2016

Matchings in m-generalized fullerene graphs.
Ars Math. Contemp., 2016

2015
Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges.
Eur. J. Comb., 2015

A Simple Spectral Algorithm for Recovering Planted Partitions.
CoRR, 2015

Matrices - Algebra, Analysis and Applications
WorldScientific, ISBN: 9789814667982, 2015

2014
Compressive Sensing of Sparse Tensors.
IEEE Trans. Image Process., 2014

The Number of Singular Vector Tuples and Uniqueness of Best Rank-One Approximation of Tensors.
Found. Comput. Math., 2014

Two algorithms for compressed sensing of sparse tensors.
CoRR, 2014

Computational Complexity of Tensor Nuclear Norm.
CoRR, 2014

2013
The Minimum Entropy Output of a Quantum Channel Is Locally Additive.
IEEE Trans. Inf. Theory, 2013

On best rank one approximation of tensors.
Numer. Linear Algebra Appl., 2013

Upper Bounds for Perfect Matchings in Pfaffian and Planar Graphs.
Electron. J. Comb., 2013

Generalized tensor compressive sensing.
Proceedings of the 2013 IEEE International Conference on Multimedia and Expo, 2013

2011
Nonnegative Matrix Inequalities and their Application to Nonconvex Power Control Optimization.
SIAM J. Matrix Anal. Appl., 2011

Local extrema of entropy functions under tensor products.
Quantum Inf. Comput., 2011

Spectrum Management in Multiuser Cognitive Wireless Networks: Optimality and Algorithm.
IEEE J. Sel. Areas Commun., 2011

2010
The 1-vertex transfer matrix and accurate estimation of channel capacity.
IEEE Trans. Inf. Theory, 2010

2009
Towards theory of generic Principal Component Analysis.
J. Multivar. Anal., 2009

Graph isomorphism and volumes of convex bodies
CoRR, 2009

2008
Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer-Dimer Entropy.
Comb. Probab. Comput., 2008

On the graph isomorphism problem
CoRR, 2008

On the Number of Matchings in Regular Graphs.
Electron. J. Comb., 2008

On the First Eigenvalue of Bipartite Graphs.
Electron. J. Comb., 2008

Minimum Rank of Matrices Described by a Graph or Pattern over the Rational, Real and Complex Numbers.
Electron. J. Comb., 2008

The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence.
Electron. J. Comb., 2008

2007
Generalized Rank-Constrained Matrix Approximations.
SIAM J. Matrix Anal. Appl., 2007

FPRAS for computing a lower bound for weighted matching polynomial of graphs
CoRR, 2007

Towards generic theory of data compression.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs
CoRR, 2006

Fast Monte-Carlo low rank approximations for matrices.
Proceedings of the 1st IEEE/SMC International Conference on System of Systems Engineering, 2006

An Algorithm for Missing Value Estimation for DNA Microarray Data.
Proceedings of the 2006 IEEE International Conference on Acoustics Speech and Signal Processing, 2006

2005
A New Approach to Generalized Singular Value Decomposition.
SIAM J. Matrix Anal. Appl., 2005

Theory of computation of multidimensional entropy with an application to the monomer-dimer problem.
Adv. Appl. Math., 2005

2004
Explicit construction of families of LDPC codes with no 4-cycles.
IEEE Trans. Inf. Theory, 2004

2003
Multi-Dimensional Capacity, Pressure and Hausdorff Dimension.
Proceedings of the Mathematical Systems Theory in Biology, 2003

2002
Normal Matrices and the Completion Problem.
SIAM J. Matrix Anal. Appl., 2002

On Cheeger-type inequalities for weighted graphs.
J. Graph Theory, 2002

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

1994
Row Sums and Inverse Row Sums for Nonnegative Matrices.
SIAM J. Matrix Anal. Appl., October, 1994

An Upper Bound for the Real Part of Nonmaximal Eigenvalues of Nonnegative Irreducible Matrices.
SIAM J. Matrix Anal. Appl., July, 1994

1992
Inverse Eigenvalue Problems for Symmetric Toeplitz Matrices.
SIAM J. Matrix Anal. Appl., 1992

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

Coherent algebras and the graph isomorphism problem.
Discret. Appl. Math., 1989

1984
Every 4-regular graph plus an edge contains a 3-regular subgraph.
J. Comb. Theory B, 1984

Regular subgraphs of almost regular graphs.
J. Comb. Theory B, 1984

1980
The Growth of Powers of a Nonnegative Matrix.
SIAM J. Algebraic Discret. Methods, 1980


  Loading...