User profiles for Lior Aronshtam
Lior AronshtamPhd in Computer Science, SCE Verified email at ac.sce.ac.il Cited by 222 |
Collapsibility and vanishing of top homology in random simplicial complexes
Let $$\Delta _{n-1}$$ denote the $$(n-1)$$ -dimensional simplex. Let $$Y$$ be a random $$d$$
-dimensional subcomplex of $$\Delta _{n-1}$$ obtained by starting with the full $$(d-1)…
-dimensional subcomplex of $$\Delta _{n-1}$$ obtained by starting with the full $$(d-1)…
When does the top homology of a random simplicial complex vanish?
L Aronshtam, N Linial - Random Structures & Algorithms, 2015 - Wiley Online Library
Several years ago Linial and Meshulam (Combinatorica 26 (2006) 457–487) introduced a
model called of random n‐vertex d‐dimensional simplicial complexes. The following question …
model called of random n‐vertex d‐dimensional simplicial complexes. The following question …
The threshold for d‐collapsibility in random complexes
L Aronshtam, N Linial - Random Structures & Algorithms, 2016 - Wiley Online Library
In this paper we determine the threshold for d‐collapsibility in the probabilistic model X d (n,p)
of d‐dimensional simplicial complexes. A lower bound for this threshold was established …
of d‐dimensional simplicial complexes. A lower bound for this threshold was established …
Bounds on the average and minimum attendance in preference-based activity scheduling
L Aronshtam, H Ilani - Discrete Applied Mathematics, 2022 - Elsevier
In this paper we study the preference-based activity scheduling problem, where based on
preference sets of participants, activities need to be scheduled in parallel, such that …
preference sets of participants, activities need to be scheduled in parallel, such that …
Optimal Route Crowd-Shipping System for Sustainable Rapid Delivery: Algorithm, Simulation, and Feasibility Evaluation
L Aronshtam, B Sand, T Shrot, R Cohen, C Levin… - Future …, 2023 - mdpi.com
Delivery systems are ubiquitous in today’s economy. However, those systems usually operate
through purpose-built vehicles, which are inefficient, expensive, and highly harmful to the …
through purpose-built vehicles, which are inefficient, expensive, and highly harmful to the …
Can we do better? a classification of algorithm run-time-complexity improvement using the SOLO taxonomy
Improving code while preserving its functionality is a common task in the hi-tech industry.
Yet students have difficulties improving an algorithm’s run-time complexity by an order of …
Yet students have difficulties improving an algorithm’s run-time complexity by an order of …
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 …, 2017 - Springer
This article focuses on the question of whether a certain candidate’s (player’s) chance to
advance further in a tennis tournament can be increased when the ordering of the tournament …
advance further in a tennis tournament can be increased when the ordering of the tournament …
Grading scale model for knowledge based repositories
L Aronshtam, H Cohen… - … Methods in Sciences …, 2018 - content.iospress.com
Abstract Knowledge based repositories are becoming more and more common. Such
repositories tend to be very large, therefore introduce a challenge in managing their operations …
repositories tend to be very large, therefore introduce a challenge in managing their operations …
Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis
N Eidelstein, L Aronshtam, E Eidelstein… - Annals of Mathematics …, 2019 - Springer
Is it possible for the organizers of a sports tournament to influence the identity of the final
winner by manipulating the initial seeding of the tournament? Is it possible to ensure a specific …
winner by manipulating the initial seeding of the tournament? Is it possible to ensure a specific …
Perfect matching in bipartite hypergraphs subject to a demand graph
Motivated by the problem of assigning plots to tenants, we present a version of the bipartite
hypergraph matching problem. This version deals with a hypergraph with a constraint on its …
hypergraph matching problem. This version deals with a hypergraph with a constraint on its …