The following pages link to Aviezri S. Fraenkel (Q200918):
Displayed 50 items.
- Complexity aspects of guessing prefix codes (Q1336967) (← links)
- The almost PV behavior of some far from PV algebraic integers (Q1343252) (← links)
- Gap problems for integer part and fractional part sequences (Q1343633) (← links)
- Even kernels (Q1346724) (← links)
- How many squares must a binary sequence contain? (Q1346736) (← links)
- Combinatorial game theory foundations applied to digraph kernels (Q1378531) (← links)
- Combinatorial games: Selected bibliography with a succinct gourmet introduction (Q1379182) (← links)
- Recent results and questions in combinatorial game complexities (Q1583532) (← links)
- On the recurrence \(f_{m+1}=b_m f_m-f_{m-1}\) and applications (Q1586778) (← links)
- A new heap game (Q1589501) (← links)
- Infinite cyclic impartial games (Q1589503) (← links)
- Arrays, numeration systems and Frankenstein games (Q1603715) (← links)
- Patterns in the generalized Fibonacci word, applied to games (Q1744753) (← links)
- An extension of the periodicity lemma to longer periods (Q1764895) (← links)
- Rulesets for Beatty games (Q1791291) (← links)
- Traveling salesmen in the presence of competition (Q1884998) (← links)
- Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)
- Complexity of circuit intersection in graphs (Q1894765) (← links)
- Robust universal complete codes for transmission and compression (Q1917238) (← links)
- Corrigendum to: ``The exact number of squares in Fibonacci words'' (Q2253205) (← links)
- Variants of \((s, t)\)-Wythoff's game (Q2357128) (← links)
- LIM is not slim (Q2453490) (← links)
- Games played by Boole and Galois (Q2473039) (← links)
- Characterization of the set of values \(f(n)=[n \alpha ], n=1,2,\dots \) (Q2555512) (← links)
- Complementing and exactly covering sequences (Q2559484) (← links)
- A characterization of exactly covering congruences (Q2559501) (← links)
- A generalization of Wythoff's game (Q2562046) (← links)
- Euclid and Wythoff games (Q2576836) (← links)
- Multivision: An Intractable Impartial Game with a Linear Winning Strategy (Q2757323) (← links)
- (Q2787594) (← links)
- Characterizing the Number of <em>m</em>-ary Partitions Modulo <em>m</em> (Q2812156) (← links)
- Herbert S. Wilf (1931–2012) (Q2813103) (← links)
- When are translations of P-positions of Wythoff's game P-positions? (Q2829174) (← links)
- Beating Your Fractional Beatty Game Opponent and: What’s the Question to Your Answer? (Q2846960) (← links)
- Ratwyt (Q2901274) (← links)
- (Q2949120) (← links)
- (Q2949121) (← links)
- (Q2949137) (← links)
- Tromping Games: Tiling with Trominoes (Q3015025) (← links)
- Robust transmission of unbounded strings using Fibonacci representations (Q3030717) (← links)
- Three Annihilation Games (Q3048640) (← links)
- (Q3123646) (← links)
- (Q3123679) (← links)
- (Q3123686) (← links)
- On Infinite Disjoint Covering Systems (Q3141276) (← links)
- A linear algorithm for nonhomogeneous spectra of numbers (Q3219006) (← links)
- (Q3221886) (← links)
- The Use of Index Calculus and Mersenne Primes for the Design of a High-Speed Digital Multiplier (Q3276908) (← links)
- On a Theorem of D. Ridout in the Theory of Diophantine Approximations (Q3292639) (← links)
- (Q3295608) (← links)