Aviezri S. Fraenkel

126 papers A* 10B 2C 1Journal 103Unranked 9

Year	Rank	Type	Title / Venue / Authors
2019	J	`jnl`	Games on Arbitrarily Large Rats and Playability. Integers Aviezri S. Fraenkel, Urban Larsson
2018	J	`jnl`	Patterns in the generalized Fibonacci word, applied to games. Discret. Math. Lior Goldberg, Aviezri S. Fraenkel
2018	J	`jnl`	Rulesets for Beatty games. Int. J. Game Theory Lior Goldberg, Aviezri S. Fraenkel
2018	J	`jnl`	Special issue on combinatorial game theory. Int. J. Game Theory Aviezri S. Fraenkel, Urban Larsson, Carlos Pereira dos Santos, Bernhard von Stengel
2017	J	`jnl`	Variants of (d, t)-Wythoff's game. Discret. Appl. Math. Haiyan Li, Sanyang Liu, Aviezri S. Fraenkel, Wen An Liu
2016	J	`jnl`	m-ary partitions with no gaps: A characterization modulo m. Discret. Math. George E. Andrews, Aviezri S. Fraenkel, James A. Sellers
2015	J	`jnl`	Characterizing the Number of m-ary Partitions Modulo m. Am. Math. Mon. George E. Andrews, Aviezri S. Fraenkel, James A. Sellers
2015	J	`jnl`	When are Translations of P-positions of Wythoff's Game P-positions? Integers Aviezri S. Fraenkel, Nhan Bao Ho
2014	J	`jnl`	Corrigendum to "The exact number of squares in Fibonacci words" [Theoret. Comput. Sci. 218(1) (1999) 95-106]. Theor. Comput. Sci. Aviezri S. Fraenkel, Jamie Simpson
2014	—	`conf`	Integrating and Rejuvenating Old and New Gems. Language, Culture, Computation (1) Aviezri S. Fraenkel
2014	J	`jnl`	LIM is not slim. Int. J. Game Theory Alex Fink, Aviezri S. Fraenkel, Carlos Pereira dos Santos
2013	J	`jnl`	Reflection. ICGA J. Aviezri S. Fraenkel
2012	J	`jnl`	A Class of Wythoff-Like Games. Integers Aviezri S. Fraenkel, Yuval Tanny
2012	J	`jnl`	The vile, dopey, evil and odious game players. Discret. Math. Aviezri S. Fraenkel
2011	J	`jnl`	Aperiodic Subtraction Games. Electron. J. Comb. Aviezri S. Fraenkel
2011	J	`jnl`	Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture. Theor. Comput. Sci. Urban Larsson, Peter Hegarty, Aviezri S. Fraenkel
2011	J	`jnl`	Tromping Games: Tiling With Trominoes. Integers Saúl A. Blanco, Aviezri S. Fraenkel
2010	J	`jnl`	Complementary Iterated Floor Words and the Flora Game. SIAM J. Discret. Math. Aviezri S. Fraenkel
2010	J	`jnl`	Extensions and restrictions of Wythoff's game preserving its p positions. J. Comb. Theory A Éric Duchêne, Aviezri S. Fraenkel, Richard J. Nowakowski, Michel Rigo
2010	J	`jnl`	From Enmity to Amity. Am. Math. Mon. Aviezri S. Fraenkel
2009	J	`jnl`	A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems CoRR Jason P. Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo
2009	J	`jnl`	A Decision Problem for Ultimately Periodic Sets in Nonstandard Numeration Systems. Int. J. Algebra Comput. Jason P. Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo
2009	J	`jnl`	Another bridge between Nim and Wythoff. Australas. J Comb. Éric Duchêne, Aviezri S. Fraenkel, Sylvain Gravier, Richard J. Nowakowski
2009	—	`ch.`	Remembering Philip Rabinowitz. The Birth of Numerical Analysis Philip J. Davis, Aviezri S. Fraenkel
2008	J	`jnl`	A two-parameter family of an extension of Beatty sequences. Discret. Math. Shiri Artstein-Avidan, Aviezri S. Fraenkel, Vera T. Sós
2008	J	`jnl`	Games played by Boole and Galois. Discret. Appl. Math. Aviezri S. Fraenkel
2008	J	`jnl`	Problem 11365. Am. Math. Mon. Aviezri S. Fraenkel
2008	J	`jnl`	Sequences Built from the Golden Ratio: 11238. Am. Math. Mon. Aviezri S. Fraenkel
2006	J	`jnl`	Nim is Easy, Chess is Hard - But Why?? ICGA J. Aviezri S. Fraenkel
2006	J	`jnl`	Problem 11238. Am. Math. Mon. Aviezri S. Fraenkel
2005	J	`jnl`	An extension of the periodicity lemma to longer periods. Discret. Appl. Math. Aviezri S. Fraenkel, Jamie Simpson
2005	J	`jnl`	Euclid and Wythoff games. Discret. Math. Aviezri S. Fraenkel
2004	J	`jnl`	Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory. Theor. Comput. Sci. Erik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, Richard J. Nowakowski
2004	J	`jnl`	Complexity, appeal and challenges of combinatorial games. Theor. Comput. Sci. Aviezri S. Fraenkel
2004	J	`jnl`	Traveling salesmen in the presence of competition. Theor. Comput. Sci. Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt
2003	—	`conf`	New Games Related to Old and New Sequences. ACG Aviezri S. Fraenkel
2002	J	`jnl`	Arrays, numeration systems and Frankenstein games. Theor. Comput. Sci. Aviezri S. Fraenkel
2002	—	`conf`	Complexity of Error-Correcting Codes Derived from Combinatorial Games. Computers and Games Aviezri S. Fraenkel, Ofer Rahat
2002	J	`jnl`	Traveling Salesmen in the Presence of Competition CoRR Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt
2001	J	`jnl`	A new heap game. Theor. Comput. Sci. Aviezri S. Fraenkel, Dmitri Zusman
2001	B	`conf`	An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture). CPM Aviezri S. Fraenkel, Jamie Simpson
2001	J	`jnl`	Infinite cyclic impartial games. Theor. Comput. Sci. Aviezri S. Fraenkel, Ofer Rahat
2001	J	`jnl`	The Subword Complexity of a Two-Parameter Family of Sequences. Electron. J. Comb. Aviezri S. Fraenkel, Tamar Seeman, Jamie Simpson
2000	J	`jnl`	On the recurrence f Discret. Math. Aviezri S. Fraenkel
2000	J	`jnl`	Recent results and questions in combinatorial game complexities. Theor. Comput. Sci. Aviezri S. Fraenkel
2000	—	`conf`	Virus Versus Mankind. Computers and Games Aviezri S. Fraenkel
1999	J	`jnl`	Information Retrieval from Annotated Texts. J. Am. Soc. Inf. Sci. Aviezri S. Fraenkel, Shmuel T. Klein
1999	J	`jnl`	The Exact Number of Squares in Fibonacci Words. Theor. Comput. Sci. Aviezri S. Fraenkel, Jamie Simpson
1998	—	`conf`	A New Heap Game. Computers and Games Aviezri S. Fraenkel, Dmitri Zusman
1998	J	`jnl`	Adjoining to Wythoff's Game its Theor. Comput. Sci. Aviezri S. Fraenkel, Michal Ozery
1998	J	`jnl`	How Far Can Nim in Disguise Be Stretched? J. Comb. Theory A Uri Blass, Aviezri S. Fraenkel, Romina Guelman
1998	J	`jnl`	How Many Squares Can a String Contain? J. Comb. Theory A Aviezri S. Fraenkel, Jamie Simpson
1998	—	`conf`	Infinite Cyclic Impartial Games. Computers and Games Aviezri S. Fraenkel, Ofer Rahat
1997	J	`jnl`	Combinatorial game theory foundations applied to digraph kernels. Electron. J. Comb. Aviezri S. Fraenkel
1997	B	`conf`	On Weak Circular Squares in Binary Words. CPM Aviezri S. Fraenkel, Jamie Simpson, Mike Paterson
1997	—	`conf`	Protein folding, spin glass and computational complexity. DNA Based Computers Aviezri S. Fraenkel
1996	J	`jnl`	Robust Universal Complete Codes for Transmission and Compression. Discret. Appl. Math. Aviezri S. Fraenkel, Shmuel T. Klein
1995	J	`jnl`	Complexities of Winning Strategies in Diophantine Games. J. Complex. James P. Jones, Aviezri S. Fraenkel
1995	J	`jnl`	Complexity of circuit intersection in graphs. Discret. Math. Aviezri S. Fraenkel, Martin Loebl
1995	J	`jnl`	How Many Squares Must a Binary Sequence Contain? Electron. J. Comb. Aviezri S. Fraenkel, Jamie Simpson
1995	J	`jnl`	Modular Nim. Theor. Comput. Sci. Aviezri S. Fraenkel, Alan Jaffray, Anton Kotzig, Gert Sabidussi
1994	J	`jnl`	Complexity Aspects of Guessing Prefix Codes. Algorithmica Aviezri S. Fraenkel, Shmuel T. Klein
1994	J	`jnl`	Efficient Management of Dynamic Tables. Inf. Process. Lett. Aviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena
1994	J	`jnl`	Even Kernels. Electron. J. Comb. Aviezri S. Fraenkel
1994	J	`jnl`	Generalized Wythoff arrays, shuffles and interspersions. Discret. Math. Aviezri S. Fraenkel, Clark Kimberling
1994	J	`jnl`	The almost PV behavior of some far from PV algebraic integers. Discret. Math. Aviezri S. Fraenkel, H. Porta, Kenneth B. Stolarsky
1993	J	`jnl`	Beatty sequences and Langford sequences. Discret. Math. Roger B. Eggleton, Aviezri S. Fraenkel, R. Jaime Simpson
1993	J	`jnl`	Bounding the Depth of Search Trees. Comput. J. Aviezri S. Fraenkel, Shmuel T. Klein
1993	J	`jnl`	Geography. Theor. Comput. Sci. Aviezri S. Fraenkel, Shai Simonson
1993	J	`jnl`	Undirected Edge Geography. Theor. Comput. Sci. Aviezri S. Fraenkel, Edward R. Scheinerman, Daniel Ullman
1991	J	`jnl`	A deletion game on hypergraphs. Discret. Appl. Math. Aviezri S. Fraenkel, Edward R. Scheinerman
1991	J	`jnl`	Nimhoff games. J. Comb. Theory A Aviezri S. Fraenkel, Mordechai Lorberbom
1990	J	`jnl`	Bidirectional Huffman Coding. Comput. J. Aviezri S. Fraenkel, Shmuel T. Klein
1990	J	`jnl`	Irreducible disjoint covering systems (with an application to boolean algebra). Discret. Appl. Math. Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel
1990	J	`jnl`	The Sprague-Grundy Function for Wythoff's Game. Theor. Comput. Sci. Uri Blass, Aviezri S. Fraenkel
1989	J	`jnl`	Epidemiography with various growth functions. Discret. Appl. Math. Aviezri S. Fraenkel, Mordechai Lorberbom
1989	J	`jnl`	Properties of K-Welter's game. Discret. Math. N. Duvdevani, Aviezri S. Fraenkel
1989	J	`jnl`	The Use and Usefulness of Numeration Systems Inf. Comput. Aviezri S. Fraenkel
1988	A*	`conf`	Compression of Concordances in Full-Text Retrieval Systems. SIGIR Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein
1988	J	`jnl`	Covers of Product Sets and the Korec-Znám Result. Eur. J. Comb. Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel
1988	J	`jnl`	Epidemiography II. Games with a dozing yet winning player. J. Comb. Theory A Aviezri S. Fraenkel, Martin Loebl, Jaroslav Nesetril
1988	J	`jnl`	The number of fixed points of the majority rule. Discret. Math. Z. Agur, Aviezri S. Fraenkel, Shmuel T. Klein
1987	A*	`conf`	Improved Techniques for Processing Queries in Full-Text Systems. SIGIR Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal
1987	J	`jnl`	Lattice parallelotopes and disjoint covering systems. Discret. Math. Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel
1987	J	`jnl`	PSPACE-hardness of some combinatorial games. J. Comb. Theory A Aviezri S. Fraenkel, Elisheva Goldschmidt
1987	J	`jnl`	Robust transmission of unbounded strings using Fibonacci representations. IEEE Trans. Inf. Theory Alberto Apostolico, Aviezri S. Fraenkel
1986	J	`jnl`	A non-analytic proof of the Newman - Znám result for disjoint covering systems. Comb. Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel
1986	J	`jnl`	Disjoint covering systems of rational beatty sequences. J. Comb. Theory A Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel
1986	A*	`conf`	Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems. SIGIR Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal
1986	J	`jnl`	The generalized Sprague-Grundy function and its invariance under certain mappings. J. Comb. Theory A Aviezri S. Fraenkel, Yaacov Yesha
1984	J	`jnl`	A Linear Algorithm for Nonhomogeneous Spectra of Numbers. J. Algorithms M. Boshernitzan, Aviezri S. Fraenkel
1984	J	`jnl`	Cayley permutations. Discret. Math. Moshe Mor, Aviezri S. Fraenkel
1984	J	`jnl`	Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. Theor. Comput. Sci. Aviezri S. Fraenkel
1983	A*	`conf`	Combinational Compression and Partitioning of Large Dictionaries: Theory and Experiments. SIGIR Aviezri S. Fraenkel, Moshe Mor
1983	J	`jnl`	Combinatorial Compression and Partitioning of Large Dictionaries. Comput. J. Aviezri S. Fraenkel, Moshe Mor
1983	J	`jnl`	Is Text Compression by Prefixes and Suffixes Practical? Acta Informatica Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl
1983	J	`jnl`	Problem 38. Discret. Math. Aviezri S. Fraenkel
1983	J	`jnl`	Problem 39 : Posed by Aviezri S. Fraenkel and Anton Kotzig. Discret. Math. Aviezri S. Fraenkel
1983	J	`jnl`	Problem 40. Discret. Math. Aviezri S. Fraenkel
1983	J	`jnl`	Problem 47 : Posed by Aviezri S. Fraenkel. Discret. Math. Aviezri S. Fraenkel
1983	C	`conf`	Systems of numeration. IEEE Symposium on Computer Arithmetic Aviezri S. Fraenkel
1983	A*	`conf`	Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. ICALP Aviezri S. Fraenkel
1982	J	`jnl`	A Hash Code Method for Detecting and Correcting Spelling Errors. Commun. ACM Moshe Mor, Aviezri S. Fraenkel
1982	A*	`conf`	Is Text Compression by Prefizes and Suffixes Practical? SIGIR Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl
1982	J	`jnl`	Permutation Generation on Vector Processors. Comput. J. Moshe Mor, Aviezri S. Fraenkel
1982	—	`conf`	Retrieval in an Environment for Faulty Texts or Faulty Queries. JCDKB Moshe Mor, Aviezri S. Fraenkel
1981	J	`jnl`	Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n. J. Comb. Theory A Aviezri S. Fraenkel, David Lichtenstein
1981	A*	`conf`	Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N. ICALP Aviezri S. Fraenkel, David Lichtenstein
1981	A*	`conf`	Document Classification, Indexing and Abstracting May be Inherently Difficult Problems. SIGIR Aviezri S. Fraenkel
1981	J	`jnl`	Nonhomogeneous spectra of numbers. Discret. Math. M. Boshernitzan, Aviezri S. Fraenkel
1981	J	`jnl`	Planar kernel and grundy with d≤3, d Discret. Appl. Math. Aviezri S. Fraenkel
1980	J	`jnl`	Complexity of Solving Algebraic Equations. Inf. Process. Lett. Aviezri S. Fraenkel, Yaacov Yesha
1979	J	`jnl`	Complexity of problems in games, graphs and algebraic equations. Discret. Appl. Math. Aviezri S. Fraenkel, Yaacov Yesha
1979	J	`jnl`	Paired Sequential Lists in a memory Interval. Inf. Process. Lett. Aviezri S. Fraenkel
1978	J	`jnl`	KEDMA - Linguistic Tools for Retrieval Systems. J. ACM R. Attar, Yaacov Choueka, Nachum Dershowitz, Aviezri S. Fraenkel
1978	A*	`conf`	The Complexity of Checkers on an N * N Board - Preliminary Report FOCS Aviezri S. Fraenkel, M. R. Garey, David S. Johnson, T. Schaefer, Yaacov Yesha
1977	J	`jnl`	Local Feedback in Full-Text Retrieval Systems. J. ACM R. Attar, Aviezri S. Fraenkel
1975	J	`jnl`	Further characterizations and properties of exactly covering congruences. Discret. Math. Aviezri S. Fraenkel
1973	J	`jnl`	A Generalization of Wythoff's Game. J. Comb. Theory A Aviezri S. Fraenkel, I. Borosh
1973	J	`jnl`	A characterization of exactly covering congruences. Discret. Math. Aviezri S. Fraenkel
1973	J	`jnl`	Complementing and Exactly Covering Sequences. J. Comb. Theory A Aviezri S. Fraenkel
1972	J	`jnl`	Characterization of the set of values f(n) = [na], n = 1, 2, ... Discret. Math. Aviezri S. Fraenkel, Jonathan Levitt, Michael Shimshoni
1971	A*	`conf`	Full Text Document Retrieval: Hebrew Legal Texts. SIGIR Yaacov Choueka, M. Cohen, J. Dueck, Aviezri S. Fraenkel, M. Slae
1968	J	`jnl`	Legal Information Retrieval. Adv. Comput. Aviezri S. Fraenkel
1964	—	`conf`	On the size of modular numbers. ACM National Conference Aviezri S. Fraenkel
1961	J	`jnl`	The Use of Index Calculus and Mersenne Primes for the Design of a High-Speed Digital Multiplier. J. ACM Aviezri S. Fraenkel