Aviezri S. Fraenkel

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 



On csauthors.net:


Games on Arbitrarily Large Rats and Playability.
Integers, 2019

Rulesets for Beatty games.
Int. J. Game Theory, 2018

Special issue on combinatorial game theory.
Int. J. Game Theory, 2018

Patterns in the generalized Fibonacci word, applied to games.
Discret. Math., 2018

Variants of (d, t)-Wythoff's game.
Discret. Appl. Math., 2017

m-ary partitions with no gaps: A characterization modulo m.
Discret. Math., 2016

Characterizing the Number of m-ary Partitions Modulo m.
Am. Math. Mon., 2015

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

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

LIM is not slim.
Int. J. Game Theory, 2014

Integrating and Rejuvenating Old and New Gems.
Proceedings of the Language, Culture, Computation. Computing - Theory and Technology, 2014

J. Int. Comput. Games Assoc., 2013

A Class of Wythoff-Like Games.
Integers, 2012

The vile, dopey, evil and odious game players.
Discret. Math., 2012

Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture.
Theor. Comput. Sci., 2011

Tromping Games: Tiling With Trominoes.
Integers, 2011

Aperiodic Subtraction Games.
Electr. J. Comb., 2011

From Enmity to Amity.
Am. Math. Mon., 2010

Complementary Iterated Floor Words and the Flora Game.
SIAM J. Discret. Math., 2010

Extensions and restrictions of Wythoff's game preserving its p positions.
J. Comb. Theory, Ser. A, 2010

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

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

Another bridge between Nim and Wythoff.
Australas. J Comb., 2009

Remembering Philip Rabinowitz.
Proceedings of the Birth of Numerical Analysis, 2009

Sequences Built from the Golden Ratio: 11238.
Am. Math. Mon., 2008

Problem 11365.
Am. Math. Mon., 2008

A two-parameter family of an extension of Beatty sequences.
Discret. Math., 2008

Games played by Boole and Galois.
Discret. Appl. Math., 2008

Problem 11238.
Am. Math. Mon., 2006

Nim is Easy, Chess is Hard - But Why??
J. Int. Comput. Games Assoc., 2006

Euclid and Wythoff games.
Discret. Math., 2005

An extension of the periodicity lemma to longer periods.
Discret. Appl. Math., 2005

Complexity, appeal and challenges of combinatorial games.
Theor. Comput. Sci., 2004

Traveling salesmen in the presence of competition.
Theor. Comput. Sci., 2004

Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory.
Theor. Comput. Sci., 2004

New Games Related to Old and New Sequences.
Proceedings of the Advances in Computer Games, 2003

Arrays, numeration systems and Frankenstein games.
Theor. Comput. Sci., 2002

Complexity of Error-Correcting Codes Derived from Combinatorial Games.
Proceedings of the Computers and Games, Third International Conference, CG 2002, Edmonton, 2002

A new heap game.
Theor. Comput. Sci., 2001

Infinite cyclic impartial games.
Theor. Comput. Sci., 2001

The Subword Complexity of a Two-Parameter Family of Sequences.
Electr. J. Comb., 2001

An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture).
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

Recent results and questions in combinatorial game complexities.
Theor. Comput. Sci., 2000

On the recurrence fm+1=bmfm-fm-1 and applications.
Discret. Math., 2000

Virus Versus Mankind.
Proceedings of the Computers and Games, Second International Conference, 2000

The Exact Number of Squares in Fibonacci Words.
Theor. Comput. Sci., 1999

Information Retrieval from Annotated Texts.
J. Am. Soc. Inf. Sci., 1999

Adjoining to Wythoff's Game its P-Positions as Moves.
Theor. Comput. Sci., 1998

How Many Squares Can a String Contain?
J. Comb. Theory, Ser. A, 1998

How Far Can Nim in Disguise Be Stretched?
J. Comb. Theory, Ser. A, 1998

Combinatorial game theory foundations applied to digraph kernels.
Electr. J. Comb., 1997

Protein folding, spin glass and computational complexity.
Proceedings of the DNA Based Computers, 1997

On Weak Circular Squares in Binary Words.
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

Robust Universal Complete Codes for Transmission and Compression.
Discret. Appl. Math., 1996

Modular Nim.
Theor. Comput. Sci., 1995

Complexities of Winning Strategies in Diophantine Games.
J. Complex., 1995

Complexity of circuit intersection in graphs.
Discret. Math., 1995

How Many Squares Must a Binary Sequence Contain?
Electr. J. Comb., 1995

Efficient Management of Dynamic Tables.
Inf. Process. Lett., 1994

The almost PV behavior of some far from PV algebraic integers.
Discret. Math., 1994

Generalized Wythoff arrays, shuffles and interspersions.
Discret. Math., 1994

Even Kernels.
Electr. J. Comb., 1994

