The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Aviezri S. Fraenkel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  86. A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems [Citation Graph (, )][DBLP]


  87. Games played by Boole and Galois. [Citation Graph (, )][DBLP]


  88. A deletion game on hypergraphs. [Citation Graph (, )][DBLP]


  89. Epidemiography with various growth functions. [Citation Graph (, )][DBLP]


  90. Irreducible disjoint covering systems (with an application to boolean algebra). [Citation Graph (, )][DBLP]


  91. A two-parameter family of an extension of Beatty sequences. [Citation Graph (, )][DBLP]


Search in 0.053secs, Finished in 0.057secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002