11 citations · 21 across the 13 of their papers we have counts for
13 papers
On the Practical Power of Automata in Pattern Matching
Ora Amir, Amihood Amir, Aviezri Fraenkel +1
The classical pattern matching paradigm is that of seeking occurrences of one string - the pattern, in another - the text, where both strings are drawn from an alphabet set . As…
Playability and arbitrarily large rat games
Aviezri S. Fraenkel, Urban Larsson
In 1973 Fraenkel discovered interesting sequences which split the positive integers. These sequences became famous, because of a related unsolved conjecture. Here we construct comb…
Searching for Disjoint Covering Systems with Precisely One Repeated Modulus
Shalosh B. Ekhad, Aviezri S. Fraenkel, Doron Zeilberger
A set of arithmetical sequences with $$…
When are translations of P-positions of Wythoff's game P-positions?
Aviezri S. Fraenkel, Nhan Bao Ho
We study the problem whether there exist variants of {\sc Wythoff}'s game whose -positions, except for a finite number, are obtained from those of {\sc Wythoff}'s game by adding…
Invariant and dual subtraction games resolving the Duchê-Rigo conjecture
Urban Larsson, Peter Hegarty, Aviezri S. Fraenkel
We prove a recent conjecture of Duchêne and Rigo, stating that every complementary pair of homogeneous Beatty sequences represents the solution to an \emph{invariant} impartial gam…
Traveling Salesmen in the Presence of Competition
Sandor P. Fekete, Rudolf Fleischer, Aviezri Fraenkel +1
We propose the ``Competing Salesmen Problem'' (CSP), a 2-player competitive version of the classical Traveling Salesman Problem. This problem arises when considering two competing…