Aviezri S. Fraenkel

	2012
99		Aviezri S. Fraenkel: The vile, dopey, evil and odious game players. Discrete Mathematics 312(1): 42-46 (2012)
	2011
98		Aviezri S. Fraenkel: Aperiodic Subtraction Games. Electr. J. Comb. 18(2): (2011)
97		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
96		É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)
95		Aviezri S. Fraenkel: Complementary Iterated Floor Words and the Flora Game. SIAM J. Discrete Math. 24(2): 570-588 (2010)
	2009
94		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)
93		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)
	2008
92		Aviezri S. Fraenkel: Games played by Boole and Galois. Discrete Applied Mathematics 156(4): 420-427 (2008)
91		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)
	2006
90		Aviezri S. Fraenkel: Nim is Easy, Chess is Hard - But Why?? ICGA Journal 29(4): 203-206 (2006)
	2005
89		Aviezri S. Fraenkel, Jamie Simpson: An extension of the periodicity lemma to longer periods. Discrete Applied Mathematics 146(2): 146-155 (2005)
88		Aviezri S. Fraenkel: Euclid and Wythoff games. Discrete Mathematics 304(1-3): 65-68 (2005)
	2004
87		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)
86		Aviezri S. Fraenkel: Complexity, appeal and challenges of combinatorial games. Theor. Comput. Sci. 303(3): 393-415 (2004)
85		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
84		Aviezri S. Fraenkel: New Games Related to Old and New Sequences. ACG 2003: 367-382
	2002
83		Aviezri S. Fraenkel, Ofer Rahat: Complexity of Error-Correcting Codes Derived from Combinatorial Games. Computers and Games 2002: 201-212
82		Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt: Traveling Salesmen in the Presence of Competition CoRR cs.CC/0212001: (2002)
81		Aviezri S. Fraenkel: Arrays, numeration systems and Frankenstein games. Theor. Comput. Sci. 282(2): 271-284 (2002)
	2001
80		Aviezri S. Fraenkel, Jamie Simpson: An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture). CPM 2001: 98-105
79		Aviezri S. Fraenkel, Tamar Seeman, Jamie Simpson: The Subword Complexity of a Two-Parameter Family of Sequences. Electr. J. Comb. 8(2): (2001)
78		Aviezri S. Fraenkel, Ofer Rahat: Infinite cyclic impartial games. Theor. Comput. Sci. 252(1-2): 13-22 (2001)
77		Aviezri S. Fraenkel, Dmitri Zusman: A new heap game. Theor. Comput. Sci. 252(1-2): 5-12 (2001)
	2000
76		Aviezri S. Fraenkel: Virus Versus Mankind. Computers and Games 2000: 204-213
75		Aviezri S. Fraenkel: On the recurrence fm+1=bmfm-fm-1 and applications. Discrete Mathematics 224(1-3): 273-279 (2000)
74		Aviezri S. Fraenkel: Recent results and questions in combinatorial game complexities. Theor. Comput. Sci. 249(2): 265-288 (2000)
	1999
73		Aviezri S. Fraenkel, Shmuel T. Klein: Information Retrieval from Annotated Texts. JASIS 50(10): 845-854 (1999)
72		Aviezri S. Fraenkel, Jamie Simpson: The Exact Number of Squares in Fibonacci Words. Theor. Comput. Sci. 218(1): 95-106 (1999)
	1998
71		Aviezri S. Fraenkel, Dmitri Zusman: A New Heap Game. Computers and Games 1998: 205-211
70		Aviezri S. Fraenkel, Ofer Rahat: Infinite Cyclic Impartial Games. Computers and Games 1998: 212-221
69		Aviezri S. Fraenkel, Jamie Simpson: How Many Squares Can a String Contain? J. Comb. Theory, Ser. A 82(1): 112-120 (1998)
68		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)
67		Aviezri S. Fraenkel, Michal Ozery: Adjoining to Wythoff's Game its P-Positions as Moves. Theor. Comput. Sci. 205(1-2): 283-296 (1998)
	1997
