Aviezri Fraenkel

Q: What Schools Are Affiliated With Aviezri Fraenkel

Aviezri Fraenkel is affiliated with the following schools: Bar-Ilan University, Weizmann Institute of Science, Technion – Israel Institute of Technology, University of California, Los Angeles

Aviezri Fraenkel's AcademicInfluence.com Rankings

Aviezri Fraenkel

Mathematics

#2630

World Rank

#4028

Historical Rank

Measure Theory

#1716

World Rank

#2109

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Aviezri Fraenkel Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Aviezri Siegmund Fraenkel is an Israeli mathematician who has made contributions to combinatorial game theory. Biography Aviezri Siegmund Fraenkel was born in Munich, Germany, to a Jewish family, which then moved to Switzerland soon thereafter. In 1939 his family moved once more, to Jerusalem.

(See a Problem?)

Aviezri Fraenkel's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Local Feedback in Full-Text Retrieval Systems (1977) (273)
Systems of numeration (1983) (245)
Robust transmission of unbounded strings using Fibonacci representations (1987) (144)
How Many Squares Can a String Contain? (1998) (128)
How to Beat Your Wythoff Games' Opponent on Three Fronts (1982) (125)
Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n (1981) (123)
Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N (1981) (121)
Combinatorial Games: selected Bibliography with a Succinct Gourmet Introduction (2012) (112)
Robust Universal Complete Codes for Transmission and Compression (1996) (96)
The Bracket Function and Complementary Sets of Integers (1969) (85)
Novel Compression of Sparse Bit-Strings — Preliminary Report (1985) (78)
Complexity of problems in games, graphs and algebraic equations (1979) (78)
Complexity of protein folding (1993) (71)
How Many Squares Must a Binary Sequence Contain? (1997) (70)
Determination of [nθ] by its Sequence of*Differences (1978) (66)
Complementing and Exactly Covering Sequences (1973) (66)
The complexity of checkers on an N × N board (1978) (66)
Complexity, appeal and challenges of combinatorial games (2004) (66)
Extensions and restrictions of Wythoff's game preserving its p positions (2010) (64)
A Generalization of Wythoff's Game (1973) (63)
Planar kernel and grundy with d≤3, dout≤2, din≤2 are NP-complete (1981) (63)
Encyclopaedia of Mathematics, Supplement III (2002) (59)
Heap games, numeration systems and sequences (1998) (56)
Nimhoff games (1991) (53)
Undirected Edge Geography (1993) (52)
The Exact Number of Squares in Fibonacci Words (1999) (50)
Bidirectional Huffman Coding (1990) (50)
Improved hierarchical bit-vector compression in document retrieval systems (1986) (50)
Exact solutions of linear equations with rational coefficients by congruence techniques (1966) (49)
Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches (1983) (48)
The number of fixed points of the majority rule (1988) (46)
The Sprague-Grundy Function for Wythoff's Game (1990) (44)
Scenic Trails Ascending from Sea-Level Nim to Alpine Chess (1995) (39)
Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture (2010) (39)
Compression of concordances in full-text retrieval systems (1988) (38)
Improved techniques for processing queries in full-text systems (1987) (36)
Characterization of the set of values f(n) = [na], n = 1, 2, (1972) (35)
A hash code method for detecting and correcting spelling errors (1982) (34)
A Linear Algorithm for Nonhomogeneous Spectra of Numbers (1984) (33)
Bounding the Depth of Search Trees (1993) (32)
PSPACE-hardness of some combinatorial games (1987) (32)
A generalization of jarnik's theorem on diophantine approximations (1972) (32)
Combinatorial game theory foundations applied to digraph kernels (1996) (32)
Economic Traversal of Labyrinths (1970) (30)
Adjoining to Wythoff's Game its P-Positions as Moves (1998) (30)
How Far Can Nim in Disguise Be Stretched? (1997) (29)
Nonhomogeneous spectra of numbers (1981) (28)
On Invariant Games (2010) (28)
Another bridge between Nim and Wythoff (2009) (27)
Euclid and Wythoff games (2005) (27)
Protein folding, spin glass and computational complexity (1997) (26)
Gap Problems for Integer Part and Fractional Part Sequences (1995) (26)
A non-analytic proof of the newman—znám result for disjoint covering systems (1986) (26)
The generalized Sprague-Grundy function and its invariance under certain mappings (1986) (26)
New Games Related to Old and New Sequences (2003) (25)
Complexity of Solving Algebraic Equations (1980) (25)
Permutation Generation on Vector Processors (1982) (24)
Theory of annihilation games—I☆ (1982) (24)
Iterated floor function, algebraic numbers, discrete chaos, Beatty subsequences, semigroups (1994) (24)
On the determination of sets by the sets of sums of a certain order (1962) (23)
Complexity aspects of guessing prefix codes (1994) (22)
Cayley permutations (1984) (22)
Disjoint covering systems of rational beatty sequences (1986) (21)
KEDMA—Linguistic Tools for Retrieval Systems (1978) (21)
Strategy for a class of games with dynamic ties (1975) (21)
New proof of the generalized Chinese Remainder Theorem (1963) (20)
Partizan octal games: Partizan subtraction games (1987) (20)
Harnessing the unwieldy MEX function (2009) (20)
A characterization of exactly covering congruences (1973) (20)
A deletion game on hypergraphs (1991) (20)
Generalized Wythoff arrays, shuffles and interspersions (1994) (18)
The Use and Usefulness of Numeration Systems (1989) (18)
Information Retrieval from Annotated Texts (1999) (18)
The Herzog-Schönheim Conjecture for Finite Nilpotent Groups (1986) (18)
Two-Player Games on Cellular Automata (2000) (17)
Theory of annihilation games (1976) (17)
The Rat Game and the Mouse Game (2008) (17)
Traveling salesmen in the presence of competition (2002) (17)
A Decision Problem for Ultimately Periodic Sets in Nonstandard Numeration Systems (2009) (16)
Remark on the multiplicity of a partition of a group into cosets (1987) (16)
Lattice parallelotopes and disjoint covering systems (1987) (15)
Full text document retrieval: Hebrew legal texts (report on the first phase of the responsa retrieval project) (1971) (15)
The vile, dopey, evil and odious game players (2012) (15)
Complementary Systems of Integers (1977) (15)
Strategies for compounds of partizan games (1982) (15)
Complementary Iterated Floor Words and the Flora Game (2010) (15)
Characterizing the Number of m-ary Partitions Modulo m (2015) (15)
Experiments in Local Metrical Feedback in Full-Text Retrieval Systems. (1981) (15)
The Sierpiński Sieve of Nim-varieties and Binomial Coefficients (2006) (14)
Geodetic contraction games on graphs (1989) (14)
A new heap game (1998) (14)
THE STRUCTURE OF COMPLEMENTARY SETS OF INTEGERS : A 3-SHIFT THEOREM (2003) (14)
Combinatorial games with an annihilation rule (1974) (13)
Is text compression by prefixes and suffixes practical? (1983) (13)
Pseudo-Boolean Functions and Their Graphs (1984) (13)
Error-Correcting Codes Derived from Combinatorial Games (1995) (13)
Improvements to the Newman-Znám result for disjoint covering systems (1988) (13)
Aperiodic Subtraction Games (2011) (13)
The game of End-Wythoff (2009) (13)
Three Annihilation Games (1978) (13)
k-welter - a generalization of Welter's game (1987) (12)
New results for covering systems of residue sets (1986) (12)
The Raleigh game (2007) (12)
Combinatorial Compression and Partitioning of Large Dictionaries (1983) (11)
Legal Information Retrieval (1968) (10)
Epidemiography II. Games with a dozing yet winning player (1988) (10)
Infinite cyclic impartial games (1998) (10)
A very high-speed digital number sieve (1962) (10)
The Use of Index Calculus and Mersenne Primes for the Design of a High-Speed Digital Multiplier (1961) (10)
Some Arithmetical Semigroups (1990) (10)
Full text document retrieval: Hebrew legal texts (1971) (10)
Necessary condition for the existence of an incongruent covering system with odd moduli II (1986) (9)
Never Rush to Be First in Playing Nimbi (1980) (9)
A Class of Wythoff-Like Games (2012) (9)
Corrigendum to "The exact number of squares in Fibonacci words" [Theoret. Comput. Sci. 218(1) (1999) 95-106] (2014) (9)
m-ary partitions with no gaps: A characterization modulo m (2016) (8)
On a theorem of D. Ridout in the theory of Diophantine approximations. (1962) (8)
Disjoint covering systems with precisely one multiple modulus (1988) (8)
On a Curious Property of Counting Sequences (1994) (8)
Complexities of Winning Strategies in Diophantine Games (1995) (8)
Exact solutions of linear equations with rational coefficients (1971) (8)
Complexity of protein folding. (1993) (7)
Further characterizations and properties of exactly covering congruences (1975) (7)
The particles and antiparticles game (1977) (7)
Beating Your Fractional Beatty Game Opponent and: What’s the Question to Your Answer? (2013) (7)
Complexity of Error-Correcting Codes Derived from Combinatorial Games (2002) (7)
Epidemiography with various growth functions (1989) (7)
Recent results and questions in combinatorial game complexities (2000) (6)
Proof that sequences of A,C,G, and T can be assembled to produce chains of ultimate length avoiding repetitions everywhere. (1966) (6)
Properties of K-Welter's game (1989) (6)
Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory (2004) (5)
From Nim to Go (1980) (5)
A two-parameter family of an extension of Beatty sequences (2008) (5)
On infinite disjoint covering systems (1993) (5)
Multivision: An Intractable Impartial Game With a Linear Winning Strategy (1998) (5)
On Weak Circular Squares in Binary Words (1997) (5)
Semi-automatic construction of semantic concordances (1979) (5)
From Enmity to Amity (2010) (5)
Irreducible disjoint covering systems (with an application to boolean algebra) (1990) (5)
On infinite and finite covering systems (1991) (5)
LIM is not slim (2014) (4)
Even Kernels (1994) (4)
Covers of Product Sets and the Korec-Znám Result (1988) (4)
Arrays, numeration systems and Frankenstein games (2002) (4)
Combinatorial compression and partitioning of large dictionaries: theory and experiments (1983) (4)
Transcendental Numbers and a Conjecture of Erdös and Mahler (1964) (4)
Beatty sequences and Langford sequences (1993) (4)
Economic Traversal of Labyrinths (Correction) (1971) (4)
The Subword Complexity of a Two-Parameter Family of Sequences (2001) (4)
Patterns in the generalized Fibonacci word, applied to games (2018) (4)
Variants of (d, t)-Wythoff's game (2017) (3)
Paired Sequential Lists in a memory Interval (1979) (3)
Nim is Easy, Chess is Hard - But Why?? (2006) (3)
An extension of the periodicity lemma to longer periods (2005) (3)
Bibliography of Combinatorial Games: updated (2002) (3)
Rulesets for Beatty games (2018) (3)
When are Translations of P-positions of Wythoff's Game P-positions? (2014) (3)
Complementary balanced words over an arbitrary finite alphabet (2005) (3)
Fractional Dimension of a Set of Transcendental Numbers (1965) (3)
Playability and arbitrarily large rat games (2017) (3)
The almost PV behavior of some far from PV algebraic integers (1994) (3)
On the recurrence fm+1=bmfm-fm-1 and applications (2000) (3)
Mathematical Games Geography (2001) (2)
Document classification, indexing and abstracting may be inherently difficult problems (1981) (2)
Distance to the nearest integer and algebraic independence of certain real numbers (1965) (2)
Retrieval in an Environment for Faulty Texts or Faulty Queries (1982) (2)
An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture) (2001) (2)
Extensions of Wythoff ’ s Game (2013) (2)
Remembering Philip Rabinowitz (2009) (2)
Efficient Management of Dynamic Tables (1994) (2)
Geography (2021) (2)
Games played by Boole and Galois (2008) (2)
Complexity of circuit intersection in graphs (1995) (1)
Ratwyt (2012) (1)
Games on Arbitrarily Large Rats and Playability (2019) (1)
Problem 11238 (2006) (1)
Information Retrieval from Annotated Texts Information Retrieval from Annotated Texts (1998) (1)
Why are Games Exciting and Stimulating? (2007) (1)
Arrays, Numeration Systems and Games (1999) (1)
Theory of Combinatorial Games (2015) (1)
Special issue on combinatorial game theory (2018) (1)
Bibliography of Combinatorial Games (2009) (1)
Book Review: On numbers and games@@@Book Review: Surreal numbers (1978) (0)
alternately. The moves are of two types: a player may remove any positive number of tokens from a single pile, or he may take from both piles, say k (> 0) from one and 1 (> 0) from the other, (2016) (0)
CHARACTERIZING THE NUMBER OF m–ARY PARTITIONS WITH NO GAPS MODULO m (2015) (0)
On the Practical Power of Automata in Pattern Matching (2022) (0)
Martin Gardner in the Twenty-First Century: RATWYT (2012) (0)
Sets with Fixed Nim-Sum: 10564 (1999) (0)
Special issue on combinatorial game theory (2018) (0)
On Combinatorial Game Theory Foundations with Applications to Digraph Kernels (1996) (0)
Problem 39 : Posed by Aviezri S. Fraenkel and Anton Kotzig (1983) (0)
Games For Arbitrarily Fat Rats (2015) (0)
On the size of modular numbers (1964) (0)
Problem 47 : Posed by Aviezri S. Fraenkel (1983) (0)
Chapter 7: A Class of Wythoff-Like Games (2013) (0)
Unbounded Iterations of Floor Functions and the Flora Game (2009) (0)
Review: J. H. Conway, On numbers and games, and D. E. Knuth, Surreal numbers (1978) (0)
Research problem: Problem 47 (1983) (0)
Games derived from a generalized Thue-Morse word (2015) (0)
Research problemProblem 40: Posed by Aviezri S. Fraenkel (1983) (0)
NEW PROOF OF THE GENERALIZED CHINESE (2016) (0)
Integrating and Rejuvenating Old and New Gems (2014) (0)
A new class of superficially simple games in which tokens move to adjacent squares and are removed when two tokens cohabit. (2016) (0)
Problems: 10564-10570 (1997) (0)
Is Text Compression by Prefizes and Suffixes Practical? (1982) (0)
The 3rd Advanced Chess match (León, June 2-5, 2000) (2000) (0)
Patrolling the Border of a Striking Conjecture (2021) (0)
A generalization of Jarník’s theorem on Diophantine approximations to Ridout type numbers (1975) (0)
The Cyclic Butler University Game (2009) (0)
Problem 40 (1983) (0)
Searching for Disjoint Covering Systems with Precisely One Repeated Modulus (2015) (0)
A Collection of Two-Player Games on Cellular Automata (2000) (0)
Error Correcting Codes and Combinatorial Games (2007) (0)
On Abelian Circular Squares in Binary Words1 (2007) (0)
On the Practical Power of the KMP Automaton (2022) (0)
Combinatorial Games Workshop 11w5073 (2011) (0)
Tromping Games: Tiling with Trominoes (2011) (0)
The Complexity of a Two Parameter Family of Sequences (2000) (0)
Problem 38 (1983) (0)
Rulesets for Beatty games (2017) (0)
NEARLY DISJOINT COVERING SYSTEMS (2004) (0)
#G04 INTEGERS 19 (2019) GAMES ON ARBITRARILY LARGE RATS AND PLAYABILITY (2019) (0)
Note Disjoint Covering Systems of Rational Beatty Sequences (2003) (0)
Sequences Built from the Golden Ratio: 11238 (2008) (0)
LIM is not slim (2013) (0)
Extensions and restrictions of Wyhtoff's game preserving Wythoff's P-positions (2009) (0)
A Selection Of Mathematical Board Games (1999) (0)

This paper list is powered by the following services:

Other Resources About Aviezri Fraenkel

What Schools Are Affiliated With Aviezri Fraenkel?

Aviezri Fraenkel is affiliated with the following schools:

Aviezri Fraenkel's Academic­Influence.com Rankings