Aviezri S. Fraenkel

According to our database, Aviezri S. Fraenkel authored at least 123 papers between 1961 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2019

Games on Arbitrarily Large Rats and Playability.

Aviezri S. Fraenkel, Urban Larsson

Integers, 2019

2018

Rulesets for Beatty games.

Lior Goldberg, Aviezri S. Fraenkel

Int. J. Game Theory, 2018

Special issue on combinatorial game theory.

Aviezri S. Fraenkel, Urban Larsson, Carlos Pereira dos Santos, Bernhard von Stengel

Int. J. Game Theory, 2018

Patterns in the generalized Fibonacci word, applied to games.

Lior Goldberg, Aviezri S. Fraenkel

Discret. Math., 2018

2017

Variants of (d, t)-Wythoff's game.

Haiyan Li, Sanyang Liu, Aviezri S. Fraenkel, Wen An Liu

Discret. Appl. Math., 2017

2016

m-ary partitions with no gaps: A characterization modulo m.

George E. Andrews, Aviezri S. Fraenkel, James A. Sellers

Discret. Math., 2016

2015

Characterizing the Number of m-ary Partitions Modulo m.

George E. Andrews, Aviezri S. Fraenkel, James A. Sellers

Am. Math. Mon., 2015

When are Translations of P-positions of Wythoff's Game P-positions?

Aviezri S. Fraenkel, Nhan Bao Ho

Integers, 2015

2014

Corrigendum to "The exact number of squares in Fibonacci words" [Theoret. Comput. Sci. 218(1) (1999) 95-106].

Aviezri S. Fraenkel, Jamie Simpson

Theor. Comput. Sci., 2014

LIM is not slim.

Alex Fink, Aviezri S. Fraenkel, Carlos Pereira dos Santos

Int. J. Game Theory, 2014

Integrating and Rejuvenating Old and New Gems.

Aviezri S. Fraenkel

Proceedings of the Language, Culture, Computation. Computing - Theory and Technology, 2014

2013

Reflection.

Aviezri S. Fraenkel

ICGA J., 2013

2012

A Class of Wythoff-Like Games.

Aviezri S. Fraenkel, Yuval Tanny

Integers, 2012

The vile, dopey, evil and odious game players.

Aviezri S. Fraenkel

Discret. Math., 2012

2011

Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture.

Urban Larsson, Peter Hegarty, Aviezri S. Fraenkel

Theor. Comput. Sci., 2011

Tromping Games: Tiling With Trominoes.

Saúl A. Blanco, Aviezri S. Fraenkel

Integers, 2011

Aperiodic Subtraction Games.

Aviezri S. Fraenkel

Electron. J. Comb., 2011

2010

From Enmity to Amity.

Aviezri S. Fraenkel

Am. Math. Mon., 2010

Complementary Iterated Floor Words and the Flora Game.

Aviezri S. Fraenkel

SIAM J. Discret. Math., 2010

Extensions and restrictions of Wythoff's game preserving its p positions.

Éric Duchêne, Aviezri S. Fraenkel, Richard J. Nowakowski, Michel Rigo

J. Comb. Theory A, 2010

2009

A Decision Problem for Ultimately Periodic Sets in Nonstandard Numeration Systems.

Jason P. Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo

Int. J. Algebra Comput., 2009

A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems

Jason P. Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo

CoRR, 2009

Another bridge between Nim and Wythoff.

Éric Duchêne, Aviezri S. Fraenkel, Sylvain Gravier, Richard J. Nowakowski

Australas. J Comb., 2009

Remembering Philip Rabinowitz.

Philip J. Davis, Aviezri S. Fraenkel

Proceedings of the Birth of Numerical Analysis, 2009

2008

Sequences Built from the Golden Ratio: 11238.

Aviezri S. Fraenkel

Am. Math. Mon., 2008

Problem 11365.

Aviezri S. Fraenkel

Am. Math. Mon., 2008

A two-parameter family of an extension of Beatty sequences.

Shiri Artstein-Avidan, Aviezri S. Fraenkel, Vera T. Sós

Discret. Math., 2008

Games played by Boole and Galois.

Aviezri S. Fraenkel

Discret. Appl. Math., 2008

2006

Problem 11238.

Aviezri S. Fraenkel

Am. Math. Mon., 2006

Nim is Easy, Chess is Hard - But Why??

Aviezri S. Fraenkel