66		Aviezri S. Fraenkel, Jamie Simpson, Mike Paterson: On Weak Circular Squares in Binary Words. CPM 1997: 76-82
65		Aviezri S. Fraenkel: Combinatorial game theory foundations applied to digraph kernels. Electr. J. Comb. 4(2): (1997)
	1996
64		Aviezri S. Fraenkel, Shmuel T. Klein: Robust Universal Complete Codes for Transmission and Compression. Discrete Applied Mathematics 64(1): 31-55 (1996)
	1995
63		Aviezri S. Fraenkel, Martin Loebl: Complexity of circuit intersection in graphs. Discrete Mathematics 141(1-3): 135-151 (1995)
62		Aviezri S. Fraenkel, Jamie Simpson: How Many Squares Must a Binary Sequence Contain? Electr. J. Comb. 2: (1995)
61		James P. Jones, Aviezri S. Fraenkel: Complexities of Winning Strategies in Diophantine Games. J. Complexity 11(4): 435-455 (1995)
60		Aviezri S. Fraenkel, Alan Jaffray, Anton Kotzig, Gert Sabidussi: Modular Nim. Theor. Comput. Sci. 143(2): 319-333 (1995)
	1994
59		Aviezri S. Fraenkel, Shmuel T. Klein: Complexity Aspects of Guessing Prefix Codes. Algorithmica 12(4/5): 409-419 (1994)
58		Aviezri S. Fraenkel, Clark Kimberling: Generalized Wythoff arrays, shuffles and interspersions. Discrete Mathematics 126(1-3): 137-149 (1994)
57		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)
56		Aviezri S. Fraenkel: Even Kernels. Electr. J. Comb. 1: (1994)
55		Aviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena: Efficient Management of Dynamic Tables. Inf. Process. Lett. 50(1): 25-30 (1994)
	1993
54		Aviezri S. Fraenkel, Shmuel T. Klein: Bounding the Depth of Search Trees. Comput. J. 36(7): 668-678 (1993)
53		Roger B. Eggleton, Aviezri S. Fraenkel, R. Jaime Simpson: Beatty sequences and Langford sequences. Discrete Mathematics 111(1-3): 165-178 (1993)
52		Aviezri S. Fraenkel, Shai Simonson: Geography. Theor. Comput. Sci. 110(1): 197-214 (1993)
51		Aviezri S. Fraenkel, Edward R. Scheinerman, Daniel Ullman: Undirected Edge Geography. Theor. Comput. Sci. 112(2): 371-381 (1993)
	1991
50		Aviezri S. Fraenkel, Edward R. Scheinerman: A deletion game on hypergraphs. Discrete Applied Mathematics 30(2-3): 155-162 (1991)
49		Aviezri S. Fraenkel, Mordechai Lorberbom: Nimhoff games. J. Comb. Theory, Ser. A 58(1): 1-25 (1991)
	1990
48		Aviezri S. Fraenkel, Shmuel T. Klein: Bidirectional Huffman Coding. Comput. J. 33(4): 296-307 (1990)
47		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)
46		Uri Blass, Aviezri S. Fraenkel: The Sprague-Grundy Function for Wythoff's Game. Theor. Comput. Sci. 75(3): 311-333 (1990)
	1989
45		Aviezri S. Fraenkel, Mordechai Lorberbom: Epidemiography with various growth functions. Discrete Applied Mathematics 25(1-2): 53-71 (1989)
44		N. Duvdevani, Aviezri S. Fraenkel: Properties of K-Welter's game. Discrete Mathematics 76(3): 197-221 (1989)
43		Aviezri S. Fraenkel: The Use and Usefulness of Numeration Systems Inf. Comput. 81(1): 46-61 (1989)
	1988
42		Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein: Compression of Concordances in Full-Text Retrieval Systems. SIGIR 1988: 597-612
41		Z. Agur, Aviezri S. Fraenkel, Shmuel T. Klein: The number of fixed points of the majority rule. Discrete Mathematics 70(3): 295-302 (1988)
40		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)
	1987
