| 2001 | CPM | An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture). | Aviezri S. Fraenkel, Jamie Simpson |
| 1997 | CPM | On Weak Circular Squares in Binary Words. | Aviezri S. Fraenkel, Jamie Simpson, Mike Paterson |
| 1988 | SIGIR | Compression of Concordances in Full-Text Retrieval Systems. | Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein |
| 1987 | SIGIR | Improved Techniques for Processing Queries in Full-Text Systems. | Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal |
| 1986 | SIGIR | Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems. | Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal |
| 1983 | ARITH | Systems of numeration. | Aviezri S. Fraenkel |
| 1983 | ICALP | Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. | Aviezri S. Fraenkel |
| 1983 | SIGIR | Combinational Compression and Partitioning of Large Dictionaries: Theory and Experiments. | Aviezri S. Fraenkel, Moshe Mor |
| 1982 | SIGIR | Is Text Compression by Prefizes and Suffixes Practical? | Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl |
| 1981 | ICALP | Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N. | Aviezri S. Fraenkel, David Lichtenstein |
| 1981 | SIGIR | Document Classification, Indexing and Abstracting May be Inherently Difficult Problems. | Aviezri S. Fraenkel |
| 1978 | FOCS | The Complexity of Checkers on an N * N Board - Preliminary Report | Aviezri S. Fraenkel, M. R. Garey, David S. Johnson, T. Schaefer, Yaacov Yesha |
| 1971 | SIGIR | Full Text Document Retrieval: Hebrew Legal Texts. | Yaacov Choueka, M. Cohen, J. Dueck, Aviezri S. Fraenkel, M. Slae |