NB! If you have just stumbled into this page by accident (e.g., looking up your name from Google) and wonder what is this page about, please check this page one level upwards that has explanations and some additional information
Disclaimer: All information has been gathered from public sources. If you want to add or delete some information about you, please email me. I do this all from my free time. But I welcome information that will help me in updating this page.
Disclaimer 2. Do not take those numbers too seriously without actually studying how Google collects the citations. Moreover, bear in mind that citations differ significantly in subfields of computer science, with practical areas getting a bulk of the citations. Also, for some of the authors, a majority of citations comes from authored textbooks, or even worse, from self-citations. Thus, be careful.
Note: "cites per #authors" divides the number of citations each paper has got by the number of authors it has. This increases fairness in interdisciplinary comparisons (e.g., papers in biology have 20+ coauthors and thousands of citations, papers in mathematics have 1 author and tens of citations). We note that this parameter is not perfect, since Google Scholar omits some authors in their page, but the same is also true in say the "Publish and Perish" program.
Links to Google citations profiles are fetched automatically when updating the database...
All links are clickable. For example, you can sort people according to Cites, Recent (2005+), H-Index, compare institutions to each other, or see people only from a certain institution.
People with less than 0 citations are not displayed (this can adjusted with url suffix "&cutoff=xxx").
Greyed out persons do only partially belong to this table (for various reasons), or they have namesakes that contribute to majority of their citations.
|Name||Institution||Cites per #authors||Cites||Recent (2005+)||H-Index||H-Index (2005+)||Google citations||Birthday||Thesis|
|1.||Helger LipmaaÁ>||UT.ATI||2035 ( 56%)||994 ( 65%)||3651||1531||29||19||3690||xx.04.1972||Secure and Efficient Time-Stamping Systems (U. of Tartu, 1999)|
|2.||Tarmo UustaluÁ>||TTU.IOC.CS||771 ( 45%)||438 ( 44%)||1704||1004||24||19||1685||xx.01.1969||Natural Deduction for Intuitionistic Least and Greatest Fixedpoint Logics, with an Application to Program Construction (Sweden.KTH, 1998)|
|3.||Irina Astrova||TTU.IOC.CS||414 ( 66%)||236 ( 52%)||628||450||12||12||0|
|4.||Enn Tõugu/TyuguÁ>||TTU.IOC.CS||548 ( 63%)||128 ( 54%)||876||235||18||9||1077||xx.05.1935|
|5.||Silvio Capobianco||IOC.CS||66 ( 60%)||59 ( 65%)||110||90||6||6||103|
|6.||Andres OjamaaÁ>||IOC.CS||39 ( 37%)||39 ( 37%)||107||107||6||6||104|
|7.||Hele-Mai HaavÁ>||IOC.CS||245 ( 68%)||30 ( 47%)||358||64||8||5||380|
|8.||Andres Toom||IOC.CS||29 ( 24%)||29 ( 24%)||121||121||5||5||0|
|9.||Riina Maigre||TTU.IOC.CS||25 ( 56%)||25 ( 56%)||45||45||4||4||50|
|10.||Jaan PenjamÁ>||IOC.CS||64 ( 53%)||11 ( 34%)||121||32||8||3||147|
|11.||Mait Harf||IOC.CS||11 ( 40%)||7 ( 36%)||28||20||2||2||0|
|12.||Vahur Kotkas||IOC.CS||19 ( 32%)||6 ( 30%)||61||21||4||3||0|
|13.||Kristiina Kindel||IOC.CS||3 ( 27%)||2 ( 27%)||11||8||2||1||0|
|14.||Jelena Sanko||IOC.CS||2 ( 50%)||1 ( 50%)||3||2||1||1||0|
|15.||Hendrik Maarand||IOC.CS?||0 ( 50%)||0 ( 50%)||1||1||1||1||0|