Lior Aronshtam

Publication Activity (10 Years)

Years Active: 2013-2023
Publications (10 Years): 7

Top Topics

Computationally Intensive

Uniformly Distributed

Case Based Problem Solving

Top Venues

Ann. Math. Artif. Intell.

Random Struct. Algorithms

J. Comput. Methods Sci. Eng.

Ann. Oper. Res.

Publications

Lior Aronshtam, Hagai Ilani, Elad Shufan
Perfect matching in bipartite hypergraphs subject to a demand graph. Ann. Oper. Res. 321 (1) (2023)
Lior Aronshtam, Hagai Ilani
Bounds on the average and minimum attendance in preference-based activity scheduling. Discret. Appl. Math. 306 (2022)
Lior Aronshtam, Tammar Shrot, Ronit Shmallo
Can we do better? a classification of algorithm run-time-complexity improvement using the SOLO taxonomy. Educ. Inf. Technol. 26 (5) (2021)
Noa Eidelstein, Lior Aronshtam, Eitan Eidelstein, Tammar Shrot
Controlling sub-tournaments: easy or hard problem? - Theoretical vs. practical analysis. Ann. Math. Artif. Intell. 86 (4) (2019)
Lior Aronshtam, Havatzelet Cohen, Dov Sohacheski, Shlomo Mark
Grading scale model for knowledge based repositories. J. Comput. Methods Sci. Eng. 18 (4) (2018)
Lior Aronshtam, Havatzelet Cohen, Tammar Shrot
Tennis manipulation: can we help serena williams win another tournament? - Or can we control a knockout tournament with reasonable complexity? Ann. Math. Artif. Intell. 80 (2) (2017)
Lior Aronshtam, Nathan Linial
The threshold for d-collapsibility in random complexes. Random Struct. Algorithms 48 (2) (2016)
Lior Aronshtam, Nathan Linial
When does the top homology of a random simplicial complex vanish? Random Struct. Algorithms 46 (1) (2015)
Lior Aronshtam, Nathan Linial, Tomasz Luczak, Roy Meshulam
Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes. Discret. Comput. Geom. 49 (2) (2013)