An undergraduate track in computer security S Azadegan, M Lavine, M O'Leary, A Wijesinha, M Zimand Proceedings of the 8th Annual Conference on innovation and Technology in …, 2003 | 40 | 2003 |

Is independence an exception? C Calude, H Jürgensen, M Zimand Applied Mathematics and Computation 66 (1), 63-76, 1994 | 40 | 1994 |

Short lists with short programs in short time B Bauwens, A Makhlin, N Vereshchagin, M Zimand 2013 IEEE Conference on Computational Complexity, 98-108, 2013 | 32* | 2013 |

Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences M Zimand Theory of Computing Systems 46 (4), 707-722, 2010 | 29 | 2010 |

Computational Complexity: A Quantitative Perspective M Zimand Elsevier, 2004 | 25 | 2004 |

Strong self-reducibility precludes strong immunity LA Hemaspaandra, M Zimand Mathematical systems theory 29 (5), 535-548, 1996 | 25* | 1996 |

Extracting the Kolmogorov complexity of strings and sequences from sources with limited independence M Zimand arXiv preprint arXiv:0902.2141, 2009 | 22 | 2009 |

Algorithmically independent sequences CS Calude, M Zimand Information and Computation 208 (3), 292-308, 2010 | 20 | 2010 |

Exposure-resilient extractors and the derandomization of probabilistic sublinear time M Zimand computational complexity 17 (2), 220-253, 2008 | 20* | 2008 |

Linear list-approximation for short programs (or the power of a few random bits) B Bauwens, M Zimand 2014 IEEE 29th Conference on Computational Complexity (CCC), 241-247, 2014 | 19 | 2014 |

Almost-everywhere superiority for quantum polynomial time E Hemaspaandra, LA Hemaspaandra, M Zimand Information and Computation 175 (2), 171-181, 2002 | 19* | 2002 |

Possibilities and impossibilities in Kolmogorov complexity extraction M Zimand arXiv preprint arXiv:1104.0872, 2011 | 17 | 2011 |

Weighted NP optimization problems: logical definability and approximation properties M Zimand Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference …, 1995 | 17 | 1995 |

Short lists with short programs in short time–a short proof M Zimand Conference on Computability in Europe, 403-408, 2014 | 16 | 2014 |

Minimum spanning hypertrees I Tomescu, M Zimand Discrete Applied Mathematics 54 (1), 67-76, 1994 | 16 | 1994 |

Worlds to die for LA Hemaspaandra, A Ramachandran, M Zimand ACM SIGACT News 26 (4), 5-15, 1995 | 15 | 1995 |

Kolmogorov complexity version of Slepian-Wolf coding M Zimand Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 13 | 2017 |

The complexity of finding top-Toda-equivalence-class members LA Hemaspaandra, M Ogihara, MJ Zaki, M Zimand Theory of Computing Systems 39 (5), 669-684, 2006 | 13 | 2006 |

Several remarks on index generation functions DA Simovici, M Zimand, D Pletea 2012 IEEE 42nd International Symposium on Multiple-Valued Logic, 179-184, 2012 | 12 | 2012 |

Impossibility of independence amplification in Kolmogorov complexity theory M Zimand International Symposium on Mathematical Foundations of Computer Science, 701-712, 2010 | 11 | 2010 |