ד"ר ליאור ארונשטם

2009 – 2013  PhD. Candidate, the School of Engineering and Computer Science, Hebrew University of Jerusalem, Israel. Research in Computer theory, Combinatorics. Advisor Prof. Nathan Linial

2006 – 2009  M.Sc. student in the School of Engineering and Computer Science, Hebrew University of Jerusalem, Israel. Joined the direct to Ph.D. program.

2003 – 2006  B.Sc. in Computer Science and Biology (Summa cum laude), Bar-Ilan University, Israel

Previous research and development activities

2007-2013                 Research of Random Simplicial Complexes (3 peer reviewed papers).

Present research and development activities

Since 2013                Research of Parameterized Complexity in Tournaments (1 peer reviewed papers).

Since 2015                Mathematicsl Models for Managing a Software Repositery (1 conference talk).

2013-Present          M.Sc. program. Advanced Complexity. Department of Software Engineering, Shamoon College of Engineering (SCE), Israel

2013-Present          B.Sc. program. Introduction to Algorithms, Advanced Algorithms, Discrete Mathematics, Logica and Discrete Topics, Data Structures. Department of Software Engineering, Shamoon College of Engineering (SCE), Israel

1. L.Aronshtam, H.Cohen, T.Shrot, Ann Math Artif Intell (2017). doi:10.1007/s10472-017-9549-7.‏
2. L. Aronshtam, N.Linial, The threshold for d-collapsibility in random complexes, Random Structures and Algorithms, 48.2 (2016): 260-269.
3. L.Aronshtam, N.Linial, When does the top homology of a random simplicial complex vanish?, Random Structures and Algorithms, 2015; 46(1), 26-35.
4. L.Aronshtam, N., Linial, T. Łuczak, R. Meshulam, Collapsibility and vanishing of top homology in random simplicial complexes, Discrete & Computational Geometry, 2013; 49(2), 317-334