T. Raita

1.2k total citations
29 papers, 733 citations indexed

About

T. Raita is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, T. Raita has authored 29 papers receiving a total of 733 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Artificial Intelligence, 9 papers in Computational Theory and Mathematics and 5 papers in Computer Networks and Communications. Recurrent topics in T. Raita's work include Algorithms and Data Compression (22 papers), Natural Language Processing Techniques (7 papers) and Cellular Automata and Applications (6 papers). T. Raita is often cited by papers focused on Algorithms and Data Compression (22 papers), Natural Language Processing Techniques (7 papers) and Cellular Automata and Applications (6 papers). T. Raita collaborates with scholars based in Finland, United States and Israel. T. Raita's co-authors include Harri Hakonen, Lasse Bergroth, Abraham Bookstein, Vladimir Kulyukin, Shmuel T. Klein, Jyrki Katajainen, Martti Juhola, Jukka Teuhola, John Nicholson and I. K. Ravichandra Rao and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Transactions on Signal Processing and Journal of the ACM.

In The Last Decade

T. Raita

28 papers receiving 680 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
T. Raita Finland	9	409	172	154	141	133	29	733
JF Baldwin United Kingdom	7	322 0.8×	75 0.4×	137 0.9×	94 0.7×	170 1.3×	30	714
Craig Stanfill United States	10	883 2.2×	179 1.0×	260 1.7×	196 1.4×	250 1.9×	21	1.1k
E. Koutsofios United States	9	209 0.5×	85 0.5×	239 1.6×	257 1.8×	158 1.2×	14	635
Fernando Silva Portugal	17	349 0.9×	40 0.2×	102 0.7×	129 0.9×	205 1.5×	74	870
Domagoj Vrgoč Chile	11	340 0.8×	179 1.0×	133 0.9×	274 1.9×	363 2.7×	38	742
P.W. Grant United Kingdom	11	362 0.9×	90 0.5×	48 0.3×	309 2.2×	68 0.5×	54	738
Colin de la Higuera France	11	571 1.4×	92 0.5×	113 0.7×	124 0.9×	93 0.7×	49	828
Dina Goldin United States	14	188 0.5×	107 0.6×	51 0.3×	46 0.3×	228 1.7×	38	547
Weiping Wang China	15	197 0.5×	151 0.9×	195 1.3×	52 0.4×	393 3.0×	103	799
Stuart H. Rubin United States	11	521 1.3×	166 1.0×	187 1.2×	129 0.9×	358 2.7×	120	906

Countries citing papers authored by T. Raita

Since Specialization

Citations

This map shows the geographic impact of T. Raita's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by T. Raita with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites T. Raita more than expected).

Fields of papers citing papers by T. Raita

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by T. Raita. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by T. Raita. The network helps show where T. Raita may publish in the future.

Co-authorship network of co-authors of T. Raita

This figure shows the co-authorship network connecting the top 25 collaborators of T. Raita. A scholar is included among the top collaborators of T. Raita based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with T. Raita. T. Raita is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Nevalainen, Olli, T. Raita, & Harold Thimbleby. (2003). Appendix - An Improved Insert Sort Algorithms. UCL Discovery (University College London). 1 indexed citations

2.

Bookstein, Abraham, Vladimir Kulyukin, T. Raita, & John Nicholson. (2003). Adapting measures of clumping strength to assess term‐term similarity. Journal of the American Society for Information Science and Technology. 54(7). 611–620. 7 indexed citations

3.

Bookstein, Abraham, Shmuel T. Klein, & T. Raita. (2003). Model based concordance compression. 82–91. 1 indexed citations

4.

Teuhola, Jukka & T. Raita. (2002). Piecewise arithmetic coding. 33–42. 1 indexed citations

5.

Bergroth, Lasse, Harri Hakonen, & T. Raita. (2002). A survey of longest common subsequence algorithms. 39–48. 390 indexed citations

6.

Bookstein, Abraham, et al.. (2002). Can random fluctuation be exploited in data compression?. 1 4. 70–78. 1 indexed citations

7.

Bookstein, Abraham, Shmuel T. Klein, & T. Raita. (2002). An overhead reduction technique for mega-state compression schemes. 367–376. 1 indexed citations

8.

Bookstein, Abraham & T. Raita. (2001). Discovering term occurrence structure in text. Journal of the American Society for Information Science and Technology. 52(6). 476–486. 4 indexed citations

9.

Bookstein, Abraham, Shmuel T. Klein, & T. Raita. (2000). Simple Bayesian Model for Bitmap Compression. Information Retrieval. 1(4). 315–328. 7 indexed citations

10.

Raita, T.. (1999). On guards and symbol dependencies in substring search. Software Practice and Experience. 29(11). 931–941. 1 indexed citations

11.

Bookstein, Abraham, Shmuel T. Klein, & T. Raita. (1998). Clumping properties of content-bearing words. Journal of the American Society for Information Science. 49(2). 102–114. 3 indexed citations

12.

Bookstein, Abraham, Shmuel T. Klein, & T. Raita. (1998). Clumping properties of content‐bearing words. Journal of the American Society for Information Science. 49(2). 102–114. 28 indexed citations

13.

Bookstein, Abraham, Shmuel T. Klein, & T. Raita. (1997). Modeling word occurrences for the compression of concordances. ACM Transactions on Information Systems. 15(3). 254–290. 14 indexed citations

14.

Bookstein, Abraham, Shmuel T. Klein, & T. Raita. (1995). Detecting Content-Bearing Words by Serial Clustering.. International ACM SIGIR Conference on Research and Development in Information Retrieval. 319–327. 12 indexed citations

15.

Bookstein, Abraham, Shmuel T. Klein, & T. Raita. (1995). Detecting content-bearing words by serial clustering---extended abstract. 319–327. 4 indexed citations

16.

Bookstein, Abraham, Shmuel T. Klein, & T. Raita. (1993). Is Huffman coding dead? (extended abstract). 80–87. 5 indexed citations

17.

Raita, T.. (1992). Tuning the boyer‐moore‐horspool string searching algorithm. Software Practice and Experience. 22(10). 879–884. 54 indexed citations

18.

Raita, T. & Jukka Teuhola. (1987). Predictive test compression by hashing. 223–233. 10 indexed citations

19.

Raita, T.. (1987). An Automatic System for File Compression. The Computer Journal. 30(1). 80–86. 3 indexed citations

20.

Teuhola, Jukka & T. Raita. (1986). Text compression using prediction. 97–102. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact