Hidden markov processes Y Ephraim, N Merhav IEEE Transactions on information theory 48 (6), 1518-1569, 2002 | 1083 | 2002 |

Universal prediction N Merhav, M Feder IEEE Transactions on Information Theory 44 (6), 2124-2147, 1998 | 535 | 1998 |

Universal prediction of individual sequences M Feder, N Merhav, M Gutman IEEE transactions on Information Theory 38 (4), 1258-1270, 1992 | 467 | 1992 |

On information rates for mismatched decoders N Merhav, G Kaplan, A Lapidoth, SS Shitz IEEE Transactions on Information Theory 40 (6), 1953-1967, 1994 | 422 | 1994 |

Relations between entropy and error probability M Feder, N Merhav IEEE Transactions on Information theory 40 (1), 259-266, 1994 | 266 | 1994 |

Fast algorithms for DCT-domain image downsampling and for inverse motion compensation N Merhav, V Bhaskaran IEEE transactions on circuits and systems for video technology 7 (3), 468-476, 1997 | 238 | 1997 |

When is the generalized likelihood ratio test optimal? O Zeitouni, J Ziv, N Merhav IEEE Transactions on Information Theory 38 (5), 1597-1602, 1992 | 209 | 1992 |

A measure of relative entropy between individual sequences with application to universal classification J Ziv, N Merhav IEEE transactions on information theory 39 (4), 1270-1279, 1993 | 198 | 1993 |

A competitive minimax approach to robust estimation of random parameters YC Eldar, N Merhav IEEE Transactions on Signal Processing 52 (7), 1931-1946, 2004 | 185 | 2004 |

On successive refinement for the Wyner-Ziv problem Y Steinberg, N Merhav IEEE Transactions on Information Theory 50 (8), 1636-1654, 2004 | 170 | 2004 |

Channel coding in the presence of side information G Keshet, Y Steinberg, N Merhav Foundations and TrendsŪ in Communications and Information Theory 4 (6), 445-586, 2008 | 167 | 2008 |

On the estimation of the order of a Markov chain and universal data compression N Merhav, M Gutman, J Ziv IEEE Transactions on Information Theory 35 (5), 1014-1019, 1989 | 163 | 1989 |

Guessing subject to distortion E Arikan, N Merhav IEEE Transactions on Information Theory 44 (3), 1041-1056, 1998 | 156 | 1998 |

A strong version of the redundancy-capacity theorem of universal coding N Merhav, M Feder IEEE Transactions on Information Theory 41 (3), 714-722, 1995 | 136 | 1995 |

Optimal prefix codes for sources with two-sided geometric distributions N Merhav, G Seroussi, MJ Weinberger IEEE transactions on information theory 46 (1), 121-135, 2000 | 129 | 2000 |

Statistical physics and information theory N Merhav Foundations and TrendsŪ in Communications and Information Theory 6 (1–2), 1-212, 2010 | 118 | 2010 |

Optimal sequential probability assignment for individual sequences MJ Weinberger, N Merhav, M Feder IEEE Transactions on Information Theory 40 (2), 384-396, 1994 | 117 | 1994 |

Optimizing computer performance by using data compression principles to minimize a loss function M Weinberger, TG Rokicki, G Seroussi, R Gupta, N Merhav, JM Ferrandiz US Patent 6,453,389, 2002 | 113 | 2002 |

Universal composite hypothesis testing: A competitive minimax approach M Feder, N Merhav IEEE Transactions on information theory 48 (6), 1504-1517, 2002 | 111 | 2002 |

Low-complexity sequential lossless coding for piecewise-stationary memoryless sources GI Shamir, N Merhav IEEE transactions on information theory 45 (5), 1498-1519, 1999 | 109 | 1999 |