 | 2011 |
| 21 |  | Chee Wei Tan,
Shmuel Friedland,
Steven H. Low:
Spectrum Management in Multiuser Cognitive Wireless Networks: Optimality and Algorithm.
IEEE Journal on Selected Areas in Communications 29(2): 421-430 (2011) |
| 20 |  | Chee Wei Tan,
Shmuel Friedland,
Steven H. Low:
Nonnegative Matrix Inequalities and their Application to Nonconvex Power Control Optimization.
SIAM J. Matrix Analysis Applications 32(3): 1030-1055 (2011) |
| 2010 |
| 19 |  | Shmuel Friedland,
Per Håkan Lundow,
Klas Markström:
The 1-vertex transfer matrix and accurate estimation of channel capacity.
IEEE Transactions on Information Theory 56(8): 3692-3699 (2010) |
| 2009 |
| 18 |  | Shmuel Friedland:
Graph isomorphism and volumes of convex bodies
CoRR abs/0911.1739: (2009) |
| 17 |  | Anatoli Torokhti,
Shmuel Friedland:
Towards theory of generic Principal Component Analysis.
J. Multivariate Analysis 100(4): 661-669 (2009) |
| 2008 |
| 16 |  | Shmuel Friedland:
On the graph isomorphism problem
CoRR abs/0801.0398: (2008) |
| 15 |  | Shmuel Friedland,
Leonid Gurvits:
Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer-Dimer Entropy.
Combinatorics, Probability & Computing 17(3): 347-361 (2008) |
| 14 |  | 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.
Electr. J. Comb. 15(1): (2008) |
| 13 |  | Amitava Bhattacharya,
Shmuel Friedland,
Uri N. Peled:
On the First Eigenvalue of Bipartite Graphs.
Electr. J. Comb. 15(1): (2008) |
| 12 |  | Shmuel Friedland,
E. Krop,
Klas Markström:
On the Number of Matchings in Regular Graphs.
Electr. J. Comb. 15(1): (2008) |
| 11 |  | Noga Alon,
Shmuel Friedland:
The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence.
Electr. J. Comb. 15(1): (2008) |
| 2007 |
| 10 |  | Shmuel Friedland:
FPRAS for computing a lower bound for weighted matching polynomial of graphs
CoRR abs/cs/0703029: (2007) |
| 9 |  | Shmuel Friedland,
Anatoli Torokhti:
Generalized Rank-Constrained Matrix Approximations.
SIAM J. Matrix Analysis Applications 29(2): 656-659 (2007) |
| 2006 |
| 8 |  | Shmuel Friedland,
Daniel Levy:
A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs
CoRR abs/cs/0607135: (2006) |
| 2005 |
| 7 |  | Shmuel Friedland,
Mostafa Kaveh,
Amir Niknejad,
Hossein Zare:
Fast Monte-Carlo Low Rank Approximations for Matrices
CoRR abs/math/0510573: (2005) |
| 6 |  | Shmuel Friedland:
A New Approach to Generalized Singular Value Decomposition.
SIAM J. Matrix Analysis Applications 27(2): 434-444 (2005) |
| 2004 |
| 5 |  | Jon-Lark Kim,
Uri N. Peled,
I. Perepelitsa,
Vera Pless,
Shmuel Friedland:
Explicit construction of families of LDPC codes with no 4-cycles.
IEEE Transactions on Information Theory 50(10): 2378-2388 (2004) |
| 1989 |
| 4 |  | Shmuel Friedland:
Coherent algebras and the graph isomorphism problem.
Discrete Applied Mathematics 25(1-2): 73-98 (1989) |
| 3 |  | Shmuel Friedland:
Every 7-regular digraph contains an even cycle.
J. Comb. Theory, Ser. B 46(2): 249-252 (1989) |
| 1984 |
| 2 |  | Noga Alon,
Shmuel Friedland,
Gil Kalai:
Regular subgraphs of almost regular graphs.
J. Comb. Theory, Ser. B 37(1): 79-91 (1984) |
| 1 |  | Noga Alon,
Shmuel Friedland,
Gil Kalai:
Every 4-regular graph plus an edge contains a 3-regular subgraph.
J. Comb. Theory, Ser. B 37(1): 92-93 (1984) |