DBLP: Aviezri S. Fraenkel

	2012
j82		Aviezri S. Fraenkel: The vile, dopey, evil and odious game players. Discrete Mathematics 312(1): 42-46 (2012)
	2011
j81		Aviezri S. Fraenkel: Aperiodic Subtraction Games. Electr. J. Comb. 18(2) (2011)
j80		Urban Larsson, Peter Hegarty, Aviezri S. Fraenkel: Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture. Theor. Comput. Sci. 412(8-10): 729-735 (2011)
	2010
j79		Éric Duchêne, Aviezri S. Fraenkel, Richard J. Nowakowski, Michel Rigo: Extensions and restrictions of Wythoff's game preserving its p positions. J. Comb. Theory, Ser. A 117(5): 545-567 (2010)
j78		Aviezri S. Fraenkel: Complementary Iterated Floor Words and the Flora Game. SIAM J. Discrete Math. 24(2): 570-588 (2010)
j77		Aviezri S. Fraenkel: From Enmity to Amity. The American Mathematical Monthly 117(7): 646-648 (2010)
	2009
j76		Jason Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo: A Decision Problem for Ultimately Periodic Sets in Nonstandard Numeration Systems. IJAC 19(6): 809-839 (2009)
i2		Jason Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo: A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems. CoRR abs/0907.0620 (2009)
	2008
j75		Aviezri S. Fraenkel: Games played by Boole and Galois. Discrete Applied Mathematics 156(4): 420-427 (2008)
j74		Shiri Artstein-Avidan, Aviezri S. Fraenkel, Vera T. Sós: A two-parameter family of an extension of Beatty sequences. Discrete Mathematics 308(20): 4578-4588 (2008)
j73		Aviezri S. Fraenkel: Problem 11365. The American Mathematical Monthly 115(5): 462 (2008)
j72		Aviezri S. Fraenkel: Sequences Built from the Golden Ratio: 11238. The American Mathematical Monthly 115(7): 667-668 (2008)
	2006
j71		Aviezri S. Fraenkel: Nim is Easy, Chess is Hard - But Why?? ICGA Journal 29(4): 203-206 (2006)
j70		Aviezri S. Fraenkel: Problem 11238. The American Mathematical Monthly 113(7): 655 (2006)
	2005
j69		Aviezri S. Fraenkel, Jamie Simpson: An extension of the periodicity lemma to longer periods. Discrete Applied Mathematics 146(2): 146-155 (2005)
j68		Aviezri S. Fraenkel: Euclid and Wythoff games. Discrete Mathematics 304(1-3): 65-68 (2005)
	2004
j67		Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt: Traveling salesmen in the presence of competition. Theor. Comput. Sci. 303(3): 377-392 (2004)
j66		Aviezri S. Fraenkel: Complexity, appeal and challenges of combinatorial games. Theor. Comput. Sci. 303(3): 393-415 (2004)
j65		Erik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, Richard J. Nowakowski: Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory. Theor. Comput. Sci. 303(3): 539-543 (2004)
	2003
c19		Aviezri S. Fraenkel: New Games Related to Old and New Sequences. ACG 2003: 367-382
	2002
j64		Aviezri S. Fraenkel: Arrays, numeration systems and Frankenstein games. Theor. Comput. Sci. 282(2): 271-284 (2002)
c18		Aviezri S. Fraenkel, Ofer Rahat: Complexity of Error-Correcting Codes Derived from Combinatorial Games. Computers and Games 2002: 201-212
i1		Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt: Traveling Salesmen in the Presence of Competition. CoRR cs.CC/0212001 (2002)
	2001
j63		Aviezri S. Fraenkel, Tamar Seeman, Jamie Simpson: The Subword Complexity of a Two-Parameter Family of Sequences. Electr. J. Comb. 8(2) (2001)
j62		Aviezri S. Fraenkel, Dmitri Zusman: A new heap game. Theor. Comput. Sci. 252(1-2): 5-12 (2001)
j61		Aviezri S. Fraenkel, Ofer Rahat: Infinite cyclic impartial games. Theor. Comput. Sci. 252(1-2): 13-22 (2001)
c17		Aviezri S. Fraenkel, Jamie Simpson: An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture). CPM 2001: 98-105
	2000
j60		Aviezri S. Fraenkel: On the recurrence f_m+1=b_mf_m-f_m-1 and applications. Discrete Mathematics 224(1-3): 273-279 (2000)
j59		Aviezri S. Fraenkel: Recent results and questions in combinatorial game complexities. Theor. Comput. Sci. 249(2): 265-288 (2000)
c16		Aviezri S. Fraenkel: Virus Versus Mankind. Computers and Games 2000: 204-213
	1999
