Draft:Athanasios Tsakalidis
| Submission declined on 3 June 2025 by TheNuggeteer (talk). This submission is not adequately supported by reliable sources. Reliable sources are required so that information can be verified. If you need help with referencing, please see Referencing for beginners and Citing sources. This submission's references do not show that the subject qualifies for a Wikipedia article—that is, they do not show significant coverage (not just passing mentions) about the subject in published, reliable, secondary sources that are independent of the subject (see the guidelines on the notability of people). Before any resubmission, additional references meeting these criteria should be added (see technical help and learn about mistakes to avoid when addressing this issue). If no additional references exist, the subject is not suitable for Wikipedia.
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
|  |
Comment: Most of the article is unsourced, a major flaw for a biographical article. An outside search has no reliable sources for this article. 🍗TheNuggeteer🍗 (My "blotter")11:32, 3 June 2025 (UTC)
Short Biography
[edit]Athanasios Tsakalidis, Professor Emeritus in Computer Engineering and Informatics Department (CEID), University of Patras, Greece 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.
Academic Career
[edit]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 30 Ph.D. Fellows, 15 of whom have pursued a successful academic career themselves. Furthermore, he has awarded 50 Master's degrees in computer science and appointed 550 undergraduate majors. He has helped more than 2300 graduates students with his recommendation letters to define their academic or engineering careers.
Scientific Research
[edit]He is one of the 48 contributors (8 of whom have received the ACM Turing Award) of the ground-laying computer science book, Handbook of Theoretical Computer Science, Vol A [1]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 scientific contributions extend diverse fields of computer science, including data structures, computational geometry, graph algorithms, GIS, bioinformatics, medical informatics, expert systems, stringology and more. Νumerous his 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. His pioneering results on the list manipulation [3](order-maintenace problem)and localized search [4] problems (finger search tree, finger search) in the 1980s led to the foundation of the ubiquitous persistence theory on data structures, developed [5] by prof. Robert E. Tarjan.(in this paper they attribute to him “the lazy recoloring technique of Tsakalidis”). Other significant results on the design and analysis of data structures were contributed on the problems of interpolation search [6], (interpolation search, weight-balanced tree) negative cycle [7] and nearest common ancestor [8][9], the latter being referenced as "Tsakalidis' Algorithm" in the optimal results of prof. Mikkel Thorup [10]. His extensive work on algorithms, data structures, computational geometry and graph algorithms and stringology 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 (Brodal Queue), Haim Kaplan, Micha Sharir, Dan Sleator, Giuseppe F. Italiano, Peyman Afshani, Kasper Larsen, Costas Iliopoulos, Maxime Crochemore, Wojciech Rytter, Andrew V. Goldberg and more.
Arts
[edit]Beyond computer science, Athanasios Tsakalidis has also created hundreds of paintings.
External links
[edit]https://www.researchgate.net/profile/Athanasios-Tsakalidis
https://dblp.org/pid/19/5175.html
https://scholar.google.com/citations?user=2DESJwwAAAAJ&hl=el&oi=sra
https://genealogy.math.ndsu.nodak.edu/id.php?id=181815
References
[edit]- ^ van Leeuwen, Jan (1990-01-01). Handbook of Theoretical Computer Science: Algorithms and complexity. Elsevier. ISBN 9780444880710.
- ^ Tsakalidis, Athanasios K. (2009-01-01). "Some Results for Elementary Operations". In Albers, Susanne; Alt, Helmut; Näher, Stefan (eds.). Efficient Algorithms. Lecture Notes in Computer Science. 5760. Springer Berlin Heidelberg. pp. 121–133. doi:10.1007/978-3-642-03456-5_8. ISBN 978-3-642-03455-8. S2CID 10044833.
- ^ 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.
- ^ 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)
- ^ 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.
References[edit]