Collapsibility and vanishing of top homology in random simplicial complexes L Aronshtam, N Linial, T Łuczak, R Meshulam Discrete & Computational Geometry 49 (2), 317-334, 2013 | 83 | 2013 |

When does the top homology of a random simplicial complex vanish? L Aronshtam, N Linial Random Structures & Algorithms 46 (1), 26-35, 2015 | 37 | 2015 |

The threshold for d‐collapsibility in random complexes L Aronshtam, N Linial Random Structures & Algorithms 48 (2), 260-269, 2016 | 24 | 2016 |

Vanishing of the top homology of a random complex L Aronshtam, N Linial, T Luczak, R Meshulam | 12 | 2010 |

Tennis manipulation: can we help serena williams win another tournament? L Aronshtam, H Cohen, T Shrot Annals of Mathematics and Artificial Intelligence 80 (2), 153-169, 2017 | 10 | 2017 |

Can we do better? a classification of algorithm run-time-complexity improvement using the SOLO taxonomy L Aronshtam, T Shrot, R Shmallo Education and Information Technologies 26 (5), 5851-5872, 2021 | 4 | 2021 |

Bounds on the average and minimum attendance in preference-based activity scheduling L Aronshtam, H Ilani Discrete Applied Mathematics 306, 114-119, 2022 | 3 | 2022 |

Controlling sub-tournaments: easy or hard problem? N Eidelstein, L Aronshtam, E Eidelstein, T Shrot Annals of Mathematics and Artificial Intelligence 86 (4), 257-268, 2019 | 3 | 2019 |

The effects of applying assessment for and as learning in theoretical engineering courses R Shmallo, T Shrot, L Aronshtam The International journal of engineering education 35 (4), 1064-1073, 2019 | 1 | 2019 |

Grading scale model for knowledge based repositories L Aronshtam, H Cohen, D Sohacheski, S Mark Journal of Computational Methods in Sciences and Engineering 18 (4), 931-938, 2018 | 1 | 2018 |

Satisfying Allocation of Plots to Tenants L Aronshtam, H Ilani, E Shufan MISTA 2019, 2019 | | 2019 |

Random Simplicial Complexes L Aronshtam Hebrew University of Jerusalem, 2013 | | 2013 |

The PO Approach: What Changes are Required? T SHROT, R SHMALLO, L ARONSHTAM | | |