7 citations · 9 across the 8 of their papers we have counts for
8 papers
Sorting from Counterexamples
Noga Alon, Shay Moran, Shlomo Moran
Consider the following problem of learning an unknown linear order on items. In each round, the learner guesses a complete ordering of the items and receives either confirmatio…
Diagonalization Games
Noga Alon, Olivier Bousquet, Kasper Green Larsen +2
We study several variants of a combinatorial game which is based on Cantor's diagonal argument. The game is between two players called Kronecker and Cantor. The names of the player…
Adjustable Coins
Shlomo Moran, Irad Yavneh
In this paper we consider a scenario where there are several algorithms for solving a given problem. Each algorithm is associated with a probability of success and a cost, and ther…
Elementary Derivations of the Real Composition Algebras
Tomer Moran, Shay Moran, Shlomo Moran
``Real Normed Algebras Revisited,'' the last paper of the late Gadi Moran, attempts to reconstruct the discovery of the complex numbers, the quaternions and the octonions, as well…
MinMax Algorithms for Stabilizing Consensus
Bernadette Charron-Bost, Shlomo Moran
In the stabilizing consensus problem, each agent of a networked system has an input value and is repeatedly writing an output value; it is required that eventually all the output v…
Synchronization in Dynamic Networks
Bernadette Charron-Bost, Shlomo Moran
In this article, we study algorithms for dynamic networks with asynchronous start, i.e., each node may start running the algorithm in a different round. Inactive nodes transmit onl…