ICGA J., 2006

2005

Euclid and Wythoff games.

Aviezri S. Fraenkel

Discret. Math., 2005

An extension of the periodicity lemma to longer periods.

Aviezri S. Fraenkel, Jamie Simpson

Discret. Appl. Math., 2005

2004

Complexity, appeal and challenges of combinatorial games.

Aviezri S. Fraenkel

Theor. Comput. Sci., 2004

Traveling salesmen in the presence of competition.

Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt

Theor. Comput. Sci., 2004

Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory.

Erik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, Richard J. Nowakowski

Theor. Comput. Sci., 2004

2003

New Games Related to Old and New Sequences.

Aviezri S. Fraenkel

Proceedings of the Advances in Computer Games, 2003

2002

Arrays, numeration systems and Frankenstein games.

Aviezri S. Fraenkel

Theor. Comput. Sci., 2002

Complexity of Error-Correcting Codes Derived from Combinatorial Games.

Aviezri S. Fraenkel, Ofer Rahat

Proceedings of the Computers and Games, Third International Conference, CG 2002, Edmonton, 2002

2001

The Subword Complexity of a Two-Parameter Family of Sequences.

Aviezri S. Fraenkel, Tamar Seeman, Jamie Simpson

Electron. J. Comb., 2001

An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture).

Aviezri S. Fraenkel, Jamie Simpson

Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000

Recent results and questions in combinatorial game complexities.

Aviezri S. Fraenkel

Theor. Comput. Sci., 2000

On the recurrence f_m+1=b_mf_m-f_m-1 and applications.

Aviezri S. Fraenkel

Discret. Math., 2000

Virus Versus Mankind.

Aviezri S. Fraenkel

Proceedings of the Computers and Games, Second International Conference, 2000

1999

The Exact Number of Squares in Fibonacci Words.

Aviezri S. Fraenkel, Jamie Simpson

Theor. Comput. Sci., 1999

Information Retrieval from Annotated Texts.

Aviezri S. Fraenkel, Shmuel T. Klein

J. Am. Soc. Inf. Sci., 1999

1998

Adjoining to Wythoff's Game its <i>P</i>-Positions as Moves.

Aviezri S. Fraenkel, Michal Ozery

Theor. Comput. Sci., 1998

How Many Squares Can a String Contain?

Aviezri S. Fraenkel, Jamie Simpson

J. Comb. Theory A, 1998

How Far Can Nim in Disguise Be Stretched?

Uri Blass, Aviezri S. Fraenkel, Romina Guelman

J. Comb. Theory A, 1998

A New Heap Game.

Aviezri S. Fraenkel, Dmitri Zusman

Proceedings of the Computers and Games, First International Conference, 1998

Infinite Cyclic Impartial Games.

Aviezri S. Fraenkel, Ofer Rahat

Proceedings of the Computers and Games, First International Conference, 1998

1997

Combinatorial game theory foundations applied to digraph kernels.

Aviezri S. Fraenkel

Electron. J. Comb., 1997

Protein folding, spin glass and computational complexity.

Aviezri S. Fraenkel

Proceedings of the DNA Based Computers, 1997

On Weak Circular Squares in Binary Words.

Aviezri S. Fraenkel, Jamie Simpson, Mike Paterson

Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1996

Robust Universal Complete Codes for Transmission and Compression.

Aviezri S. Fraenkel, Shmuel T. Klein

Discret. Appl. Math., 1996

1995

Modular Nim.

Aviezri S. Fraenkel, Alan Jaffray, Anton Kotzig, Gert Sabidussi

Theor. Comput. Sci., 1995

Complexities of Winning Strategies in Diophantine Games.

James P. Jones, Aviezri S. Fraenkel

J. Complex., 1995

Complexity of circuit intersection in graphs.

Aviezri S. Fraenkel, Martin Loebl

Discret. Math., 1995

How Many Squares Must a Binary Sequence Contain?

Aviezri S. Fraenkel, Jamie Simpson

Electron. J. Comb., 1995

1994

Efficient Management of Dynamic Tables.

Aviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena

Inf. Process. Lett., 1994

The almost PV behavior of some far from PV algebraic integers.

Aviezri S. Fraenkel, H. Porta, Kenneth B. Stolarsky

Discret. Math., 1994

Generalized Wythoff arrays, shuffles and interspersions.

