Athanasios Tsakalidis

Prof. Athanasios K. Tsakalidis (Greek: Αθανάσιος Κ. Τσακαλίδης; born 1950) is a Greek computer scientist, a professor at the Graphics, Multimedia and GIS Laboratory, Computer Engineering and Informatics Department (CEID), University of Patras, Greece.

His scientific contributions extend diverse fields of computer science, including data structures, computational geometry, graph algorithms, GIS, bioinformatics, medical informatics, expert systems, databases, multimedia, information retrieval and more. Especially significant contributions include co-authoring Chapter 6: "Data Structures" in the Handbook of Theoretical Computer Science[1] with his advisor prof. Kurt Mehlhorn, as well as numerous other elementary theoretical results that are cataloged in the article Some Results for Elementary Operations[2] published in Efficient Algorithms in celebration of prof. K. Mehlhorn's 60th birthday.

Scientific Research

His research interests include: Data Structures, Graph Algorithms, Computational Geometry, GIS, Medical Informatics, Expert Systems, Databases, Multimedia, Information Retrieval, and Bioinformatics.

He has participated in many EU research programs, such as ESPRIT, RACE, AIM, STRIDE, Basic Research Actions in ESPRIT, ESPRIT Special Actions, TELEMATICS Applications, ADAPT, HORIZON, ΕΠΕΤ ΙΙ, ΥΠΕΡ, ΤΕΝ – TELECOM, IST, LEONARDO DA VINCI, MARIE CURIE, SOCRATES.

He is one of the 48 writers (6 of whom have received the ACM Turing Award) of the ground-laying computer science book, Handbook of Theoretical Computer Science, Vol A Elsevier Science publishers, co-published by MIT Press, his work being, along with professor Kurt Mehlhorn, in Chapter 6: Data Structures (his favourite field).

His pioneering results on the list manipulation[3] and localized search[4] problems in the 1980's led to the foundation of the obiquitous persistence theory on data structures, developed[5] by prof. Robert E. Tarjan.

Other significant results on the design and analysis of data structures were contributed on the problems of interpolation search,[6] negative cycle[7] and nearest common ancestor[8][9], the latter being referenced as "Tsakalidis' Algorithm" in the optimal results[10] of prof. Mikkel Thorup.

His extensive work on algorithms, data structures, computational geometry and graph algorithms has been cited and acknowledged by prominent computer scientists like Robert E. Tarjan, Ian J. Munro, Dan Willard, Jon Bentley, Jan van Leeuwen, Timothy M. Chan, Lars Arge, Mihai Patrascu, Erik Demaine, Mikkel Thorup, Prosenjit Bose, Gerth S. Brodal, Haim Kaplan, Peter Widmayer, Giuseppe F. Italiano, Peyman Afshani, Kasper Larsen and more.

Academic career

Athanasios Tsakalidis obtained his Ph.D. degree in informatics in 1983 at the Computer Science department of Saarland University, Germany. His thesis is entitled "Some Results for the Dictionary Problem" and was completed under the supervision Professor Kurt Mehlhorn, director of the Max Planck Institute for Informatics. Prior to that he had earned a Master's degree (thesis: "Sorting Presorted Files", 1980) and an undergraduate degree in informatics (1977) by the same university. In fact, the latter was his second undergraduate degree, as he had previously graduated from the Mathematics Department of the Aristotle University of Thessaloniki, Greece (1973).

Since 1983, he participated in research for the DFG (Deutsche Forschungsgemeinschaft, the German community of research) and professional teaching at the University of Saarland related to Data Structures, Graph Algorithms, Computational Geometry and programming, until 1989, when he returned to Greece to become an associate professor (and later in 1992 a full professor) at the Computer Engineering and Informatics Department (CEID), University of Patras, where he remains professionally active until today. He was also a visiting professor at King's College London (2003–2006).

Besides significant scientific work, Athanasios Tsakalidis has nominated 26 Ph.D. Fellows, 13 of whom have pursued a successful academic career themselves. Furthemore, he has awarded 63 Master degrees in computer science and appointed 630 undergraduate majors.

Short Biography

Athanasios Tsakalidis was born in 1950 in Katerini, Pieria, northern Greece, and studied mathematics at the Aristotle University of Thessaloniki. In 1973 he embarked on a journey around Europe which led him to Saarbrücken, Germany, where he was introduced by prof. Günter Hotz to the novel (at the time) field of computer science that was then being coined informatics. After 28 months of national service, he was enrolled in 1976 to the Computer Science department of Saarland University becoming the oldest undergraduate student (26 years old freshman) to be advised by the youngest professor at the time (27 years old) prof. Kurt Mehlhorn.

Completing a 13 years long academic career in Germany, he returned to Patras, Greece in 1989, when he practically introduced theoretical computer science to the greek academia and public. Until today he remains an influential academic figure, fundamentally promoting computer science in Greece, either by serving CEID (also as a Chairman in different periods) and also by supporting the establishment and development of computer science departments in many universities across the country.

Arts

Beyond computer science, Athanasios Tsakalidis has also created hundreds of paintings. A sample is found on his homepage.

References

  1. ↑ van Leeuwen, Jan (1990-01-01). Handbook of Theoretical Computer Science: Algorithms and complexity. Elsevier. ISBN 9780444880710.
  2. ↑ Tsakalidis, Athanasios K. (2009-01-01). Albers, Susanne; Alt, Helmut; Näher, Stefan, eds. Some Results for Elementary Operations. Lecture Notes in Computer Science. Springer Berlin Heidelberg. pp. 121–133. doi:10.1007/978-3-642-03456-5_8#page-1. ISBN 978-3-642-03455-8.
  3. ↑ Tsakalidis, Athanasios K. (1984-05-01). "Maintaining order in a generalized linked list". Acta Informatica 21 (1): 101–112. doi:10.1007/BF00289142. ISSN 0001-5903.
  4. ↑ Tsakalidis, Athanasios K. (1985-10-01). "AVL-trees for localized search". Information and Control 67 (1–3): 173–194. doi:10.1016/S0019-9958(85)80034-6.
  5. ↑ Driscoll, James R.; Sarnak, Neil; Sleator, Daniel D.; Tarjan, Robert E. (1989-02-01). "Making data structures persistent". Journal of Computer and System Sciences 38 (1): 86–124. doi:10.1016/0022-0000(89)90034-2.
  6. ↑ Mehlhorn, Kurt; Tsakalidis, Athanasios (1993-07-01). "Dynamic Interpolation Search". J. ACM 40 (3): 621–634. doi:10.1145/174130.174139. ISSN 0004-5411.
  7. ↑ Tsakalidis, Athanasios K.: Finding a Negative Cycle in a Directed Graph. Techn. Report A85/05, Angewandte Mathematik und Informatik, FB-10, Univ. des Saarlandes, Saarbrücken (1985)
  8. ↑ van Leeuwen, J., Tsakalidis, A.K.: An optimal Pointer Machine Algorithm for Nearest Common Ancestors. Tech. Report, UU-CS-88-17, dept. of Computer Science, Univ. of Utrecht, Utrecht (1988)
  9. ↑ Tsakalidis, Athanasios K. (1988-01-01). "The nearest common ancestor in a dynamic tree". Acta Informatica 25 (1): 37–54. doi:10.1007/BF00268844. ISSN 0001-5903.
  10. ↑ Alstrup, Stephen; Thorup, Mikkel (2000-05-01). "Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees". Journal of Algorithms 35 (2): 169–188. doi:10.1006/jagm.2000.1079.

External links

This article is issued from Wikipedia - version of the Thursday, April 28, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.