39		Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal: Improved Techniques for Processing Queries in Full-Text Systems. SIGIR 1987: 306-315
38		Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel: Lattice parallelotopes and disjoint covering systems. Discrete Mathematics 65(1): 23-46 (1987)
37		Alberto Apostolico, Aviezri S. Fraenkel: Robust transmission of unbounded strings using Fibonacci representations. IEEE Transactions on Information Theory 33(2): 238-245 (1987)
36		Joseph Kahane, Aviezri S. Fraenkel: k-welter - a generalization of Welter's game. J. Comb. Theory, Ser. A 46(1): 1-20 (1987)
35		Aviezri S. Fraenkel, Elisheva Goldschmidt: PSPACE-hardness of some combinatorial games. J. Comb. Theory, Ser. A 46(1): 21-38 (1987)
	1986
34		Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal: Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems. SIGIR 1986: 88-96
33		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)
32		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)
31		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)
	1984
30		Moshe Mor, Aviezri S. Fraenkel: Cayley permutations. Discrete Mathematics 48(1): 101-112 (1984)
29		M. Boshernitzan, Aviezri S. Fraenkel: A Linear Algorithm for Nonhomogeneous Spectra of Numbers. J. Algorithms 5(2): 187-198 (1984)
28		Aviezri S. Fraenkel: Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. Theor. Comput. Sci. 29: 49-73 (1984)
	1983
27		Aviezri S. Fraenkel: Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. ICALP 1983: 203-225
26		Aviezri S. Fraenkel: Systems of numeration. IEEE Symposium on Computer Arithmetic 1983: 37-42
25		Aviezri S. Fraenkel, Moshe Mor: Combinational Compression and Partitioning of Large Dictionaries: Theory and Experiments. SIGIR 1983: 205-219
24		Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl: Is Text Compression by Prefixes and Suffixes Practical? Acta Inf. 20: 371-389 (1983)
23		Aviezri S. Fraenkel, Moshe Mor: Combinatorial Compression and Partitioning of Large Dictionaries. Comput. J. 26(4): 336-343 (1983)
22		Aviezri S. Fraenkel: Problem 38. Discrete Mathematics 44(3): 331-333 (1983)
21		Aviezri S. Fraenkel: Problem 39 : Posed by Aviezri S. Fraenkel and Anton Kotzig. Discrete Mathematics 44(3): 333 (1983)
20		Aviezri S. Fraenkel: Problem 40. Discrete Mathematics 44(3): 333-334 (1983)
19		Aviezri S. Fraenkel: Problem 47 : Posed by Aviezri S. Fraenkel. Discrete Mathematics 46(2): 215-216 (1983)
	1982
18		Moshe Mor, Aviezri S. Fraenkel: Retrieval in an Environment for Faulty Texts or Faulty Queries. JCDKB 1982: 405-425
17		Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl: Is Text Compression by Prefizes and Suffixes Practical? SIGIR 1982: 289-311
16		Moshe Mor, Aviezri S. Fraenkel: A Hash Code Method for Detecting and Correcting Spelling Errors. Commun. ACM 25(12): 935-938 (1982)
15		Moshe Mor, Aviezri S. Fraenkel: Permutation Generation on Vector Processors. Comput. J. 25(4): 423-428 (1982)
	1981
14		Aviezri S. Fraenkel, David Lichtenstein: Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N. ICALP 1981: 278-293
13		Aviezri S. Fraenkel: Document Classification, Indexing and Abstracting May be Inherently Difficult Problems. SIGIR 1981: 77-82
12		M. Boshernitzan, Aviezri S. Fraenkel: Nonhomogeneous spectra of numbers. Discrete Mathematics 34(3): 325-327 (1981)
11		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)
	1980
10		Aviezri S. Fraenkel, Yaacov Yesha: Complexity of Solving Algebraic Equations. Inf. Process. Lett. 10(4/5): 178-179 (1980)
	1979
9		Aviezri S. Fraenkel: Paired Sequential Lists in a memory Interval. Inf. Process. Lett. 8(1): 9-10 (1979)
	1978
