Shmuel Friedland

List of publications from the DBLP Bibliography Server - FAQ

2008

6 EE Shmuel Friedland: On the graph isomorphism problem CoRR abs/0801.0398: (2008)

2007

5 EE Shmuel Friedland: FPRAS for computing a lower bound for weighted matching polynomial of graphs CoRR abs/cs/0703029: (2007)

2006

4 EE Shmuel Friedland, Daniel Levy: A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs CoRR abs/cs/0607135: (2006)

2005

3 EE Shmuel Friedland, Mostafa Kaveh, Amir Niknejad, Hossein Zare: Fast Monte-Carlo Low Rank Approximations for Matrices CoRR abs/math/0510573: (2005)

2004

2 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

1 EE Shmuel Friedland: Every 7-regular digraph contains an even cycle. J. Comb. Theory, Ser. B 46(2): 249-252 (1989)

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

Coauthor Index