j58		Aviezri S. Fraenkel, Shmuel T. Klein: Information Retrieval from Annotated Texts. JASIS 50(10): 845-854 (1999)
j57		Aviezri S. Fraenkel, Jamie Simpson: The Exact Number of Squares in Fibonacci Words. Theor. Comput. Sci. 218(1): 95-106 (1999)
	1998
j56		Aviezri S. Fraenkel, Jamie Simpson: How Many Squares Can a String Contain? J. Comb. Theory, Ser. A 82(1): 112-120 (1998)
j55		Uri Blass, Aviezri S. Fraenkel, Romina Guelman: How Far Can Nim in Disguise Be Stretched? J. Comb. Theory, Ser. A 84(2): 145-156 (1998)
j54		Aviezri S. Fraenkel, Michal Ozery: Adjoining to Wythoff's Game its P-Positions as Moves. Theor. Comput. Sci. 205(1-2): 283-296 (1998)
c15		Aviezri S. Fraenkel, Dmitri Zusman: A New Heap Game. Computers and Games 1998: 205-211
c14		Aviezri S. Fraenkel, Ofer Rahat: Infinite Cyclic Impartial Games. Computers and Games 1998: 212-221
	1997
j53		Aviezri S. Fraenkel: Combinatorial game theory foundations applied to digraph kernels. Electr. J. Comb. 4(2) (1997)
c13		Aviezri S. Fraenkel, Jamie Simpson, Mike Paterson: On Weak Circular Squares in Binary Words. CPM 1997: 76-82
	1996
j52		Aviezri S. Fraenkel, Shmuel T. Klein: Robust Universal Complete Codes for Transmission and Compression. Discrete Applied Mathematics 64(1): 31-55 (1996)
	1995
j51		Aviezri S. Fraenkel, Jamie Simpson: How Many Squares Must a Binary Sequence Contain? Electr. J. Comb. 2 (1995)
j50		Aviezri S. Fraenkel, Martin Loebl: Complexity of circuit intersection in graphs. Discrete Mathematics 141(1-3): 135-151 (1995)
j49		James P. Jones, Aviezri S. Fraenkel: Complexities of Winning Strategies in Diophantine Games. J. Complexity 11(4): 435-455 (1995)
j48		Aviezri S. Fraenkel, Alan Jaffray, Anton Kotzig, Gert Sabidussi: Modular Nim. Theor. Comput. Sci. 143(2): 319-333 (1995)
	1994
j47		Aviezri S. Fraenkel, Shmuel T. Klein: Complexity Aspects of Guessing Prefix Codes. Algorithmica 12(4/5): 409-419 (1994)
j46		Aviezri S. Fraenkel: Even Kernels. Electr. J. Comb. 1 (1994)
j45		Aviezri S. Fraenkel, Clark Kimberling: Generalized Wythoff arrays, shuffles and interspersions. Discrete Mathematics 126(1-3): 137-149 (1994)
j44		Aviezri S. Fraenkel, H. Porta, Kenneth B. Stolarsky: The almost PV behavior of some far from PV algebraic integers. Discrete Mathematics 135(1-3): 93-101 (1994)
j43		Aviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena: Efficient Management of Dynamic Tables. Inf. Process. Lett. 50(1): 25-30 (1994)
	1993
j42		Aviezri S. Fraenkel, Shmuel T. Klein: Bounding the Depth of Search Trees. Comput. J. 36(7): 668-678 (1993)
j41		Roger B. Eggleton, Aviezri S. Fraenkel, R. Jaime Simpson: Beatty sequences and Langford sequences. Discrete Mathematics 111(1-3): 165-178 (1993)
j40		Aviezri S. Fraenkel, Shai Simonson: Geography. Theor. Comput. Sci. 110(1): 197-214 (1993)
j39		Aviezri S. Fraenkel, Edward R. Scheinerman, Daniel Ullman: Undirected Edge Geography. Theor. Comput. Sci. 112(2): 371-381 (1993)
	1991
j38		Aviezri S. Fraenkel, Edward R. Scheinerman: A deletion game on hypergraphs. Discrete Applied Mathematics 30(2-3): 155-162 (1991)
j37		Aviezri S. Fraenkel, Mordechai Lorberbom: Nimhoff games. J. Comb. Theory, Ser. A 58(1): 1-25 (1991)
	1990