Aviezri S. Fraenkel, Clark Kimberling

Discret. Math., 1994

Even Kernels.

Aviezri S. Fraenkel

Electron. J. Comb., 1994

Complexity Aspects of Guessing Prefix Codes.

Aviezri S. Fraenkel, Shmuel T. Klein

Algorithmica, 1994

1993

Undirected Edge Geography.

Aviezri S. Fraenkel, Edward R. Scheinerman, Daniel Ullman

Theor. Comput. Sci., 1993

Geography.

Aviezri S. Fraenkel, Shai Simonson

Theor. Comput. Sci., 1993

Beatty sequences and Langford sequences.

Roger B. Eggleton, Aviezri S. Fraenkel, R. Jaime Simpson

Discret. Math., 1993

Bounding the Depth of Search Trees.

Aviezri S. Fraenkel, Shmuel T. Klein

Comput. J., 1993

1991

Nimhoff games.

Aviezri S. Fraenkel, Mordechai Lorberbom

J. Comb. Theory A, 1991

A deletion game on hypergraphs.

Aviezri S. Fraenkel, Edward R. Scheinerman

Discret. Appl. Math., 1991

1990

The Sprague-Grundy Function for Wythoff's Game.

Uri Blass, Aviezri S. Fraenkel

Theor. Comput. Sci., 1990

Irreducible disjoint covering systems (with an application to boolean algebra).

Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel

Discret. Appl. Math., 1990

Bidirectional Huffman Coding.

Aviezri S. Fraenkel, Shmuel T. Klein

Comput. J., 1990

1989

The Use and Usefulness of Numeration Systems

Aviezri S. Fraenkel

Inf. Comput., April, 1989

Properties of K-Welter's game.

N. Duvdevani, Aviezri S. Fraenkel

Discret. Math., 1989

Epidemiography with various growth functions.

Aviezri S. Fraenkel, Mordechai Lorberbom

Discret. Appl. Math., 1989

1988

Epidemiography II. Games with a dozing yet winning player.

Aviezri S. Fraenkel, Martin Loebl, Jaroslav Nesetril

J. Comb. Theory A, 1988

Covers of Product Sets and the Korec-Znám Result.

Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel

Eur. J. Comb., 1988

The number of fixed points of the majority rule.

Z. Agur, Aviezri S. Fraenkel, Shmuel T. Klein

Discret. Math., 1988

Compression of Concordances in Full-Text Retrieval Systems.

Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein

Proceedings of the SIGIR'88, 1988

1987

Robust transmission of unbounded strings using Fibonacci representations.

Alberto Apostolico, Aviezri S. Fraenkel

IEEE Trans. Inf. Theory, 1987

<i>k</i>-welter - a generalization of Welter's game.

Joseph Kahane, Aviezri S. Fraenkel

J. Comb. Theory A, 1987

PSPACE-hardness of some combinatorial games.

Aviezri S. Fraenkel, Elisheva Goldschmidt

J. Comb. Theory A, 1987

Lattice parallelotopes and disjoint covering systems.

Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel

Discret. Math., 1987

Improved Techniques for Processing Queries in Full-Text Systems.

Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal

Proceedings of the Tenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1987

1986

The generalized Sprague-Grundy function and its invariance under certain mappings.

Aviezri S. Fraenkel, Yaacov Yesha

J. Comb. Theory A, 1986

Disjoint covering systems of rational beatty sequences.

Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel

J. Comb. Theory A, 1986

A non-analytic proof of the Newman - Znám result for disjoint covering systems.

Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel

Comb., 1986

Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems.

Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal

Proceedings of the SIGIR'86, 1986

1984

A Linear Algorithm for Nonhomogeneous Spectra of Numbers.

M. Boshernitzan, Aviezri S. Fraenkel

J. Algorithms, 1984

Cayley permutations.

Moshe Mor, Aviezri S. Fraenkel

Discret. Math., 1984

1983

Problem 47 : Posed by Aviezri S. Fraenkel.

Aviezri S. Fraenkel

Discret. Math., 1983

Problem 40.

Aviezri S. Fraenkel

Discret. Math., 1983

Problem 39 : Posed by Aviezri S. Fraenkel and Anton Kotzig.

Aviezri S. Fraenkel

Discret. Math., 1983

Problem 38.

Aviezri S. Fraenkel

Discret. Math., 1983

Combinatorial Compression and Partitioning of Large Dictionaries.

