The SCEAS System
Navigation Menu

Search the dblp DataBase


Shmuel Friedland: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Shmuel Friedland
    Every 7-regular digraph contains an even cycle. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:46, n:2, pp:249-252 [Journal]
  2. Jon-Lark Kim, Uri N. Peled, I. Perepelitsa, Vera Pless, Shmuel Friedland
    Explicit construction of families of LDPC codes with no 4-cycles. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:10, pp:2378-2388 [Journal]
  3. 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]
  4. Shmuel Friedland, Daniel Levy
    A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  5. Fast Monte-Carlo Low Rank Approximations for Matrices [Citation Graph (, )][DBLP]

  6. On the graph isomorphism problem [Citation Graph (, )][DBLP]

  7. Graph isomorphism and volumes of convex bodies [Citation Graph (, )][DBLP]

  8. Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer-Dimer Entropy. [Citation Graph (, )][DBLP]

  9. Coherent algebras and the graph isomorphism problem. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002