j36		Aviezri S. Fraenkel, Shmuel T. Klein: Bidirectional Huffman Coding. Comput. J. 33(4): 296-307 (1990)
j35		Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel: Irreducible disjoint covering systems (with an application to boolean algebra). Discrete Applied Mathematics 29(2-3): 143-164 (1990)
j34		Uri Blass, Aviezri S. Fraenkel: The Sprague-Grundy Function for Wythoff's Game. Theor. Comput. Sci. 75(3): 311-333 (1990)
	1989
j33		Aviezri S. Fraenkel, Mordechai Lorberbom: Epidemiography with various growth functions. Discrete Applied Mathematics 25(1-2): 53-71 (1989)
j32		N. Duvdevani, Aviezri S. Fraenkel: Properties of K-Welter's game. Discrete Mathematics 76(3): 197-221 (1989)
j31		Aviezri S. Fraenkel: The Use and Usefulness of Numeration Systems. Inf. Comput. 81(1): 46-61 (1989)
	1988
j30		Z. Agur, Aviezri S. Fraenkel, Shmuel T. Klein: The number of fixed points of the majority rule. Discrete Mathematics 70(3): 295-302 (1988)
j29		Aviezri S. Fraenkel, Martin Loebl, Jaroslav Nesetril: Epidemiography II. Games with a dozing yet winning player. J. Comb. Theory, Ser. A 49(1): 129-144 (1988)
c12		Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein: Compression of Concordances in Full-Text Retrieval Systems. SIGIR 1988: 597-612
	1987
j28		Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel: Lattice parallelotopes and disjoint covering systems. Discrete Mathematics 65(1): 23-46 (1987)
j27		Joseph Kahane, Aviezri S. Fraenkel: k-welter - a generalization of Welter's game. J. Comb. Theory, Ser. A 46(1): 1-20 (1987)
j26		Aviezri S. Fraenkel, Elisheva Goldschmidt: PSPACE-hardness of some combinatorial games. J. Comb. Theory, Ser. A 46(1): 21-38 (1987)
j25		Alberto Apostolico, Aviezri S. Fraenkel: Robust transmission of unbounded strings using Fibonacci representations. IEEE Transactions on Information Theory 33(2): 238-245 (1987)
c11		Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal: Improved Techniques for Processing Queries in Full-Text Systems. SIGIR 1987: 306-315
	1986
j24		Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel: A non-analytic proof of the Newman - Znám result for disjoint covering systems. Combinatorica 6(3): 235-343 (1986)
j23		Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel: Disjoint covering systems of rational beatty sequences. J. Comb. Theory, Ser. A 42(1): 150-153 (1986)
j22		Aviezri S. Fraenkel, Yaacov Yesha: The generalized Sprague-Grundy function and its invariance under certain mappings. J. Comb. Theory, Ser. A 43(2): 165-177 (1986)
c10		Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal: Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems. SIGIR 1986: 88-96
	1984
j21		Moshe Mor, Aviezri S. Fraenkel: Cayley permutations. Discrete Mathematics 48(1): 101-112 (1984)
j20		M. Boshernitzan, Aviezri S. Fraenkel: A Linear Algorithm for Nonhomogeneous Spectra of Numbers. J. Algorithms 5(2): 187-198 (1984)
j19		Aviezri S. Fraenkel: Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. Theor. Comput. Sci. 29: 49-73 (1984)
	1983
j18		Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl: Is Text Compression by Prefixes and Suffixes Practical? Acta Inf. 20: 371-389 (1983)
j17		Aviezri S. Fraenkel, Moshe Mor: Combinatorial Compression and Partitioning of Large Dictionaries. Comput. J. 26(4): 336-343 (1983)
j16		Aviezri S. Fraenkel: Problem 38. Discrete Mathematics 44(3): 331-333 (1983)
j15		Aviezri S. Fraenkel: Problem 39 : Posed by Aviezri S. Fraenkel and Anton Kotzig. Discrete Mathematics 44(3): 333 (1983)
j14		Aviezri S. Fraenkel: Problem 40. Discrete Mathematics 44(3): 333-334 (1983)
j13		Aviezri S. Fraenkel: Problem 47 : Posed by Aviezri S. Fraenkel. Discrete Mathematics 46(2): 215-216 (1983)
c9		Aviezri S. Fraenkel: Systems of numeration. IEEE Symposium on Computer Arithmetic 1983: 37-42
c8		Aviezri S. Fraenkel: Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. ICALP 1983: 203-225
c7		Aviezri S. Fraenkel, Moshe Mor: Combinational Compression and Partitioning of Large Dictionaries: Theory and Experiments. SIGIR 1983: 205-219
	1982
