Athanasios Tsakalidis: Difference between revisions
No edit summary |
Τελικό. |
||
| Line 13: | Line 13: | ||
He is one of the 48 writers (6 of whom have received the [[Turing Award|ACM Turing Award]]) of the ground-laying computer science book, ''Handbook of Theoretical Computer Science, Vol A'' [[Elsevier|Elsevier Science publishers]], co-published by [[MIT Press]], his work being, along with professor [[Kurt Mehlhorn]], in Chapter 6: Data Structures (his favourite field). |
He is one of the 48 writers (6 of whom have received the [[Turing Award|ACM Turing Award]]) of the ground-laying computer science book, ''Handbook of Theoretical Computer Science, Vol A'' [[Elsevier|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'' and ''localized search'' problems in the 1980's led to the foundation of the obiquitous [[Persistent data structures|persistence theory]] on data structures, developed by prof. [[Robert Tarjan|Robert E. Tarjan]]. |
His pioneering results on the ''list manipulation''<ref>{{Cite journal|title = Maintaining order in a generalized linked list|url = http://link.springer.com/article/10.1007/BF00289142|journal = Acta Informatica|date = 1984-05-01|issn = 0001-5903|pages = 101-112|volume = 21|issue = 1|doi = 10.1007/BF00289142|language = en|first = Athanasios K.|last = Tsakalidis}}</ref> and ''localized search''<ref>{{Cite journal|title = AVL-trees for localized search|url = http://www.sciencedirect.com/science/article/pii/S0019995885800346|journal = Information and Control|date = 1985-10-01|pages = 173-194|volume = 67|issue = 1–3|doi = 10.1016/S0019-9958(85)80034-6|first = Athanasios K.|last = Tsakalidis}}</ref> problems in the 1980's led to the foundation of the obiquitous [[Persistent data structures|persistence theory]] on data structures, developed<ref>{{Cite journal|title = Making data structures persistent|url = http://www.sciencedirect.com/science/article/pii/0022000089900342|journal = Journal of Computer and System Sciences|date = 1989-02-01|pages = 86-124|volume = 38|issue = 1|doi = 10.1016/0022-0000(89)90034-2|first = James R.|last = Driscoll|first2 = Neil|last2 = Sarnak|first3 = Daniel D.|last3 = Sleator|first4 = Robert E.|last4 = Tarjan}}</ref> by prof. [[Robert Tarjan|Robert E. Tarjan]]. |
||
Other significant results on the design and analysis of data structures were contributed on the problems of ''interpolation search''<ref>{{Cite journal|title = Dynamic Interpolation Search|url = http://doi.acm.org/10.1145/174130.174139|journal = J. ACM|date = 1993-07-01|issn = 0004-5411|pages = 621–634|volume = 40|issue = 3|doi = 10.1145/174130.174139|first = Kurt|last = Mehlhorn|first2 = Athanasios|last2 = Tsakalidis}}</ref> and ''nearest common ancestor''<ref>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)</ref><ref>{{Cite journal|title = The nearest common ancestor in a dynamic tree|url = http://link.springer.com/article/10.1007/BF00268844|journal = Acta Informatica|date = 1988-01-01|issn = 0001-5903|pages = 37-54|volume = 25|issue = 1|doi = 10.1007/BF00268844|language = en|first = Athanasios K.|last = Tsakalidis}}</ref>'','' the latter being referenced as "''Tsakalidis' Algorithm''" in the optimal results<ref>{{Cite journal|title = Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees|url = http://www.sciencedirect.com/science/article/pii/S0196677400910794|journal = Journal of Algorithms|date = 2000-05-01|pages = 169-188|volume = 35|issue = 2|doi = 10.1006/jagm.2000.1079|first = Stephen|last = Alstrup|first2 = Mikkel|last2 = Thorup}}</ref> of prof. [[Mikkel Thorup]]. |
|||
Other significant results on the design and analysis of data structures were contributed on the problems of ''interpolation searching'' and ''nearest common ancestor,'' the latter being referenced as "''Tsakalidis' Algorithm''" in the relevant work 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 Tarjan|Robert E. Tarjan]], [[Ian Munro (computer scientist)|Ian J. Munro]], [[Dan Willard]], [[Jon Bentley|Jon Bentley,]] [[Timothy M. Chan]], [[Mihai Pătrașcu|Mihai Patrascu]], [[Erik Demaine]], and more. |
His extensive work on ''algorithms'', ''data structures'', ''computational geometry'' and ''graph algorithms'' has been cited and acknowledged by prominent computer scientists like [[Robert Tarjan|Robert E. Tarjan]], [[Ian Munro (computer scientist)|Ian J. Munro]], [[Dan Willard]], [[Jon Bentley|Jon Bentley,]] [[Jan van Leeuwen]], [[Timothy M. Chan]], [[Mihai Pătrașcu|Mihai Patrascu]], [[Erik Demaine]], and more. |
||
== Academic Career == |
== Academic Career == |
||
| Line 26: | Line 26: | ||
Beyond 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 820 undergraduate majors. |
Beyond 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 820 undergraduate majors. |
||
== Short Biography == |
== Short Biography == |
||
Athanasios Tsakalidis was born in 1950 in [[Katerini]], [[Pieria (regional unit)|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 |
Athanasios Tsakalidis was born in 1950 in [[Katerini]], [[Pieria (regional unit)|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]]. In 1976 he enrolled in the [https://www.cs.uni-saarland.de/ Computer Science department] of [[Saarland University]] becoming the oldest undergraduate student (26 year old freshman) to be advised by the youngest professor at the time (27 year 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. |
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. |
||
== Arts == |
== Arts == |
||
Besides computer science, Athanasios Tsakalidis has |
Besides computer science, Athanasios Tsakalidis has also created hundreds of paintings, a sample of which can be found on his [http://www.tsakalidis.gr/painting/index.htm homepage]. |
||
==References== |
==References== |
||
Revision as of 18:29, 24 December 2015
 |
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] and nearest common ancestor[7][8], the latter being referenced as "Tsakalidis' Algorithm" in the optimal results[9] 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, Mihai Patrascu, Erik Demaine, 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 (1970).
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 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).
Beyond 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 820 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. In 1976 he enrolled in the Computer Science department of Saarland University becoming the oldest undergraduate student (26 year old freshman) to be advised by the youngest professor at the time (27 year 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.
Arts
Besides computer science, Athanasios Tsakalidis has also created hundreds of paintings, a sample of which can be found on his homepage.
References
- ^ Leeuwen, Jan (1990-01-01). Handbook of Theoretical Computer Science: Algorithms and complexity. Elsevier. ISBN 9780444880710.
- ^ 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.
- ^ 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.
- ^ 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.
- ^ 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.
- ^ Mehlhorn, Kurt; Tsakalidis, Athanasios (1993-07-01). "Dynamic Interpolation Search". J. ACM. 40 (3): 621–634. doi:10.1145/174130.174139. ISSN 0004-5411.
- ^ 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)
- ^ 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.
- ^ 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
- Homepage of Athanasios Tsakalidis
- List of Papers Published