Travelled to:
1 × France
1 × Israel
1 × Italy
1 × Spain
3 × USA
Collaborated with:
Y.Choueka ∅ S.T.Klein M.Mor E.Segal D.Lichtenstein Y.Perl M.Cohen J.Dueck M.Slae
Talks about:
text (5) compress (4) document (3) retriev (3) system (3) full (3) improv (2) dictionari (1) fibonacci (1) exponenti (1)
Person: Aviezri S. Fraenkel
DBLP: Fraenkel:Aviezri_S=
Contributed to:
Wrote 9 papers:
- SIGIR-1988-ChouekaFK #retrieval
- Compression of Concordances in Full-Text Retrieval Systems (YC, ASF, STK), pp. 597–612.
- SIGIR-1987-ChouekaFKS #query
- Improved Techniques for Processing Queries in Full-Text Systems (YC, ASF, STK, ES), pp. 306–315.
- SIGIR-1986-ChouekaFKS #documentation #retrieval
- Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems (YC, ASF, STK, ES), pp. 88–96.
- ICALP-1983-Fraenkel #fibonacci #game studies
- Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches (ASF), pp. 203–225.
- SIGIR-1983-FraenkelM #clustering #scalability
- Combinational Compression and Partitioning of Large Dictionaries: Theory and Experiments (ASF, MM), pp. 205–219.
- SIGIR-1982-FraenkelMP #question
- Is Text Compression by Prefizes and Suffixes Practical? (ASF, MM, YP), pp. 289–311.
- ICALP-1981-FraenkelL #exponential
- Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N (ASF, DL), pp. 278–293.
- SIGIR-1981-Fraenkel #classification #documentation #problem
- Document Classification, Indexing and Abstracting May be Inherently Difficult Problems (ASF), pp. 77–82.
- SIGIR-1971-ChouekaCDFS #documentation #retrieval
- Full Text Document Retrieval: Hebrew Legal Texts (YC, MC, JD, ASF, MS), pp. 61–79.