j12		Moshe Mor, Aviezri S. Fraenkel: A Hash Code Method for Detecting and Correcting Spelling Errors. Commun. ACM 25(12): 935-938 (1982)
j11		Moshe Mor, Aviezri S. Fraenkel: Permutation Generation on Vector Processors. Comput. J. 25(4): 423-428 (1982)
c6		Moshe Mor, Aviezri S. Fraenkel: Retrieval in an Environment for Faulty Texts or Faulty Queries. JCDKB 1982: 405-425
c5		Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl: Is Text Compression by Prefizes and Suffixes Practical? SIGIR 1982: 289-311
	1981
j10		M. Boshernitzan, Aviezri S. Fraenkel: Nonhomogeneous spectra of numbers. Discrete Mathematics 34(3): 325-327 (1981)
j9		Aviezri S. Fraenkel, David Lichtenstein: Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n. J. Comb. Theory, Ser. A 31(2): 199-214 (1981)
c4		Aviezri S. Fraenkel, David Lichtenstein: Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N. ICALP 1981: 278-293
c3		Aviezri S. Fraenkel: Document Classification, Indexing and Abstracting May be Inherently Difficult Problems. SIGIR 1981: 77-82
	1980
j8		Aviezri S. Fraenkel, Yaacov Yesha: Complexity of Solving Algebraic Equations. Inf. Process. Lett. 10(4/5): 178-179 (1980)
	1979
j7		Aviezri S. Fraenkel: Paired Sequential Lists in a memory Interval. Inf. Process. Lett. 8(1): 9-10 (1979)
	1978
j6		R. Attar, Yaacov Choueka, Nachum Dershowitz, Aviezri S. Fraenkel: KEDMA - Linguistic Tools for Retrieval Systems. J. ACM 25(1): 52-66 (1978)
c2		Aviezri S. Fraenkel, M. R. Garey, David S. Johnson, T. Schaefer, Yaacov Yesha: The Complexity of Checkers on an N * N Board - Preliminary Report. FOCS 1978: 55-64
	1977
j5		R. Attar, Aviezri S. Fraenkel: Local Feedback in Full-Text Retrieval Systems. J. ACM 24(3): 397-417 (1977)
	1973
j4		Aviezri S. Fraenkel: Complementing and Exactly Covering Sequences. J. Comb. Theory, Ser. A 14(1): 8-20 (1973)
j3		Aviezri S. Fraenkel, I. Borosh: A Generalization of Wythoff's Game. J. Comb. Theory, Ser. A 15(2): 175-191 (1973)
	1971
c1		Yaacov Choueka, M. Cohen, J. Dueck, Aviezri S. Fraenkel, M. Slae: Full Text Document Retrieval: Hebrew Legal Texts. SIGIR 1971: 61-79
	1968
j2		Aviezri S. Fraenkel: Legal Information Retrieval. Advances in Computers 9: 113-178 (1968)
	1961
j1		Aviezri S. Fraenkel: The Use of Index Calculus and Mersenne Primes for the Design of a High-Speed Digital Multiplier. J. ACM 8(1): 87-96 (1961)

2012

j82

Aviezri S. Fraenkel: The vile, dopey, evil and odious game players. Discrete Mathematics 312(1): 42-46 (2012)

2011

j81

Aviezri S. Fraenkel: Aperiodic Subtraction Games. Electr. J. Comb. 18(2) (2011)

j80

Urban Larsson, Peter Hegarty, Aviezri S. Fraenkel: Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture. Theor. Comput. Sci. 412(8-10): 729-735 (2011)

2010

j79

Éric Duchêne, Aviezri S. Fraenkel, Richard J. Nowakowski, Michel Rigo: Extensions and restrictions of Wythoff's game preserving its p positions. J. Comb. Theory, Ser. A 117(5): 545-567 (2010)

j78

Aviezri S. Fraenkel: Complementary Iterated Floor Words and the Flora Game. SIAM J. Discrete Math. 24(2): 570-588 (2010)

j77

Aviezri S. Fraenkel: From Enmity to Amity. The American Mathematical Monthly 117(7): 646-648 (2010)

2009

j76

Jason Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo: A Decision Problem for Ultimately Periodic Sets in Nonstandard Numeration Systems. IJAC 19(6): 809-839 (2009)

Jason Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo: A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems. CoRR abs/0907.0620 (2009)

2008

j75

Aviezri S. Fraenkel: Games played by Boole and Galois. Discrete Applied Mathematics 156(4): 420-427 (2008)

j74

