Aviezri S. Fraenkel

Publication Activity (10 Years)

Years Active: 1961-2019
Publications (10 Years): 8

Top Venues

Integers

Int. J. Game Theory

Discret. Math.

Am. Math. Mon.

Publications

Aviezri S. Fraenkel, Urban Larsson
Games on Arbitrarily Large Rats and Playability. Integers 19 (2019)
Aviezri S. Fraenkel, Urban Larsson, Carlos Pereira dos Santos, Bernhard von Stengel
Special issue on combinatorial game theory. Int. J. Game Theory 47 (2) (2018)
Lior Goldberg, Aviezri S. Fraenkel
Patterns in the generalized Fibonacci word, applied to games. Discret. Math. 341 (6) (2018)
Lior Goldberg, Aviezri S. Fraenkel
Rulesets for Beatty games. Int. J. Game Theory 47 (2) (2018)
Haiyan Li, Sanyang Liu, Aviezri S. Fraenkel, Wen An Liu
Variants of (d, t)-Wythoff's game. Discret. Appl. Math. 227 (2017)
George E. Andrews, Aviezri S. Fraenkel, James A. Sellers
m-ary partitions with no gaps: A characterization modulo m. Discret. Math. 339 (1) (2016)
Aviezri S. Fraenkel, Nhan Bao Ho
When are Translations of P-positions of Wythoff's Game P-positions? Integers (2015)
George E. Andrews, Aviezri S. Fraenkel, James A. Sellers
Characterizing the Number of m-ary Partitions Modulo m. Am. Math. Mon. 122 (9) (2015)
Aviezri S. Fraenkel
Integrating and Rejuvenating Old and New Gems. Language, Culture, Computation (1) (2014)
Alex Fink, Aviezri S. Fraenkel, Carlos Pereira dos Santos
LIM is not slim. Int. J. Game Theory 43 (2) (2014)
Aviezri S. Fraenkel, Jamie Simpson
Corrigendum to "The exact number of squares in Fibonacci words" [Theoret. Comput. Sci. 218(1) (1999) 95-106]. Theor. Comput. Sci. 547 (2014)
Aviezri S. Fraenkel
Reflection. J. Int. Comput. Games Assoc. 36 (1) (2013)
Aviezri S. Fraenkel
The vile, dopey, evil and odious game players. Discret. Math. 312 (1) (2012)
Aviezri S. Fraenkel, Yuval Tanny
A Class of Wythoff-Like Games. Integers (2012)
Urban Larsson, Peter Hegarty, Aviezri S. Fraenkel
Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture. Theor. Comput. Sci. 412 (8-10) (2011)
Aviezri S. Fraenkel
Aperiodic Subtraction Games. Electron. J. Comb. 18 (2) (2011)
Saúl A. Blanco, Aviezri S. Fraenkel
Tromping Games: Tiling With Trominoes. Integers (2011)
Aviezri S. Fraenkel
From Enmity to Amity. Am. Math. Mon. 117 (7) (2010)
Aviezri S. Fraenkel
Complementary Iterated Floor Words and the Flora Game. SIAM J. Discret. Math. 24 (2) (2010)
Éric Duchêne, Aviezri S. Fraenkel, Richard J. Nowakowski, Michel Rigo
Extensions and restrictions of Wythoff's game preserving its p positions. J. Comb. Theory, Ser. A 117 (5) (2010)
Éric Duchêne, Aviezri S. Fraenkel, Sylvain Gravier, Richard J. Nowakowski
Another bridge between Nim and Wythoff. Australas. J Comb. 44 (2009)
Jason P. Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo
A Decision Problem for Ultimately Periodic Sets in Nonstandard Numeration Systems. Int. J. Algebra Comput. 19 (6) (2009)
Jason P. Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems CoRR (2009)
Shiri Artstein-Avidan, Aviezri S. Fraenkel, Vera T. Sós
A two-parameter family of an extension of Beatty sequences. Discret. Math. 308 (20) (2008)
Aviezri S. Fraenkel
Games played by Boole and Galois. Discret. Appl. Math. 156 (4) (2008)
Aviezri S. Fraenkel
Problem 11365. Am. Math. Mon. 115 (5) (2008)
Aviezri S. Fraenkel
Sequences Built from the Golden Ratio: 11238. Am. Math. Mon. 115 (7) (2008)
Aviezri S. Fraenkel
Nim is Easy, Chess is Hard - But Why?? J. Int. Comput. Games Assoc. 29 (4) (2006)
Aviezri S. Fraenkel
Problem 11238. Am. Math. Mon. 113 (7) (2006)
Aviezri S. Fraenkel, Jamie Simpson
An extension of the periodicity lemma to longer periods. Discret. Appl. Math. 146 (2) (2005)
Aviezri S. Fraenkel
Euclid and Wythoff games. Discret. Math. 304 (1-3) (2005)
Aviezri S. Fraenkel
Complexity, appeal and challenges of combinatorial games. Theor. Comput. Sci. 313 (3) (2004)
Erik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, Richard J. Nowakowski
Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory. Theor. Comput. Sci. 313 (3) (2004)
Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt
Traveling salesmen in the presence of competition. Theor. Comput. Sci. 313 (3) (2004)
Aviezri S. Fraenkel
New Games Related to Old and New Sequences. ACG (2003)
Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt
Traveling Salesmen in the Presence of Competition CoRR (2002)
Aviezri S. Fraenkel, Ofer Rahat
Complexity of Error-Correcting Codes Derived from Combinatorial Games. Computers and Games (2002)
Aviezri S. Fraenkel
Arrays, numeration systems and Frankenstein games. Theor. Comput. Sci. 282 (2) (2002)
Aviezri S. Fraenkel, Ofer Rahat
Infinite cyclic impartial games. Theor. Comput. Sci. 252 (1-2) (2001)
Aviezri S. Fraenkel, Dmitri Zusman
A new heap game. Theor. Comput. Sci. 252 (1-2) (2001)
Aviezri S. Fraenkel, Tamar Seeman, Jamie Simpson
The Subword Complexity of a Two-Parameter Family of Sequences. Electron. J. Comb. 8 (2) (2001)
Aviezri S. Fraenkel, Jamie Simpson
An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture). CPM (2001)
Aviezri S. Fraenkel
Virus Versus Mankind. Computers and Games (2000)
Aviezri S. Fraenkel
Recent results and questions in combinatorial game complexities. Theor. Comput. Sci. 249 (2) (2000)
Aviezri S. Fraenkel
and applications. Discret. Math. 224 (1-3) (2000)
Aviezri S. Fraenkel, Jamie Simpson
The Exact Number of Squares in Fibonacci Words. Theor. Comput. Sci. 218 (1) (1999)
Aviezri S. Fraenkel, Shmuel T. Klein
Information Retrieval from Annotated Texts. J. Am. Soc. Inf. Sci. 50 (10) (1999)
Aviezri S. Fraenkel, Ofer Rahat
Infinite Cyclic Impartial Games. Computers and Games (1998)
Uri Blass, Aviezri S. Fraenkel, Romina Guelman
How Far Can Nim in Disguise Be Stretched? J. Comb. Theory, Ser. A 84 (2) (1998)
Aviezri S. Fraenkel, Michal Ozery
-Positions as Moves. Theor. Comput. Sci. 205 (1-2) (1998)
Aviezri S. Fraenkel, Jamie Simpson
How Many Squares Can a String Contain? J. Comb. Theory, Ser. A 82 (1) (1998)
Aviezri S. Fraenkel, Dmitri Zusman
A New Heap Game. Computers and Games (1998)
Aviezri S. Fraenkel, Jamie Simpson, Mike Paterson
On Weak Circular Squares in Binary Words. CPM (1997)
Aviezri S. Fraenkel
Protein folding, spin glass and computational complexity. DNA Based Computers (1997)
Aviezri S. Fraenkel
Combinatorial game theory foundations applied to digraph kernels. Electron. J. Comb. 4 (2) (1997)
Aviezri S. Fraenkel, Shmuel T. Klein
Robust Universal Complete Codes for Transmission and Compression. Discret. Appl. Math. 64 (1) (1996)
Aviezri S. Fraenkel, Martin Loebl
Complexity of circuit intersection in graphs. Discret. Math. 141 (1-3) (1995)
Aviezri S. Fraenkel, Jamie Simpson
How Many Squares Must a Binary Sequence Contain? Electron. J. Comb. 2 (1995)
James P. Jones, Aviezri S. Fraenkel
Complexities of Winning Strategies in Diophantine Games. J. Complex. 11 (4) (1995)
Aviezri S. Fraenkel, Alan Jaffray, Anton Kotzig, Gert Sabidussi
Modular Nim. Theor. Comput. Sci. 143 (2) (1995)
Aviezri S. Fraenkel, Clark Kimberling
Generalized Wythoff arrays, shuffles and interspersions. Discret. Math. 126 (1-3) (1994)
Aviezri S. Fraenkel, H. Porta, Kenneth B. Stolarsky
The almost PV behavior of some far from PV algebraic integers. Discret. Math. 135 (1-3) (1994)
Aviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena
Efficient Management of Dynamic Tables. Inf. Process. Lett. 50 (1) (1994)
Aviezri S. Fraenkel, Shmuel T. Klein
Complexity Aspects of Guessing Prefix Codes. Algorithmica 12 (4/5) (1994)
Aviezri S. Fraenkel
Even Kernels. Electron. J. Comb. 1 (1994)
Aviezri S. Fraenkel, Shai Simonson
Geography. Theor. Comput. Sci. 110 (1) (1993)
Roger B. Eggleton, Aviezri S. Fraenkel, R. Jaime Simpson
Beatty sequences and Langford sequences. Discret. Math. 111 (1-3) (1993)
Aviezri S. Fraenkel, Edward R. Scheinerman, Daniel Ullman
Undirected Edge Geography. Theor. Comput. Sci. 112 (2) (1993)
Aviezri S. Fraenkel, Shmuel T. Klein
Bounding the Depth of Search Trees. Comput. J. 36 (7) (1993)
Aviezri S. Fraenkel, Mordechai Lorberbom
Nimhoff games. J. Comb. Theory, Ser. A 58 (1) (1991)
Aviezri S. Fraenkel, Edward R. Scheinerman
A deletion game on hypergraphs. Discret. Appl. Math. 30 (2-3) (1991)
Uri Blass, Aviezri S. Fraenkel
The Sprague-Grundy Function for Wythoff's Game. Theor. Comput. Sci. 75 (3) (1990)
Aviezri S. Fraenkel, Shmuel T. Klein
Bidirectional Huffman Coding. Comput. J. 33 (4) (1990)
Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel
Irreducible disjoint covering systems (with an application to boolean algebra). Discret. Appl. Math. 29 (2-3) (1990)
N. Duvdevani, Aviezri S. Fraenkel
Properties of K-Welter's game. Discret. Math. 76 (3) (1989)
Aviezri S. Fraenkel
The Use and Usefulness of Numeration Systems Inf. Comput. 81 (1) (1989)
Aviezri S. Fraenkel, Mordechai Lorberbom
Epidemiography with various growth functions. Discret. Appl. Math. 25 (1-2) (1989)
Aviezri S. Fraenkel, Martin Loebl, Jaroslav Nesetril
Epidemiography II. Games with a dozing yet winning player. J. Comb. Theory, Ser. A 49 (1) (1988)
Z. Agur, Aviezri S. Fraenkel, Shmuel T. Klein
The number of fixed points of the majority rule. Discret. Math. 70 (3) (1988)
Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein
Compression of Concordances in Full-Text Retrieval Systems. SIGIR (1988)
Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel
Covers of Product Sets and the Korec-Znám Result. Eur. J. Comb. 9 (2) (1988)
Joseph Kahane, Aviezri S. Fraenkel
-welter - a generalization of Welter's game. J. Comb. Theory, Ser. A 46 (1) (1987)
Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal
Improved Techniques for Processing Queries in Full-Text Systems. SIGIR (1987)
Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel
Lattice parallelotopes and disjoint covering systems. Discret. Math. 65 (1) (1987)
Alberto Apostolico, Aviezri S. Fraenkel
Robust transmission of unbounded strings using Fibonacci representations. IEEE Trans. Inf. Theory 33 (2) (1987)
Aviezri S. Fraenkel, Elisheva Goldschmidt
PSPACE-hardness of some combinatorial games. J. Comb. Theory, Ser. A 46 (1) (1987)
Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel
Disjoint covering systems of rational beatty sequences. J. Comb. Theory, Ser. A 42 (1) (1986)
Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal
Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems. SIGIR (1986)
Aviezri S. Fraenkel, Yaacov Yesha
The generalized Sprague-Grundy function and its invariance under certain mappings. J. Comb. Theory, Ser. A 43 (2) (1986)
Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel
A non-analytic proof of the Newman - Znám result for disjoint covering systems. Comb. 6 (3) (1986)
M. Boshernitzan, Aviezri S. Fraenkel
A Linear Algorithm for Nonhomogeneous Spectra of Numbers. J. Algorithms 5 (2) (1984)
Moshe Mor, Aviezri S. Fraenkel
Cayley permutations. Discret. Math. 48 (1) (1984)
Aviezri S. Fraenkel
Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. Theor. Comput. Sci. 29 (1984)
Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl
Is Text Compression by Prefixes and Suffixes Practical? Acta Informatica 20 (1983)
Aviezri S. Fraenkel
Problem 40. Discret. Math. 44 (3) (1983)
Aviezri S. Fraenkel
Problem 47 : Posed by Aviezri S. Fraenkel. Discret. Math. 46 (2) (1983)
Aviezri S. Fraenkel
Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. ICALP (1983)
Aviezri S. Fraenkel
Problem 38. Discret. Math. 44 (3) (1983)
Aviezri S. Fraenkel
Systems of numeration. IEEE Symposium on Computer Arithmetic (1983)
Aviezri S. Fraenkel, Moshe Mor
Combinational Compression and Partitioning of Large Dictionaries: Theory and Experiments. SIGIR (1983)

Aviezri S. Fraenkel.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Aviezri S. Fraenkel