[ sulge aken ]
| Elulookirjeldus (CV) | ||
| 1. | Eesnimi | Hellis |
| 2. | Perekonnanimi | Tamm |
| 3. | Töökoht | TTÜ Küberneetika Instituut |
| 4. | Ametikoht | vanemteadur (erakorraline) |
| 5. | Sünniaeg | 18.06.1965 (päev.kuu.aasta) |
| 6. | Haridus | Helsingi Ülikool, doktorikraad arvutiteaduse alal (2005) Tartu Ülikool, matemaatik (diplom) (1988) |
| 7. | Teenistuskäik | Doktorant ja teadur, Helsingi Ülikool, Soome, 1997 - 2005 Kontoriassistent, Florida Ülikool, USA, 1994 - 1996 Doktorant, Tartu Ülikool, 1990 - 1994 Insener, Tartu Ülikool, 1988 - 1990 |
| 8. | Teaduskraad | Filosoofiadoktor (arvutiteaduses) |
| 9. | Teaduskraadi välja andnud asutus, aasta |
Helsingi Ülikool, Soome, 2005 |
| 10. | Tunnustused | |
| 11. | Teadusorganisatsiooniline ja –administratiivne tegevus |
|
| 12. | Juhendamisel kaitstud väitekirjad |
|
| 13. | Teadustöö põhisuunad | Automaatide teooria ja algoritmid. |
| 14. | Jooksvad grandid | |
| 15. | Teaduspublikatsioonid |
Tamm, H., Nykänen, M., and Ukkonen, E. Size reduction of multitape automata. Post-proc. 9th Int. Conf. on Implementation and Application of Automata (CIAA 2004), Lecture Notes in Computer Science 3317, Springer-Verlag, 2005, 329-330. Tamm, H., Nykänen, M., and Ukkonen, E. Size reduction of multitape automata. Pre-proc. Tenth Int. Conf. on Implementation and Application of Automata (CIAA 2005), Sophia Antipolis, France, June 27-29, 2005, 236-245. Tamm, H., and Ukkonen, E. Bideterministic automata and minimal representations of regular languages. Theoretical Computer Science, 328, 1-2 (2004), 135-149. Grahne, G., Hakli, R., Nykänen, M., Tamm, H., and Ukkonen, E. Design and implementation of a string database query language. Information Systems, 28 (2003), 311-337. Tamm, H., and Ukkonen, E. Bideterministic automata and minimal representations of regular languages. Proc. Eighth Int. Conf. on Implementation and Application of Automata (CIAA 2003), Lecture Notes in Computer Science 2759, Springer-Verlag, 2003, 61-71. Hakli, R., Nykänen, M., and Tamm, H. Adding string processing capabilities to data management systems. Proc. Seventh Int. Symp. on String Processing and Information Retrieval (SPIRE 2000), IEEE Computer Society Press, Silver Spring, MD, 2000, 122-131. Hakli, R., Nykänen, M., Tamm, H., and Ukkonen, E. Implementing a declarative string query language with string restructuring. Proc. First Int. Workshop on Practical Aspects of Declarative Languages (PADL'99), Lecture Notes in Computer Science 1551, Springer-Verlag, 1999, 179-195. |
viimati muudetud: 01.09.2005
| Curriculum Vitae (CV) | ||
| 1. | First Name | Hellis |
| 2. | Surname | Tamm |
| 3. | Institution | Institute of Cybernetics at TUT |
| 4. | Position | senior researcher |
| 5. | Date of birth | 18.06.1965 (day.month.year) |
| 6. | Education | University of Helsinki, PhD in computer science (2005) University of Tartu, mathematician (diploma) (1988) |
| 7. | Research and professional experience |
PhD student and researcher, University of Helsinki, Finland, 1997 - 2005 Office assistant, University of Florida, USA, 1994 - 1996 PhD student, University of Tartu, 1990 - 1994 Engineer, University of Tartu, 1988 - 1990 |
| 8. | Academic degree | Doctor of Philosophy (in computer science) |
| 9. | Dates and sites of earning the degrees |
University of Helsinki, Finland, 2005 |
| 10. | Honours/awards | |
| 11. | Research-administrative experience |
|
| 12. | Supervised dissertations | |
| 13. | Current research program | Automata theory and algorithms. |
| 14. | Current grant funding | |
| 15. | List of most important publications |
Tamm, H., Nykänen, M., and Ukkonen, E. Size reduction of multitape automata. Post-proc. 9th Int. Conf. on Implementation and Application of Automata (CIAA 2004), Lecture Notes in Computer Science 3317, Springer-Verlag, 2005, 329-330. Tamm, H., Nykänen, M., and Ukkonen, E. Size reduction of multitape automata. Pre-proc. Tenth Int. Conf. on Implementation and Application of Automata (CIAA 2005), Sophia Antipolis, France, June 27-29, 2005, 236-245. Tamm, H., and Ukkonen, E. Bideterministic automata and minimal representations of regular languages. Theoretical Computer Science, 328, 1-2 (2004), 135-149. Grahne, G., Hakli, R., Nykänen, M., Tamm, H., and Ukkonen, E. Design and implementation of a string database query language. Information Systems, 28 (2003), 311-337. Tamm, H., and Ukkonen, E. Bideterministic automata and minimal representations of regular languages. Proc. Eighth Int. Conf. on Implementation and Application of Automata (CIAA 2003), Lecture Notes in Computer Science 2759, Springer-Verlag, 2003, 61-71. Hakli, R., Nykänen, M., and Tamm, H. Adding string processing capabilities to data management systems. Proc. Seventh Int. Symp. on String Processing and Information Retrieval (SPIRE 2000), IEEE Computer Society Press, Silver Spring, MD, 2000, 122-131. Hakli, R., Nykänen, M., Tamm, H., and Ukkonen, E. Implementing a declarative string query language with string restructuring. Proc. First Int. Workshop on Practical Aspects of Declarative Languages (PADL'99), Lecture Notes in Computer Science 1551, Springer-Verlag, 1999, 179-195. |
last updated: 01.09.2005
[ sulge aken ]