default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShmuel Friedland
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j39]Shmuel Friedland
, Chi-Kwong Li:
On Semidefinite Programming Characterizations of the Numerical Radius and Its Dual Norm. SIAM J. Matrix Anal. Appl. 45(3): 1414-1428 (2024)- [i16]Shmuel Friedland, Cynthia Vinzant:
A semidefinite programming characterization of the Crawford number. CoRR abs/2403.08617 (2024) - 2023
- [i15]Shmuel Friedland, Stéphane Gaubert:
Bit-complexity estimates in geometric programming, and application to the polynomial-time computation of the spectral radius of nonnegative tensors. CoRR abs/2301.10637 (2023) - [i14]Shmuel Friedland, Chi-Kwong Li:
On a semidefinite programming characterizations of the numerical radius and its dual norm. CoRR abs/2308.07287 (2023) - 2022
- [j38]Shmuel Friedland, Jean-Bernard Lasserre, Lek-Heng Lim, Jiawang Nie:
Special Issue: Polynomial and Tensor Optimization. Math. Program. 193(2): 511-512 (2022) - 2020
- [j37]Shmuel Friedland, Li Wang:
Spectral norm of a symmetric tensor and its computation. Math. Comput. 89(325): 2175-2215 (2020) - [i13]Shmuel Friedland, Lek-Heng Lim:
Symmetric Grothendieck inequality. CoRR abs/2003.07345 (2020) - [i12]Shmuel Friedland:
Tensor optimal transport, distance between sets of measures and tensor scaling. CoRR abs/2005.00945 (2020)
2010 – 2019
- 2019
- [j36]Shmuel Friedland, Lek-Heng Lim, Jinjie Zhang:
Grothendieck constant is norm of Strassen matrix multiplication tensor. Numerische Mathematik 143(4): 905-922 (2019) - [i11]Shmuel Friedland:
Partial minimization of strict convex functions and tensor scaling. CoRR abs/1905.11384 (2019) - 2018
- [j35]Shmuel Friedland, Lek-Heng Lim:
Nuclear norm of higher-order tensors. Math. Comput. 87(311): 1255-1281 (2018) - 2016
- [j34]Afshin Behmaram, Tomislav Doslic, Shmuel Friedland:
Matchings in m-generalized fullerene graphs. Ars Math. Contemp. 11(2): 301-313 (2016) - [j33]Shmuel Friedland, Lek-Heng Lim:
The Computational Complexity of Duality. SIAM J. Optim. 26(4): 2378-2393 (2016) - [j32]Shmuel Friedland:
Remarks on the Symmetric Rank of Symmetric Tensors. SIAM J. Matrix Anal. Appl. 37(1): 320-337 (2016) - [i10]Shmuel Friedland, Lek-Heng Lim:
The Computational Complexity of Duality. CoRR abs/1601.07629 (2016) - 2015
- [b1]Shmuel Friedland:
Matrices - Algebra, Analysis and Applications. WorldScientific 2015, ISBN 9789814667968, pp. 1-596 - [j31]M. Aghabali, Saieed Akbari, Shmuel Friedland, Klas Markström, Zakeieh Tajfirouz:
Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges. Eur. J. Comb. 45: 132-144 (2015) - [i9]Sam Cole, Shmuel Friedland, Lev Reyzin:
A Simple Spectral Algorithm for Recovering Planted Partitions. CoRR abs/1503.00423 (2015) - 2014
- [j30]Shmuel Friedland, Giorgio Ottaviani:
The Number of Singular Vector Tuples and Uniqueness of Best Rank-One Approximation of Tensors. Found. Comput. Math. 14(6): 1209-1242 (2014) - [j29]Shmuel Friedland, Qun Li, Dan Schonfeld:
Compressive Sensing of Sparse Tensors. IEEE Trans. Image Process. 23(10): 4438-4447 (2014) - [i8]Shmuel Friedland, Qun Li, Dan Schonfeld, Edgar A. Bernal:
Two algorithms for compressed sensing of sparse tensors. CoRR abs/1404.1506 (2014) - [i7]Shmuel Friedland, Lek-Heng Lim:
Computational Complexity of Tensor Nuclear Norm. CoRR abs/1410.6072 (2014) - 2013
- [j28]Afshin Behmaram, Shmuel Friedland:
Upper Bounds for Perfect Matchings in Pfaffian and Planar Graphs. Electron. J. Comb. 20(1): 64 (2013) - [j27]Shmuel Friedland, Volker Mehrmann, Renato Pajarola, Susanne K. Suter:
On best rank one approximation of tensors. Numer. Linear Algebra Appl. 20(6): 942-955 (2013) - [j26]Gilad Gour, Shmuel Friedland:
The Minimum Entropy Output of a Quantum Channel Is Locally Additive. IEEE Trans. Inf. Theory 59(1): 603-614 (2013) - [c4]Qun Li, Dan Schonfeld, Shmuel Friedland:
Generalized tensor compressive sensing. ICME 2013: 1-6 - [i6]Shmuel Friedland, Qun Li, Dan Schonfeld:
Generalized Tensor Compressive Sensing. CoRR abs/1305.5777 (2013) - 2011
- [j25]Chee Wei Tan, Shmuel Friedland, Steven H. Low:
Spectrum Management in Multiuser Cognitive Wireless Networks: Optimality and Algorithm. IEEE J. Sel. Areas Commun. 29(2): 421-430 (2011) - [j24]Shmuel Friedland, Gilad Gour, Aidan Roy:
Local extrema of entropy functions under tensor products. Quantum Inf. Comput. 11(11-12): 1028-1044 (2011) - [j23]Chee Wei Tan, Shmuel Friedland, Steven H. Low:
Nonnegative Matrix Inequalities and their Application to Nonconvex Power Control Optimization. SIAM J. Matrix Anal. Appl. 32(3): 1030-1055 (2011) - 2010
- [j22]Shmuel Friedland, Per Håkan Lundow, Klas Markström:
The 1-vertex transfer matrix and accurate estimation of channel capacity. IEEE Trans. Inf. Theory 56(8): 3692-3699 (2010)
2000 – 2009
- 2009
- [j21]Anatoli Torokhti, Shmuel Friedland:
Towards theory of generic Principal Component Analysis. J. Multivar. Anal. 100(4): 661-669 (2009) - [i5]Shmuel Friedland:
Graph isomorphism and volumes of convex bodies. CoRR abs/0911.1739 (2009) - 2008
- [j20]Noga Alon, Shmuel Friedland:
The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence. Electron. J. Comb. 15(1) (2008) - [j19]Avi Berman, Shmuel Friedland, Leslie Hogben, Uriel G. Rothblum, Bryan L. Shader:
Minimum Rank of Matrices Described by a Graph or Pattern over the Rational, Real and Complex Numbers. Electron. J. Comb. 15(1) (2008) - [j18]Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled:
On the First Eigenvalue of Bipartite Graphs. Electron. J. Comb. 15(1) (2008) - [j17]Shmuel Friedland, Elliot Krop, Klas Markström:
On the Number of Matchings in Regular Graphs. Electron. J. Comb. 15(1) (2008) - [j16]Shmuel Friedland, Leonid Gurvits:
Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer-Dimer Entropy. Comb. Probab. Comput. 17(3): 347-361 (2008) - [i4]Shmuel Friedland:
On the graph isomorphism problem. CoRR abs/0801.0398 (2008) - 2007
- [j15]Shmuel Friedland, Anatoli Torokhti:
Generalized Rank-Constrained Matrix Approximations. SIAM J. Matrix Anal. Appl. 29(2): 656-659 (2007) - [c3]Anatoli Torokhti, Shmuel Friedland, Phil G. Howlett:
Towards generic theory of data compression. ISIT 2007: 291-295 - [i3]Shmuel Friedland:
FPRAS for computing a lower bound for weighted matching polynomial of graphs. CoRR abs/cs/0703029 (2007) - 2006
- [c2]Shmuel Friedland, Amir Niknejad, Mostafa Kaveh, Hossein Zare:
An Algorithm for Missing Value Estimation for DNA Microarray Data. ICASSP (2) 2006: 1092-1095 - [c1]Shmuel Friedland, Amir Niknejad, Mostafa Kaveh, Hossein Zare:
Fast Monte-Carlo low rank approximations for matrices. SoSE 2006: 1-6 - [i2]Shmuel Friedland, Daniel Levy:
A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs. CoRR abs/cs/0607135 (2006) - 2005
- [j14]Shmuel Friedland, Uri N. Peled:
Theory of computation of multidimensional entropy with an application to the monomer-dimer problem. Adv. Appl. Math. 34(3): 486-522 (2005) - [j13]Shmuel Friedland:
A New Approach to Generalized Singular Value Decomposition. SIAM J. Matrix Anal. Appl. 27(2): 434-444 (2005) - [i1]Shmuel Friedland, Mostafa Kaveh, Amir Niknejad, Hossein Zare:
Fast Monte-Carlo Low Rank Approximations for Matrices. CoRR abs/math/0510573 (2005) - 2004
- [j12]Jon-Lark Kim, Uri N. Peled, I. Perepelitsa, Vera Pless, Shmuel Friedland:
Explicit construction of families of LDPC codes with no 4-cycles. IEEE Trans. Inf. Theory 50(10): 2378-2388 (2004) - 2003
- [p1]Shmuel Friedland:
Multi-Dimensional Capacity, Pressure and Hausdorff Dimension. Mathematical Systems Theory in Biology, Communications, Computation, and Finance 2003: 183-222 - 2002
- [j11]Shmuel Friedland, Reinhard Nabben:
On Cheeger-type inequalities for weighted graphs. J. Graph Theory 41(1): 1-17 (2002) - [j10]Shmuel Friedland:
Normal Matrices and the Completion Problem. SIAM J. Matrix Anal. Appl. 23(3): 896-902 (2002)
1990 – 1999
- 1995
- [j9]Richard A. Brualdi, Shmuel Friedland, Alex Pothen:
The Sparse Basis Problem and Multilinear Algebra. SIAM J. Matrix Anal. Appl. 16(1): 1-20 (1995) - 1994
- [j8]Shmuel Friedland, Leonid Gurvits:
An Upper Bound for the Real Part of Nonmaximal Eigenvalues of Nonnegative Irreducible Matrices. SIAM J. Matrix Anal. Appl. 15(3): 1015-1017 (1994) - [j7]Shmuel Friedland, Rohan Hemasinha, Hans Schneider, Jeffrey Stuart, James Weaver:
Row Sums and Inverse Row Sums for Nonnegative Matrices. SIAM J. Matrix Anal. Appl. 15(4): 1157-1166 (1994) - 1992
- [j6]Shmuel Friedland:
Inverse Eigenvalue Problems for Symmetric Toeplitz Matrices. SIAM J. Matrix Anal. Appl. 13(4): 1142-1153 (1992)
1980 – 1989
- 1989
- [j5]Shmuel Friedland:
Coherent algebras and the graph isomorphism problem. Discret. Appl. Math. 25(1-2): 73-98 (1989) - [j4]Shmuel Friedland:
Every 7-regular digraph contains an even cycle. J. Comb. Theory B 46(2): 249-252 (1989) - 1984
- [j3]Noga Alon, Shmuel Friedland, Gil Kalai:
Regular subgraphs of almost regular graphs. J. Comb. Theory B 37(1): 79-91 (1984) - [j2]Noga Alon, Shmuel Friedland, Gil Kalai:
Every 4-regular graph plus an edge contains a 3-regular subgraph. J. Comb. Theory B 37(1): 92-93 (1984) - 1980
- [j1]Shmuel Friedland, Hans Schneider:
The Growth of Powers of a Nonnegative Matrix. SIAM J. Algebraic Discret. Methods 1(2): 185-200 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
