| 词条 | Athanasios Tsakalidis |
| 释义 |
Prof. Athanasios K. Tsakalidis ({{lang-el|Αθανάσιος Κ. Τσακαλίδης}}; born 1950) is a Greek computer scientist, a professor at the Graphics, Multimedia and GIS Laboratory, [https://www.ceid.upatras.gr/en 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 [https://mitpress.mit.edu/books/handbook-theoretical-computer-science 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 [https://www.ceid.upatras.gr/webpages/courses/cplusplus/bds/elementary.pdf Some Results for Elementary Operations][2] published in [https://link.springer.com/book/10.1007/978-3-642-03456-5 Efficient Algorithms] in celebration of prof. K. Mehlhorn's 60th birthday. Scientific ResearchHis 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 1980s led to the foundation of the ubiquitous 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 careerAthanasios Tsakalidis obtained his Ph.D. degree in informatics in 1983 at the [https://www.cs.uni-saarland.de/ 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 [https://www.ceid.upatras.gr/en 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. Furthermore, he has awarded 63 Master's degrees in computer science and appointed 630 undergraduate majors. Short BiographyAthanasios 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 [https://www.cs.uni-saarland.de/ 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. ArtsBeyond computer science, Athanasios Tsakalidis has also created hundreds of paintings. A sample is found on his homepage. References1. ^{{Cite book|title = Handbook of Theoretical Computer Science: Algorithms and complexity|url = https://books.google.com/?id=-X39_rA3VSQC&printsec=frontcover#v=onepage&q&f=false|publisher = Elsevier|date = 1990-01-01|isbn = 9780444880710|first = Jan|last = van Leeuwen}} 2. ^{{Cite book|chapter = Some Results for Elementary Operations|publisher = Springer Berlin Heidelberg|date = 2009-01-01|isbn = 978-3-642-03455-8|pages = 121–133|series = Lecture Notes in Computer Science|doi = 10.1007/978-3-642-03456-5_8|first = Athanasios K.|last = Tsakalidis|editor-first = Susanne|editor-last = Albers|editor-first2 = Helmut|editor-last2 = Alt|editor-first3 = Stefan|editor-last3 = Näher|title = Efficient Algorithms|volume = 5760}} 3. ^{{Cite journal|title = Maintaining order in a generalized linked list|journal = Acta Informatica|date = 1984-05-01|issn = 0001-5903|pages = 101–112|volume = 21|issue = 1|doi = 10.1007/BF00289142|first = Athanasios K.|last = Tsakalidis}} 4. ^{{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}} 5. ^{{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}} 6. ^{{Cite journal|title = Dynamic Interpolation Search|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}} 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. ^{{Cite journal|title = The nearest common ancestor in a dynamic tree|journal = Acta Informatica|date = 1988-01-01|issn = 0001-5903|pages = 37–54|volume = 25|issue = 1|doi = 10.1007/BF00268844|first = Athanasios K.|last = Tsakalidis}} 10. ^{{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}} External links
10 : 1950 births|Greek computer scientists|Greek academics|Academics of King's College London|Living people|People from Katerini|Aristotle University of Thessaloniki alumni|Saarland University alumni|Saarland University faculty|University of Patras faculty |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。