Shiri Artstein-Avidan, Aviezri S. Fraenkel, Vera T. Sós: A two-parameter family of an extension of Beatty sequences. Discrete Mathematics 308(20): 4578-4588 (2008)

j73

Aviezri S. Fraenkel: Problem 11365. The American Mathematical Monthly 115(5): 462 (2008)

j72

Aviezri S. Fraenkel: Sequences Built from the Golden Ratio: 11238. The American Mathematical Monthly 115(7): 667-668 (2008)

2006

j71

Aviezri S. Fraenkel: Nim is Easy, Chess is Hard - But Why?? ICGA Journal 29(4): 203-206 (2006)

j70

Aviezri S. Fraenkel: Problem 11238. The American Mathematical Monthly 113(7): 655 (2006)

2005

j69

Aviezri S. Fraenkel, Jamie Simpson: An extension of the periodicity lemma to longer periods. Discrete Applied Mathematics 146(2): 146-155 (2005)

j68

Aviezri S. Fraenkel: Euclid and Wythoff games. Discrete Mathematics 304(1-3): 65-68 (2005)

2004

j67

Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt: Traveling salesmen in the presence of competition. Theor. Comput. Sci. 303(3): 377-392 (2004)

j66

Aviezri S. Fraenkel: Complexity, appeal and challenges of combinatorial games. Theor. Comput. Sci. 303(3): 393-415 (2004)

j65

Erik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, Richard J. Nowakowski: Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory. Theor. Comput. Sci. 303(3): 539-543 (2004)

2003

c19

Aviezri S. Fraenkel: New Games Related to Old and New Sequences. ACG 2003: 367-382

2002

j64

Aviezri S. Fraenkel: Arrays, numeration systems and Frankenstein games. Theor. Comput. Sci. 282(2): 271-284 (2002)

c18

Aviezri S. Fraenkel, Ofer Rahat: Complexity of Error-Correcting Codes Derived from Combinatorial Games. Computers and Games 2002: 201-212

Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt: Traveling Salesmen in the Presence of Competition. CoRR cs.CC/0212001 (2002)

2001

j63

Aviezri S. Fraenkel, Tamar Seeman, Jamie Simpson: The Subword Complexity of a Two-Parameter Family of Sequences. Electr. J. Comb. 8(2) (2001)

j62

Aviezri S. Fraenkel, Dmitri Zusman: A new heap game. Theor. Comput. Sci. 252(1-2): 5-12 (2001)

j61

Aviezri S. Fraenkel, Ofer Rahat: Infinite cyclic impartial games. Theor. Comput. Sci. 252(1-2): 13-22 (2001)

c17

Aviezri S. Fraenkel, Jamie Simpson: An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture). CPM 2001: 98-105

2000

j60

Aviezri S. Fraenkel: On the recurrence f_m+1=b_mf_m-f_m-1 and applications. Discrete Mathematics 224(1-3): 273-279 (2000)

j59

Aviezri S. Fraenkel: Recent results and questions in combinatorial game complexities. Theor. Comput. Sci. 249(2): 265-288 (2000)

c16

Aviezri S. Fraenkel: Virus Versus Mankind. Computers and Games 2000: 204-213

1999

j58

Aviezri S. Fraenkel, Shmuel T. Klein: Information Retrieval from Annotated Texts. JASIS 50(10): 845-854 (1999)

j57

Aviezri S. Fraenkel, Jamie Simpson: The Exact Number of Squares in Fibonacci Words. Theor. Comput. Sci. 218(1): 95-106 (1999)

1998

j56

Aviezri S. Fraenkel, Jamie Simpson: How Many Squares Can a String Contain? J. Comb. Theory, Ser. A 82(1): 112-120 (1998)

j55

Uri Blass, Aviezri S. Fraenkel, Romina Guelman: How Far Can Nim in Disguise Be Stretched? J. Comb. Theory, Ser. A 84(2): 145-156 (1998)

j54

Aviezri S. Fraenkel, Michal Ozery: Adjoining to Wythoff's Game its P-Positions as Moves. Theor. Comput. Sci. 205(1-2): 283-296 (1998)

c15

Aviezri S. Fraenkel, Dmitri Zusman: A New Heap Game. Computers and Games 1998: 205-211

c14

Aviezri S. Fraenkel, Ofer Rahat: Infinite Cyclic Impartial Games. Computers and Games 1998: 212-221

1997

j53

Aviezri S. Fraenkel: Combinatorial game theory foundations applied to digraph kernels. Electr. J. Comb. 4(2) (1997)

c13

