 | 2008 |
|---|
| 8 |       | Shmuel Friedland:
On the graph isomorphism problem
CoRR abs/0801.0398: (2008) |
| 7 | | 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) |
| 2007 |
|---|
| 6 | | Shmuel Friedland:
FPRAS for computing a lower bound for weighted matching polynomial of graphs
CoRR abs/cs/0703029: (2007) |
| 2006 |
|---|
| 5 | | Shmuel Friedland,
Daniel Levy:
A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs
CoRR abs/cs/0607135: (2006) |
| 2005 |
|---|
| 4 | | Shmuel Friedland,
Mostafa Kaveh,
Amir Niknejad,
Hossein Zare:
Fast Monte-Carlo Low Rank Approximations for Matrices
CoRR abs/math/0510573: (2005) |
| 2004 |
|---|
| 3 |  | 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 |
|---|
| 2 | | Shmuel Friedland:
Coherent algebras and the graph isomorphism problem.
Discrete Applied Mathematics 25(1-2): 73-98 (1989) |
| 1 | | Shmuel Friedland:
Every 7-regular digraph contains an even cycle.
J. Comb. Theory, Ser. B 46(2): 249-252 (1989) |
