
Search the dblp DataBase
Shmuel Friedland:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Shmuel Friedland
Every 7regular digraph contains an even cycle. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1989, v:46, n:2, pp:249252 [Journal]
 JonLark Kim, Uri N. Peled, I. Perepelitsa, Vera Pless, Shmuel Friedland
Explicit construction of families of LDPC codes with no 4cycles. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2004, v:50, n:10, pp:23782388 [Journal]
 Shmuel Friedland
FPRAS for computing a lower bound for weighted matching polynomial of graphs [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp: [Journal]
 Shmuel Friedland, Daniel Levy
A polynomialtime approximation algorithm for the number of kmatchings in bipartite graphs [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp: [Journal]
Fast MonteCarlo Low Rank Approximations for Matrices [Citation Graph (, )][DBLP]
On the graph isomorphism problem [Citation Graph (, )][DBLP]
Graph isomorphism and volumes of convex bodies [Citation Graph (, )][DBLP]
Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the MonomerDimer Entropy. [Citation Graph (, )][DBLP]
Coherent algebras and the graph isomorphism problem. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
