Shimon Bitton's research while affiliated with Technion - Israel Institute of Technology and other places
What is this page?
This page lists the scientific contributions of an author, who either does not have a ResearchGate profile, or has not yet added these contributions to their profile.
It was automatically created by ResearchGate to create a record of this author's body of work. We create such pages to advance our goal of creating and maintaining the most comprehensive scientific repository possible. In doing so, we process publicly available (personal) data relating to the author as a member of the scientific community.
If you're a ResearchGate member, you can follow this page to keep up with this author's work.
If you are this author, and you don't want us to display this page anymore, please let us know.
It was automatically created by ResearchGate to create a record of this author's body of work. We create such pages to advance our goal of creating and maintaining the most comprehensive scientific repository possible. In doing so, we process publicly available (personal) data relating to the author as a member of the scientific community.
If you're a ResearchGate member, you can follow this page to keep up with this author's work.
If you are this author, and you don't want us to display this page anymore, please let us know.
Publications (5)
The first generic self-stabilizing transformer for local problems in a constrained bandwidth model is introduced. This transformer can be applied to a wide class of locally checkable labeling (LCL) problems, converting a given fault free synchronous algorithm that satisfies certain conditions into a self-stabilizing synchronous algorithm for the sa...
A new \emph{spanner} construction algorithm is presented, working under the \emph{LOCAL} model with unique edge IDs. Given an $n$-node communication graph, a spanner with a constant stretch and $O (n^{1 + \varepsilon})$ edges (for an arbitrarily small constant $\varepsilon > 0$) is constructed in a constant number of rounds sending $O (n^{1 + \vare...
A new spanner construction algorithm is presented, working under the LOCAL model assuming unique edge IDs. Given an n-node communication graph, a spanner with a constant stretch and Õ(n1 + c) edges (for any small constant c > 0) is constructed efficiently --- i.e., in a constant number of rounds and a message complexity of Õ (n1 + 2c) whp.
One of t...
This research focuses on minimizing the life cycle cost of a fleet of aircraft. We consider two categories of repairable parts; upon failure of a first category part (No-Go part), its aircraft becomes non-operational but when a second category part (Go part) fails, the aircraft can still operate for a predetermined period of time before it becomes...
Citations
... We 3 also assume that the abandonment distribution is exponential and the abandonment rate is equal to θ. The Erlang-A queueing model and its variants are very well studied in the queueing literature, see for example Zeltyn and Mandelbaum [49], Whitt [47], Mandelbaum and Zeltyn [30], Gurvich et al. [17], Engblom and Pender [15], Pender [42], Niyirora and Pender [34], Aktekin and Ekin [1], Braverman et al. [5], Pender [43], Pender and Massey [44], Bitton et al. [3], Azriel et al. [2], van Leeuwaarden et al. [46]. The Erlang-A queue has been so extensively analyzed since several important queueing models are special cases of it. ...
![[object Object]](https://i1.rgstatic.net/ii/profile.image/1014212792967171-1618818581122_Q64/Izack-Cohen.jpg)
![[object Object]](https://i1.rgstatic.net/ii/profile.image/450781129252867-1484486004464_Q64/Morris-Cohen-4.jpg)
... In terms of batch-type online algorithms, Bitton et al. [8] study online scheduling in a batch processing system. Kumar et al. [20] design scheduling mechanisms for runtime elasticity of heterogeneous workloads. ...