Aviezri S. Fraenkel, Moshe Mor

Comput. J., 1983

Is Text Compression by Prefixes and Suffixes Practical?

Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl

Acta Informatica, 1983

Combinational Compression and Partitioning of Large Dictionaries: Theory and Experiments.

Aviezri S. Fraenkel, Moshe Mor

Proceedings of the Research and Development in Information Retrieval, 1983

Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches.

Aviezri S. Fraenkel

Proceedings of the Automata, 1983

Systems of numeration.

Aviezri S. Fraenkel

Proceedings of the 6th IEEE Symposium on Computer Arithmetic, 1983

1982

Permutation Generation on Vector Processors.

Moshe Mor, Aviezri S. Fraenkel

Comput. J., 1982

A Hash Code Method for Detecting and Correcting Spelling Errors.

Moshe Mor, Aviezri S. Fraenkel

Commun. ACM, 1982

Is Text Compression by Prefizes and Suffixes Practical?

Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl

Proceedings of the Research and Development in Information Retrieval, 1982

Retrieval in an Environment for Faulty Texts or Faulty Queries.

Moshe Mor, Aviezri S. Fraenkel

Proceedings of the Second International Conference on Databases: Improving Database Usability and Responsiveness, 1982

1981

Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n.

Aviezri S. Fraenkel, David Lichtenstein

J. Comb. Theory A, 1981

Nonhomogeneous spectra of numbers.

M. Boshernitzan, Aviezri S. Fraenkel

Discret. Math., 1981

Planar kernel and grundy with d≤3, d_out≤2, d_in≤2 are NP-complete.

Aviezri S. Fraenkel

Discret. Appl. Math., 1981

Document Classification, Indexing and Abstracting May be Inherently Difficult Problems.

Aviezri S. Fraenkel

Proceedings of the Theoretical Issues in Information Retrieval, Proceedings of the Fourth International Conference on Information Storage and Retrieval, Oakland, California, USA, May 31, 1981

Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N.

Aviezri S. Fraenkel, David Lichtenstein

Proceedings of the Automata, 1981

1980

Complexity of Solving Algebraic Equations.

Aviezri S. Fraenkel, Yaacov Yesha

Inf. Process. Lett., 1980

1979

Paired Sequential Lists in a memory Interval.

Aviezri S. Fraenkel

Inf. Process. Lett., 1979

Complexity of problems in games, graphs and algebraic equations.

Aviezri S. Fraenkel, Yaacov Yesha

Discret. Appl. Math., 1979

1978

KEDMA - Linguistic Tools for Retrieval Systems.

R. Attar, Yaacov Choueka, Nachum Dershowitz, Aviezri S. Fraenkel

J. ACM, 1978

The Complexity of Checkers on an N * N Board - Preliminary Report

Aviezri S. Fraenkel, M. R. Garey, David S. Johnson, T. Schaefer, Yaacov Yesha

Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977

Local Feedback in Full-Text Retrieval Systems.

R. Attar, Aviezri S. Fraenkel

J. ACM, 1977

1975

Further characterizations and properties of exactly covering congruences.

Aviezri S. Fraenkel

Discret. Math., 1975

1973

A Generalization of Wythoff's Game.

Aviezri S. Fraenkel, I. Borosh

J. Comb. Theory A, 1973

Complementing and Exactly Covering Sequences.

Aviezri S. Fraenkel

J. Comb. Theory A, 1973

A characterization of exactly covering congruences.

Aviezri S. Fraenkel

Discret. Math., 1973

1972

Characterization of the set of values f(n) = [na], n = 1, 2, ...

Aviezri S. Fraenkel, Jonathan Levitt, Michael Shimshoni

Discret. Math., 1972

1971

Full Text Document Retrieval: Hebrew Legal Texts.

Yaacov Choueka, M. Cohen, J. Dueck, Aviezri S. Fraenkel, M. Slae

Proceedings of the ACM SIGIR Information Storage and Retrieval Symposium, 1971

1968

Legal Information Retrieval.

Aviezri S. Fraenkel

Adv. Comput., 1968

1964

On the size of modular numbers.

Aviezri S. Fraenkel

Proceedings of the 19th ACM national conference, 1964

1961

The Use of Index Calculus and Mersenne Primes for the Design of a High-Speed Digital Multiplier.

Aviezri S. Fraenkel

J. ACM, 1961