8		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
7		R. Attar, Yaacov Choueka, Nachum Dershowitz, Aviezri S. Fraenkel: KEDMA - Linguistic Tools for Retrieval Systems. J. ACM 25(1): 52-66 (1978)
	1977
6		R. Attar, Aviezri S. Fraenkel: Local Feedback in Full-Text Retrieval Systems. J. ACM 24(3): 397-417 (1977)
	1973
5		Aviezri S. Fraenkel: Complementing and Exactly Covering Sequences. J. Comb. Theory, Ser. A 14(1): 8-20 (1973)
4		Aviezri S. Fraenkel, I. Borosh: A Generalization of Wythoff's Game. J. Comb. Theory, Ser. A 15(2): 175-191 (1973)
	1971
3		Yaacov Choueka, M. Cohen, J. Dueck, Aviezri S. Fraenkel, M. Slae: Full Text Document Retrieval: Hebrew Legal Texts. SIGIR 1971: 61-79
	1968
2		Aviezri S. Fraenkel: Legal Information Retrieval. Advances in Computers 9: 113-178 (1968)
	1961
1		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)

Coauthor Index

1	Z. Agur	[41]
2	Alberto Apostolico	[37]
3	Shiri Artstein-Avidan	[91]
4	R. Attar	[6] [7]
5	Jason Bell	[93] [94]
6	Marc A. Berger	[32] [33] [38] [47]
7	Uri Blass	[46] [68]
8	I. Borosh	[4]
9	M. Boshernitzan	[12] [29]
10	Emilie Charlier	[93] [94]
11	Yaacov Choueka	[3] [7] [34] [39] [42]
12	M. Cohen	[3]
13	Erik D. Demaine	[85]
14	Nachum Dershowitz	[7]
15	Éric Duchêne	[96]
16	J. Dueck	[3]
17	N. Duvdevani	[44]
18	Roger B. Eggleton	[53]
19	Sándor P. Fekete	[82] [87]
20	Alexander Felzenbaum	[32] [33] [38] [47]
21	Rudolf Fleischer	[82] [85] [87]
22	M. R. Garey (Michael R. Garey)	[8]
23	Elisheva Goldschmidt	[35]
24	Romina Guelman	[68]
25	Peter Hegarty	[97]
26	Alan Jaffray	[60]
27	David S. Johnson	[8]
28	James P. Jones	[61]
29	Joseph Kahane	[36]
30	Clark Kimberling	[58]
31	Shmuel Tomi Klein (Shmuel T. Klein)	[34] [39] [41] [42] [48] [54] [59] [64] [73]
32	Anton Kotzig	[60]
33	Urban Larsson	[97]
34	David Lichtenstein	[11] [14]
35	Martin Loebl	[40] [63]
36	Mordechai Lorberbom	[45] [49]
37	Moshe Mor	[15] [16] [17] [18] [23] [24] [25] [30]
38	Jaroslav Nesetril (Jarik Nesetril)	[40]
39	Richard J. Nowakowski	[85] [96]
40	Michal Ozery	[67]
41	Mike Paterson	[66]
42	Yehoshua Perl	[17] [24]
43	H. Porta	[57]
44	Ofer Rahat	[70] [78] [83]
45	Edward M. Reingold	[55]
46	Michel Rigo	[93] [94] [96]
47	Gert Sabidussi	[60]
48	Prashant Saxena	[55]
49	T. Schaefer	[8]
50	Edward R. Scheinerman	[50] [51]
51	Matthias Schmitt	[82] [87]
52	Tamar Seeman	[79]
53	E. Segal	[34] [39]
54	Shai Simonson	[52]
55	Jamie Simpson	[62] [66] [69] [72] [79] [80] [89]
56	R. Jaime Simpson	[53]
57	M. Slae	[3]
58	Vera T. Sós	[91]
59	Kenneth B. Stolarsky	[57]
60	Daniel Ullman	[51]
61	Yaacov Yesha	[8] [10] [31]
62	Dmitri Zusman	[71] [77]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page