default search action
Timo Raita
Person information
- affiliation: University of Turku, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
- [j18]Abraham Bookstein, Vladimir A. Kulyukin, Timo Raita, John Nicholson:
Adapting measures of clumping strength to assess term-term similarity. J. Assoc. Inf. Sci. Technol. 54(7): 611-620 (2003) - 2002
- [j17]Abraham Bookstein, Vladimir A. Kulyukin, Timo Raita:
Generalized Hamming Distance. Inf. Retr. 5(4): 353-375 (2002) - 2001
- [j16]Abraham Bookstein, Timo Raita:
Discovering term occurrence structure in text. J. Assoc. Inf. Sci. Technol. 52(6): 476-486 (2001) - [c12]Abraham Bookstein, Shmuel T. Klein
, Timo Raita:
Fuzzy Hamming Distance: A New Dissimilarity Measure. CPM 2001: 86-97 - 2000
- [j15]Abraham Bookstein, Shmuel T. Klein
Simple Bayesian Model for Bitmap Compression. Inf. Retr. 1(4): 315-328 (2000) - [c11]Lasse Bergroth, Harri Hakonen, Timo Raita:
A Survey of Longest Common Subsequence Algorithms. SPIRE 2000: 39-48
1990 – 1999
- 1999
- [j14]Harri Hakonen, Timo Raita:
A Family of Fast Constant-Space Substring Search Algorithms. Acta Cybern. 14(2): 239-250 (1999) - [j13]Timo Raita:
On Guards and Symbol Dependencies in Substring Search. Softw. Pract. Exp. 29(11): 931-941 (1999) - 1998
- [j12]Abraham Bookstein, Shmuel T. Klein, Timo Raita:
Clumping Properties of Content-Bearing Words. J. Am. Soc. Inf. Sci. 49(2): 102-114 (1998) - [c10]Lasse Bergroth, Harri Hakonen, Timo Raita:
New Approximation Algorithms for Longest Common Subsequences. SPIRE 1998: 32-40 - 1997
- [j11]Abraham Bookstein, Shmuel T. Klein
An overhead reduction technique for mega-state compression schemes. Inf. Process. Manag. 33(6): 745-760 (1997) - [j10]Abraham Bookstein, Shmuel T. Klein
Modeling Word Occurrences for the Compression of Concordances. ACM Trans. Inf. Syst. 15(3): 254-290 (1997) - [c9]Abraham Bookstein, Shmuel T. Klein
An Overhead Reduction Technique For Mega-State Compression Schemes. Data Compression Conference 1997: 367-376 - 1995
- [c8]Abraham Bookstein, Shmuel T. Klein
Detecting Content-Bearing Words by Serial Clustering. SIGIR 1995: 319-327 - 1994
- [j9]Jukka Teuhola, Timo Raita:
Arithmetic coding into fixed-length codewords. IEEE Trans. Inf. Theory 40(1): 219-223 (1994) - [c7]Abraham Bookstein, Shmuel T. Klein
Markov Models for Clusters in Concordance Compression. Data Compression Conference 1994: 116-125 - 1993
- [j8]Jukka Teuhola, Timo Raita:
Application of a Finite-State Model to Text Compression. Comput. J. 36(7): 607-614 (1993) - [c6]Abraham Bookstein, Shmuel T. Klein
Can Random Fluctuation Be Exploited in Data Compression. Data Compression Conference 1993: 70-78 - [c5]Abraham Bookstein, Shmuel T. Klein
Is Huffman Coding Dead? SIGIR 1993: 80-87 - 1992
- [j7]Olli Nevalainen, Timo Raita:
An Internal Hybrid Sort Algorithm Revisited. Comput. J. 35(2): 177-183 (1992) - [j6]Jyrki Katajainen, Timo Raita:
An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding. J. ACM 39(2): 281-294 (1992) - [j5]Timo Raita:
Tuning the Boyer-Moore-Horspool String Searching Algorithm. Softw. Pract. Exp. 22(10): 879-884 (1992) - [c4]Abraham Bookstein, Shmuel T. Klein
Model Based Concordance Compression. Data Compression Conference 1992: 82-91 - 1991
- [j4]Martti Juhola, Jyrki Katajainen, Timo Raita:
Comparison of algorithms for standard median filtering. IEEE Trans. Signal Process. 39(1): 204-208 (1991) - [c3]Jukka Teuhola, Timo Raita:
Piecewise Arithmetic Coding. Data Compression Conference 1991: 33-42
1980 – 1989
- 1989
- [j3]Jyrki Katajainen, Timo Raita:
An Approximation Algorithm for Space-Optimal Encoding of a Text. Comput. J. 32(3): 228-237 (1989) - [j2]Timo Raita, Jukka Teuhola:
Predictive encoding in text compression. Inf. Process. Manag. 25(2): 151-160 (1989) - 1987
- [j1]Timo Raita:
An Automatic System for File Compression. Comput. J. 30(1): 80-86 (1987) - [c2]Timo Raita, Jukka Teuhola:
Predictive Text Compression by Hashing. SIGIR 1987: 223-233 - 1986
- [c1]Jukka Teuhola, Timo Raita:
Text Compression Using Prediction. SIGIR 1986: 97-102
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: