Lower-stretch spanning trees M Elkin, Y Emek, DA Spielman, SH Teng SIAM Journal on Computing 38 (2), 608-628, 2008 | 235 | 2008 |

Online computation with advice Y Emek, P Fraigniaud, A Korman, A Rosén Theoretical Computer Science 412 (24), 2642-2656, 2011 | 145 | 2011 |

Signaling schemes for revenue maximization Y Emek, M Feldman, I Gamzu, R PaesLeme, M Tennenholtz ACM Transactions on Economics and Computation (TEAC) 2 (2), 1-19, 2014 | 102 | 2014 |

Mechanisms for multi-level marketing Y Emek, R Karidi, M Tennenholtz, A Zohar Proceedings of the 12th ACM conference on Electronic commerce, 209-218, 2011 | 85 | 2011 |

Stone age distributed computing Y Emek, R Wattenhofer Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013 | 74 | 2013 |

SINR diagrams: Towards algorithmically usable SINR models of wireless networks C Avin, Y Emek, E Kantor, Z Lotker, D Peleg, L Roditty Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009 | 64 | 2009 |

How many ants does it take to find the food? Y Emek, T Langner, D Stolz, J Uitto, R Wattenhofer Theoretical Computer Science 608, 255-267, 2015 | 56 | 2015 |

Solving the ANTS problem with asynchronous finite state machines Y Emek, T Langner, J Uitto, R Wattenhofer International Colloquium on Automata, Languages, and Programming, 471-482, 2014 | 55 | 2014 |

Broadcasting in UDG radio networks with unknown topology Y Emek, L Gasieniec, E Kantor, A Pelc, D Peleg, C Su Distributed Computing 21 (5), 331-351, 2009 | 47 | 2009 |

Online matching: haste makes waste! Y Emek, S Kutten, R Wattenhofer Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 46 | 2016 |

Approximating minimum max-stretch spanning trees on unweighted graphs Y Emek, D Peleg Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004 | 46 | 2004 |

Semi-streaming set cover Y Emek, A Rosén ACM Transactions on Algorithms (TALG) 13 (1), 1-22, 2016 | 44 | 2016 |

A near-linear-time algorithm for computing replacement paths in planar directed graphs Y Emek, D Peleg, L Roditty ACM Transactions on Algorithms (TALG) 6 (4), 1-13, 2010 | 37 | 2010 |

SINR diagrams: Convexity and its applications in wireless networks C Avin, Y Emek, E Kantor, Z Lotker, D Peleg, L Roditty Journal of the ACM (JACM) 59 (4), 1-34, 2012 | 34 | 2012 |

SINR diagrams: Convexity and its applications in wireless networks C Avin, Y Emek, E Kantor, Z Lotker, D Peleg, L Roditty Journal of the ACM (JACM) 59 (4), 18, 2012 | 34 | 2012 |

Online set packing Y Emek, MM Halldórsson, Y Mansour, B Patt-Shamir, J Radhakrishnan, ... SIAM Journal on Computing 41 (4), 728-746, 2012 | 34* | 2012 |

Approximating minimum max-stretch spanning trees on unweighted graphs Y Emek, D Peleg SIAM Journal on Computing 38 (5), 1761-1781, 2009 | 32 | 2009 |

Approximating minimum max-stretch spanning trees on unweighted graphs Y Emek, D Peleg SIAM Journal on Computing 38 (5), 1761-1781, 2008 | 32 | 2008 |

Approximating minimum max-stretch spanning trees on unweighted graphs Y Emek, D Peleg SIAM Journal on Computing 38 (5), 1761-1781, 2008 | 32 | 2008 |

Anonymous networks: randomization= 2-hop coloring Y Emek, C Pfister, J Seidel, R Wattenhofer Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014 | 27 | 2014 |