Lior Aronshtam

Grading scale model for knowledge based repositories

Lior Aronshtam, Havatzelet Cohen, Dov Sohacheski, 2018, J. Comput. Methods Sci. Eng..

When does the top homology of a random simplicial complex vanish?

Nathan Linial, Lior Aronshtam, N. Linial, 2012, Random Struct. Algorithms.

Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes

Nathan Linial, Tomasz Luczak, Roy Meshulam, 2010, Discret. Comput. Geom..

Controlling sub-tournaments: easy or hard problem?

Lior Aronshtam, Tammar Shrot, Noa Eidelstein, 2019, Annals of Mathematics and Artificial Intelligence.

Tennis manipulation: can we help serena williams win another tournament?

Lior Aronshtam, Havatzelet Cohen, Tammar Shrot, 2017, Annals of Mathematics and Artificial Intelligence.

The threshold for d‐collapsibility in random complexes*

Nathan Linial, Lior Aronshtam, N. Linial, 2013, Random Struct. Algorithms.

Bounds on the average and minimum attendance in preference-based activity scheduling

Lior Aronshtam, Hagai Ilani, 2022, Discret. Appl. Math..

Can we do better? a classification of algorithm run-time-complexity improvement using the SOLO taxonomy

Lior Aronshtam, Tammar Shrot, Ronit Shmallo, 2021, Education and Information Technologies.