Aviezri S. Fraenkel, Jamie Simpson, Mike Paterson: On Weak Circular Squares in Binary Words. CPM 1997: 76-82

1996

j52

Aviezri S. Fraenkel, Shmuel T. Klein: Robust Universal Complete Codes for Transmission and Compression. Discrete Applied Mathematics 64(1): 31-55 (1996)

1995

j51

Aviezri S. Fraenkel, Jamie Simpson: How Many Squares Must a Binary Sequence Contain? Electr. J. Comb. 2 (1995)

j50

Aviezri S. Fraenkel, Martin Loebl: Complexity of circuit intersection in graphs. Discrete Mathematics 141(1-3): 135-151 (1995)

j49

James P. Jones, Aviezri S. Fraenkel: Complexities of Winning Strategies in Diophantine Games. J. Complexity 11(4): 435-455 (1995)

j48

Aviezri S. Fraenkel, Alan Jaffray, Anton Kotzig, Gert Sabidussi: Modular Nim. Theor. Comput. Sci. 143(2): 319-333 (1995)

1994

j47

Aviezri S. Fraenkel, Shmuel T. Klein: Complexity Aspects of Guessing Prefix Codes. Algorithmica 12(4/5): 409-419 (1994)

j46

Aviezri S. Fraenkel: Even Kernels. Electr. J. Comb. 1 (1994)

j45

Aviezri S. Fraenkel, Clark Kimberling: Generalized Wythoff arrays, shuffles and interspersions. Discrete Mathematics 126(1-3): 137-149 (1994)

j44

Aviezri S. Fraenkel, H. Porta, Kenneth B. Stolarsky: The almost PV behavior of some far from PV algebraic integers. Discrete Mathematics 135(1-3): 93-101 (1994)

j43

Aviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena: Efficient Management of Dynamic Tables. Inf. Process. Lett. 50(1): 25-30 (1994)

1993

j42

Aviezri S. Fraenkel, Shmuel T. Klein: Bounding the Depth of Search Trees. Comput. J. 36(7): 668-678 (1993)

j41

Roger B. Eggleton, Aviezri S. Fraenkel, R. Jaime Simpson: Beatty sequences and Langford sequences. Discrete Mathematics 111(1-3): 165-178 (1993)

j40

Aviezri S. Fraenkel, Shai Simonson: Geography. Theor. Comput. Sci. 110(1): 197-214 (1993)

j39

Aviezri S. Fraenkel, Edward R. Scheinerman, Daniel Ullman: Undirected Edge Geography. Theor. Comput. Sci. 112(2): 371-381 (1993)

1991

j38

Aviezri S. Fraenkel, Edward R. Scheinerman: A deletion game on hypergraphs. Discrete Applied Mathematics 30(2-3): 155-162 (1991)

j37

Aviezri S. Fraenkel, Mordechai Lorberbom: Nimhoff games. J. Comb. Theory, Ser. A 58(1): 1-25 (1991)

1990

j36

Aviezri S. Fraenkel, Shmuel T. Klein: Bidirectional Huffman Coding. Comput. J. 33(4): 296-307 (1990)

j35

Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel: Irreducible disjoint covering systems (with an application to boolean algebra). Discrete Applied Mathematics 29(2-3): 143-164 (1990)

j34

Uri Blass, Aviezri S. Fraenkel: The Sprague-Grundy Function for Wythoff's Game. Theor. Comput. Sci. 75(3): 311-333 (1990)

1989

j33

Aviezri S. Fraenkel, Mordechai Lorberbom: Epidemiography with various growth functions. Discrete Applied Mathematics 25(1-2): 53-71 (1989)

j32

N. Duvdevani, Aviezri S. Fraenkel: Properties of K-Welter's game. Discrete Mathematics 76(3): 197-221 (1989)

j31

Aviezri S. Fraenkel: The Use and Usefulness of Numeration Systems. Inf. Comput. 81(1): 46-61 (1989)

1988

j30

Z. Agur, Aviezri S. Fraenkel, Shmuel T. Klein: The number of fixed points of the majority rule. Discrete Mathematics 70(3): 295-302 (1988)

j29

Aviezri S. Fraenkel, Martin Loebl, Jaroslav Nesetril: Epidemiography II. Games with a dozing yet winning player. J. Comb. Theory, Ser. A 49(1): 129-144 (1988)

c12

Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein: Compression of Concordances in Full-Text Retrieval Systems. SIGIR 1988: 597-612

1987

j28

Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel: Lattice parallelotopes and disjoint covering systems. Discrete Mathematics 65(1): 23-46 (1987)

j27