Complexity Aspects of Guessing Prefix Codes.
Algorithmica, 1994

Undirected Edge Geography.
Theor. Comput. Sci., 1993

Theor. Comput. Sci., 1993

Beatty sequences and Langford sequences.
Discret. Math., 1993

Bounding the Depth of Search Trees.
Comput. J., 1993

Nimhoff games.
J. Comb. Theory, Ser. A, 1991

A deletion game on hypergraphs.
Discret. Appl. Math., 1991

The Sprague-Grundy Function for Wythoff's Game.
Theor. Comput. Sci., 1990

Irreducible disjoint covering systems (with an application to boolean algebra).
Discret. Appl. Math., 1990

Bidirectional Huffman Coding.
Comput. J., 1990

The Use and Usefulness of Numeration Systems
Inf. Comput., April, 1989

Properties of K-Welter's game.
Discret. Math., 1989

Epidemiography with various growth functions.
Discret. Appl. Math., 1989

Epidemiography II. Games with a dozing yet winning player.
J. Comb. Theory, Ser. A, 1988

Covers of Product Sets and the Korec-Znám Result.
Eur. J. Comb., 1988

The number of fixed points of the majority rule.
Discret. Math., 1988

Compression of Concordances in Full-Text Retrieval Systems.
Proceedings of the SIGIR'88, 1988

Robust transmission of unbounded strings using Fibonacci representations.
IEEE Trans. Inf. Theory, 1987

k-welter - a generalization of Welter's game.
J. Comb. Theory, Ser. A, 1987

PSPACE-hardness of some combinatorial games.
J. Comb. Theory, Ser. A, 1987

Lattice parallelotopes and disjoint covering systems.
Discret. Math., 1987

Improved Techniques for Processing Queries in Full-Text Systems.
Proceedings of the Tenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1987

The generalized Sprague-Grundy function and its invariance under certain mappings.
J. Comb. Theory, Ser. A, 1986

Disjoint covering systems of rational beatty sequences.
J. Comb. Theory, Ser. A, 1986

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

Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems.
Proceedings of the SIGIR'86, 1986

Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches.
Theor. Comput. Sci., 1984

A Linear Algorithm for Nonhomogeneous Spectra of Numbers.
J. Algorithms, 1984

Cayley permutations.
Discret. Math., 1984

Problem 47 : Posed by Aviezri S. Fraenkel.
Discret. Math., 1983

Problem 40.
Discret. Math., 1983

Problem 39 : Posed by Aviezri S. Fraenkel and Anton Kotzig.
Discret. Math., 1983

Problem 38.
Discret. Math., 1983

Combinatorial Compression and Partitioning of Large Dictionaries.
Comput. J., 1983

Is Text Compression by Prefixes and Suffixes Practical?
Acta Informatica, 1983

Combinational Compression and Partitioning of Large Dictionaries: Theory and Experiments.
Proceedings of the Research and Development in Information Retrieval, 1983

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

Permutation Generation on Vector Processors.
Comput. J., 1982

A Hash Code Method for Detecting and Correcting Spelling Errors.
Commun. ACM, 1982

Is Text Compression by Prefizes and Suffixes Practical?
Proceedings of the Research and Development in Information Retrieval, 1982

Retrieval in an Environment for Faulty Texts or Faulty Queries.
Proceedings of the Second International Conference on Databases: Improving Database Usability and Responsiveness, 1982

Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n.
J. Comb. Theory, Ser. A, 1981

Nonhomogeneous spectra of numbers.
Discret. Math., 1981

Planar kernel and grundy with d≤3, dout≤2, din≤2 are NP-complete.
Discret. Appl. Math., 1981

Document Classification, Indexing and Abstracting May be Inherently Difficult Problems.
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.
Proceedings of the Automata, 1981

Complexity of Solving Algebraic Equations.
Inf. Process. Lett., 1980

Paired Sequential Lists in a memory Interval.
Inf. Process. Lett., 1979

Complexity of problems in games, graphs and algebraic equations.
Discret. Appl. Math., 1979

KEDMA - Linguistic Tools for Retrieval Systems.
J. ACM, 1978

The Complexity of Checkers on an N * N Board - Preliminary Report
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

Local Feedback in Full-Text Retrieval Systems.
J. ACM, 1977

Further characterizations and properties of exactly covering congruences.
Discret. Math., 1975

A Generalization of Wythoff's Game.
J. Comb. Theory, Ser. A, 1973

Complementing and Exactly Covering Sequences.
J. Comb. Theory, Ser. A, 1973

A characterization of exactly covering congruences.
Discret. Math., 1973

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

Full Text Document Retrieval: Hebrew Legal Texts.
Proceedings of the ACM SIGIR Information Storage and Retrieval Symposium, 1971

Legal Information Retrieval.
Adv. Comput., 1968

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