On the entropy of DNA: Algorithms and measurements based on memory and rapid convergence M Farach, M Noordewier, S Savari, L Shepp, A Wyner, J Ziv Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, 48-57, 1995 | 115 | 1995 |

Edge-cut bounds on network coding rates G Kramer, SA Savari Journal of Network and Systems Management 14 (1), 49, 2006 | 112 | 2006 |

Redundancy of the Lempel-Ziv incremental parsing rule SA Savari IEEE Transactions on Information Theory 43 (1), 9-21, 1997 | 93 | 1997 |

Generalized Tunstall codes for sources with memory SA Savari, RG Gallager IEEE Transactions on Information Theory 43 (2), 658-668, 1997 | 84 | 1997 |

Finite termination of asynchronous iterative algorithms SA Savarí, DP Bertsekas Parallel Computing 22 (1), 39-56, 1996 | 55 | 1996 |

Functional source coding for networks with receiver side information H Feng, M Effros, S Savari Proceedings of the Allerton Conference on Communication, Control, and …, 2004 | 45 | 2004 |

Communicating probability distributions G Kramer, SA Savari IEEE Transactions on Information Theory 53 (2), 518-525, 2007 | 44 | 2007 |

Some notes on Varn coding SA Savari IEEE Transactions on Information Theory 40 (1), 181-186, 1994 | 35 | 1994 |

On optimal permutation codes VK Goyal, SA Savari, W Wang IEEE Transactions on Information Theory 47 (7), 2961-2971, 2001 | 32 | 2001 |

On networks of two-way channels G Kramer, SA Savari DIMACS Workshop on Algebraic Coding Theory and Information Theory,(December …, 2005 | 31 | 2005 |

Cut sets and information flow in networks of two-way channels G Kramer, SA Savari International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 33, 2004 | 30 | 2004 |

A combinatorial study of linear deterministic relay networks SMST Yazdi, SA Savari 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo …, 2010 | 28 | 2010 |

Variable-to-fixed length codes for predictable sources SA Savari Proceedings DCC'98 Data Compression Conference (Cat. No. 98TB100225), 481-490, 1998 | 27 | 1998 |

Redundancy of the Lempel-Ziv string matching code SA Savari IEEE Transactions on Information Theory 44 (2), 787-791, 1998 | 27 | 1998 |

Comparing and combining profiles S Savari, C Young Second Workshop on Feedback-Directed Optimization (FDO) 240, 1999 | 26 | 1999 |

Network coding in node-constrained line and star networks SMS Yazdi, SA Savari, G Kramer IEEE transactions on information theory 57 (7), 4452-4468, 2011 | 24 | 2011 |

A probabilistic approach to some asymptotics in noiseless communication SA Savari IEEE Transactions on Information Theory 46 (4), 1246-1262, 2000 | 23 | 2000 |

Variable-to-fixed length codes and the conservation of entropy SA Savari IEEE Transactions on Information Theory 45 (5), 1612-1620, 1999 | 23 | 1999 |

Precise asymptotic analysis of the Tunstall code M Drmota, Y Reznik, SA Savari, W Szpankowski 2006 IEEE International Symposium on Information Theory, 2334-2337, 2006 | 22 | 2006 |

A max-flow/min-cut algorithm for a class of wireless networks SMST Yazdi, SA Savari Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 21 | 2010 |