Joseph Kahane, Aviezri S. Fraenkel: k-welter - a generalization of Welter's game. J. Comb. Theory, Ser. A 46(1): 1-20 (1987)

j26

Aviezri S. Fraenkel, Elisheva Goldschmidt: PSPACE-hardness of some combinatorial games. J. Comb. Theory, Ser. A 46(1): 21-38 (1987)

j25

Alberto Apostolico, Aviezri S. Fraenkel: Robust transmission of unbounded strings using Fibonacci representations. IEEE Transactions on Information Theory 33(2): 238-245 (1987)

c11

Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal: Improved Techniques for Processing Queries in Full-Text Systems. SIGIR 1987: 306-315

1986

j24

Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel: A non-analytic proof of the Newman - Znám result for disjoint covering systems. Combinatorica 6(3): 235-343 (1986)

j23

Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel: Disjoint covering systems of rational beatty sequences. J. Comb. Theory, Ser. A 42(1): 150-153 (1986)

j22

Aviezri S. Fraenkel, Yaacov Yesha: The generalized Sprague-Grundy function and its invariance under certain mappings. J. Comb. Theory, Ser. A 43(2): 165-177 (1986)

c10

Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal: Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems. SIGIR 1986: 88-96

1984

j21

Moshe Mor, Aviezri S. Fraenkel: Cayley permutations. Discrete Mathematics 48(1): 101-112 (1984)

j20

M. Boshernitzan, Aviezri S. Fraenkel: A Linear Algorithm for Nonhomogeneous Spectra of Numbers. J. Algorithms 5(2): 187-198 (1984)

j19

Aviezri S. Fraenkel: Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. Theor. Comput. Sci. 29: 49-73 (1984)

1983

j18

Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl: Is Text Compression by Prefixes and Suffixes Practical? Acta Inf. 20: 371-389 (1983)

j17

Aviezri S. Fraenkel, Moshe Mor: Combinatorial Compression and Partitioning of Large Dictionaries. Comput. J. 26(4): 336-343 (1983)

j16

Aviezri S. Fraenkel: Problem 38. Discrete Mathematics 44(3): 331-333 (1983)

j15

Aviezri S. Fraenkel: Problem 39 : Posed by Aviezri S. Fraenkel and Anton Kotzig. Discrete Mathematics 44(3): 333 (1983)

j14

Aviezri S. Fraenkel: Problem 40. Discrete Mathematics 44(3): 333-334 (1983)

j13

Aviezri S. Fraenkel: Problem 47 : Posed by Aviezri S. Fraenkel. Discrete Mathematics 46(2): 215-216 (1983)

Aviezri S. Fraenkel: Systems of numeration. IEEE Symposium on Computer Arithmetic 1983: 37-42

Aviezri S. Fraenkel: Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. ICALP 1983: 203-225

Aviezri S. Fraenkel, Moshe Mor: Combinational Compression and Partitioning of Large Dictionaries: Theory and Experiments. SIGIR 1983: 205-219

1982

j12

Moshe Mor, Aviezri S. Fraenkel: A Hash Code Method for Detecting and Correcting Spelling Errors. Commun. ACM 25(12): 935-938 (1982)

j11

Moshe Mor, Aviezri S. Fraenkel: Permutation Generation on Vector Processors. Comput. J. 25(4): 423-428 (1982)

Moshe Mor, Aviezri S. Fraenkel: Retrieval in an Environment for Faulty Texts or Faulty Queries. JCDKB 1982: 405-425

Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl: Is Text Compression by Prefizes and Suffixes Practical? SIGIR 1982: 289-311

1981

j10

M. Boshernitzan, Aviezri S. Fraenkel: Nonhomogeneous spectra of numbers. Discrete Mathematics 34(3): 325-327 (1981)

Aviezri S. Fraenkel, David Lichtenstein: Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n. J. Comb. Theory, Ser. A 31(2): 199-214 (1981)

Aviezri S. Fraenkel, David Lichtenstein: Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N. ICALP 1981: 278-293

Aviezri S. Fraenkel: Document Classification, Indexing and Abstracting May be Inherently Difficult Problems. SIGIR 1981: 77-82

1980

Aviezri S. Fraenkel, Yaacov Yesha: Complexity of Solving Algebraic Equations. Inf. Process. Lett. 10(4/5): 178-179 (1980)

1979

Aviezri S. Fraenkel: Paired Sequential Lists in a memory Interval. Inf. Process. Lett. 8(1): 9-10 (1979)

1978

R. Attar, Yaacov Choueka, Nachum Dershowitz, Aviezri S. Fraenkel: KEDMA - Linguistic Tools for Retrieval Systems. J. ACM 25(1): 52-66 (1978)

