| 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 | 99 | 2013 |
| When does the top homology of a random simplicial complex vanish? L Aronshtam, N Linial Random Structures & Algorithms 46 (1), 26-35, 2015 | 44 | 2015 |
| The threshold for d‐collapsibility in random complexes L Aronshtam, N Linial Random Structures & Algorithms 48 (2), 260-269, 2016 | 29 | 2016 |
| Bounds on the average and minimum attendance in preference-based activity scheduling L Aronshtam, H Ilani Discrete Applied Mathematics 306, 114-119, 2022 | 16 | 2022 |
| Tennis manipulation: can we help serena williams win another tournament? Or can we control a knockout tournament with reasonable complexity? L Aronshtam, H Cohen, T Shrot Annals of Mathematics and Artificial Intelligence 80, 153-169, 2017 | 11 | 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 | 7 | 2021 |
| Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis N Eidelstein, L Aronshtam, E Eidelstein, T Shrot Annals of Mathematics and Artificial Intelligence 86, 257-268, 2019 | 4 | 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 | 4 | 2019 |
| Optimal Route Crowd-Shipping System for Sustainable Rapid Delivery: Algorithm, Simulation, and Feasibility Evaluation L Aronshtam, B Sand, T Shrot, R Cohen, C Levin, H Daltrophe Future Transportation 4 (1), 1-14, 2023 | 1 | 2023 |
| Satisfying allocation of plots to tenants L Aronshtam, H Ilani, E Shufan Proceedings of the 9th multidisciplinary international conference on …, 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 |
| Perfect matching in bipartite hypergraphs subject to a demand graph L Aronshtam, H Ilani, E Shufan Annals of Operations Research 321 (1), 39-48, 2023 | | 2023 |
| Random Simplicial Complexes L Aronshtam Hebrew University of Jerusalem, 2013 | | 2013 |
| Vanishing of the top homology of a random complex L Aronshtam, N Linial, T Luczak, R Meshulam | | 2010 |
| A Transformation in Teaching Software Engineering Novices Based on Their Errors When Learning Design Patterns T Shrot, A Raz, R Shmallo, L Aronstham TRANSFORMING ENGINEERING EDUCATION 2023, 266, 0 | | |
| The PO Approach: What Changes are Required? T SHROT, R SHMALLO, L ARONSHTAM | | |
