Lior Aronshtam
Lior Aronshtam
Phd in Computer Science, SCE
Verified email at ac.sce.ac.il - Homepage
Title
Cited by
Cited by
Year
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
682013
When does the top homology of a random simplicial complex vanish?
L Aronshtam, N Linial
Random Structures & Algorithms 46 (1), 26-35, 2015
282015
The threshold for d‐collapsibility in random complexes
L Aronshtam, N Linial
Random Structures & Algorithms 48 (2), 260-269, 2016
182016
Vanishing of the top homology of a random complex
L Aronshtam, N Linial, T Luczak, R Meshulam
122010
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
62017
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
12018
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
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
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
The system can't perform the operation now. Try again later.
Articles 1–10