Aviezri S. Fraenkel, M. R. Garey, David S. Johnson, T. Schaefer, Yaacov Yesha: The Complexity of Checkers on an N * N Board - Preliminary Report. FOCS 1978: 55-64

1977

R. Attar, Aviezri S. Fraenkel: Local Feedback in Full-Text Retrieval Systems. J. ACM 24(3): 397-417 (1977)

1973

Aviezri S. Fraenkel: Complementing and Exactly Covering Sequences. J. Comb. Theory, Ser. A 14(1): 8-20 (1973)

Aviezri S. Fraenkel, I. Borosh: A Generalization of Wythoff's Game. J. Comb. Theory, Ser. A 15(2): 175-191 (1973)

1971

Yaacov Choueka, M. Cohen, J. Dueck, Aviezri S. Fraenkel, M. Slae: Full Text Document Retrieval: Hebrew Legal Texts. SIGIR 1971: 61-79

1968

Aviezri S. Fraenkel: Legal Information Retrieval. Advances in Computers 9: 113-178 (1968)

1961

Aviezri S. Fraenkel: The Use of Index Calculus and Mersenne Primes for the Design of a High-Speed Digital Multiplier. J. ACM 8(1): 87-96 (1961)

1	Z. Agur	[j30]
2	Alberto Apostolico	[j25]
3	Shiri Artstein-Avidan	[j74]
4	R. Attar	[j6] [j5]
5	Jason Bell	[j76] [i2]
6	Marc A. Berger	[j35] [j28] [j24] [j23]
7	Uri Blass	[j55] [j34]
8	I. Borosh	[j3]
9	M. Boshernitzan	[j20] [j10]
10	Emilie Charlier	[j76] [i2]
11	Yaacov Choueka	[c12] [c11] [c10] [j6] [c1]
12	M. Cohen	[c1]
13	Erik D. Demaine	[j65]
14	Nachum Dershowitz	[j6]
15	Éric Duchêne	[j79]
16	J. Dueck	[c1]
17	N. Duvdevani	[j32]
18	Roger B. Eggleton	[j41]
19	Sándor P. Fekete	[j67] [i1]
20	Alexander Felzenbaum	[j35] [j28] [j24] [j23]
21	Rudolf Fleischer	[j67] [j65] [i1]
22	M. R. Garey (Michael R. Garey)	[c2]
23	Elisheva Goldschmidt	[j26]
24	Romina Guelman	[j55]
25	Peter Hegarty	[j80]
26	Alan Jaffray	[j48]
27	David S. Johnson	[c2]
28	James P. Jones	[j49]
29	Joseph Kahane	[j27]
30	Clark Kimberling	[j45]
31	Shmuel Tomi Klein (Shmuel T. Klein)	[j58] [j52] [j47] [j42] [j36] [j30] [c12] [c11] [c10]
32	Anton Kotzig	[j48]
33	Urban Larsson	[j80]
34	David Lichtenstein	[j9] [c4]
35	Martin Loebl	[j50] [j29]
36	Mordechai Lorberbom	[j37] [j33]
37	Moshe Mor	[j21] [j18] [j17] [c7] [j12] [j11] [c6] [c5]
38	Jaroslav Nesetril (Jarik Nesetril)	[j29]
39	Richard J. Nowakowski	[j79] [j65]
40	Michal Ozery	[j54]
41	Mike Paterson	[c13]
42	Yehoshua Perl	[j18] [c5]
43	H. Porta	[j44]
44	Ofer Rahat	[c18] [j61] [c14]
45	Edward M. Reingold	[j43]
46	Michel Rigo	[j79] [j76] [i2]
47	Gert Sabidussi	[j48]
48	Prashant Saxena	[j43]
49	T. Schaefer	[c2]
50	Edward R. Scheinerman	[j39] [j38]
51	Matthias Schmitt	[j67] [i1]
52	Tamar Seeman	[j63]
53	E. Segal	[c11] [c10]
54	Shai Simonson	[j40]
55	Jamie Simpson	[j69] [j63] [c17] [j57] [j56] [c13] [j51]
56	R. Jaime Simpson	[j41]
57	M. Slae	[c1]
58	Kenneth B. Stolarsky	[j44]
59	Vera T. Sós	[j74]
60	Daniel Ullman	[j39]
61	Yaacov Yesha	[j22] [j8] [c2]
62	Dmitri Zusman	[j62] [c15]

Aviezri S. Fraenkel

Coauthor Index