Optimal social choice functions: A utilitarian view C Boutilier, I Caragiannis, S Haber, T Lu, AD Procaccia, O Sheffet Artificial Intelligence 227, 190-213, 2015 | 141 | 2015 |

Spatiotemporal signal propagation in complex networks C Hens, U Harush, S Haber, R Cohen, B Barzel Nature Physics, 1, 2019 | 38 | 2019 |

The isoperimetric constant of the random graph process I Benjamini, S Haber, M Krivelevich, E Lubetzky Random Structures & Algorithms 32 (1), 101-114, 2008 | 19 | 2008 |

Support vector machine‐based differentiation between aggressive and chronic periodontitis using microbial profiles M Feres, Y Louzoun, S Haber, M Faveri, LC Figueiredo, L Levin International dental journal 68 (1), 39-46, 2018 | 18 | 2018 |

The logic of random regular graphs S Haber, M Krivelevich Journal of combinatorics 1 (4), 389-440, 2010 | 13 | 2010 |

An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three A Frieze, S Haber Random Structures & Algorithms 47 (1), 73-98, 2015 | 10 | 2015 |

On the game chromatic number of sparse random graphs A Frieze, S Haber, M Lavrov SIAM Journal of Discrete Mathematics 27 (2), 768-790, 2013 | 10 | 2013 |

The Number of -Matchings in Almost Every Tree is a Zero Residue N Alon, S Haber, M Krivelevich the electronic journal of combinatorics 18 (1), P30, 2011 | 9 | 2011 |

Ferromagnetic Potts models with multisite interaction N Schreiber, R Cohen, S Haber Physical Review E 97 (3), 032106, 2018 | 7 | 2018 |

On fractional K‐factors of random graphs S Haber, M Krivelevich Random Structures & Algorithms 30 (4), 441-463, 2007 | 4 | 2007 |

Efficient construction of diamond structures A Weizmann, O Dunkelman, S Haber International Conference on Cryptology in India, 166-185, 2017 | 1 | 2017 |

Violation of a universal changeover in two-dimensional Potts models N Schreiber, R Cohen, S Haber, G Amir arXiv preprint arXiv:1808.04130, 2018 | | 2018 |

Random graphs and Lindstrom quantifiers for natural graph properties S Haber, S Shelah arXiv preprint arXiv:1510.06574, 2015 | | 2015 |

An Extension of the Ehrenfeucht-Fraïssé Game for First Order Logics Augmented with Lindström Quantifiers S Haber, S Shelah Fields of Logic and Computation II, 226-236, 2015 | | 2015 |

Problems in Logic and Random Graphs S Haber, שימי הבר University of Tel-Aviv, 2012 | | 2012 |

Noga Alon and Benny Sudakov S Janson, S Haber, M Krivelevich, H Lefmann, Y Person, M Schacht, ... Journal of Combinatorics 1 (4), 2010 | | 2010 |

Corrigendum: On fractional K‐factors of random graphs S Haber, M Krivelevich Random Structures & Algorithms 33 (4), 533-535, 2008 | | 2008 |

ARIEL D. PROCACCIA, Carnegie Mellon University C BOUTILIER, I CARAGIANNIS, S HABER, T LU | | |

Better logic obeying a zero-one law S Haber, S Shelah | | |