Konstantinos Tsakalidis

Lecturer, Ph.D.
Department of Computer Science
University of Liverpool

Contact Information
Post: Office 1.13, Ashton Building
         Ashton Street, Liverpool L69 3BX, UK
Mail: K.Tsakalidis at liverpool.ac.uk


I'm a Lecturer at the Department of Computer Science at the University of Liverpool. My research interests include:
I received my Ph.D. from Aarhus University in 2011, under the supervision of Professor Gerth S. Brodal. Before joining the University of Liverpool, I was a post-doctorate research fellow at the Hong Kong University of Science and Technology, Hong Kong (2012-2013, 2014-2015), at the Chinese University of Hong Kong, Hong Kong (2013-2014), at the University of Waterloo, Canada (2016-2017) and at New York University, USA (2017-2018).

Courses:


Links:

  1. My DBLP Profile
  2. My Google Scholar Profile
  3. My LinkedIn Profile

Publications:

Click on the titles to display abstracts.
  1. Optimal deterministic shallow cuttings for 3-d dominance ranges
    Konstantinos Tsakalidis, Peyman Afshani
    Algorithmica 80(11): 3192-3206 (2018).
    The preliminary version appeared in the proceedings of SODA 2014: 1389-1398
  2. Dynamic planar orthogonal point location in sublogarithmic time
    Timothy M. Chan, Konstantinos Tsakalidis
    Proceedings of Symposium on Computational Geometry 2018: 25:1-25:15
  3. Orthogonal point location and rectangle stabbing queries in 3-d
    Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis
    Proceedings of ICALP 2018: 31:1-31:14
  4. Fuzzy random walkers with second order bounds: an asymmetric analysis
    Georgios Drakopoulos, Andreas Kanavos, Konstantinos Tsakalidis
    Algorithms 10(2): 40 (2017)
  5. Dynamic orthogonal range searching on the RAM, revisited
    Timothy M. Chan, Konstantinos Tsakalidis
    Proceedings of Symposium on Computational Geometry 2017: 28:1-28:13
  6. Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
    Timothy M. Chan, Konstantinos Tsakalidis
    Invited to Discrete & Computational Geometry 56(4): 866-881 (2016).
    The preliminary version appeared in the proceedings of Symposium on Computational Geometry 2015: 719-732
  7. SMaRT: A novel framework for addressing range queries over nonlinear trajectories
    Panagiotis Gerolymatos, Spyros Sioutas, Nikolaos Nodarakis, Alexandros Panaretos, Konstantinos Tsakalidis
    Journal of Systems and Software 105: 79-90 (2015)
  8. Dynamic 3-sided planar range queries with expected doubly-logarithmic time
    Gerth S. Brodal, Alexis C. Kaporis, Apostolos N. Papadopoulos, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas
    Theor. Comput. Sci. 526: 58-74 (2014).
    Preliminary versions appeared in the proceedings of ICDT 2010: 34-43 and of ISAAC 2009: 193-202
  9. Deterministic rectangle enclosure and offline dominance reporting on the RAM
    Timothy M. Chan, Konstantinos Tsakalidis, Peyman Afshani
    Proceedings of ICALP (1) 2014: 77-88
  10. Compressed persistent index for efficient rank/select queries
    Wing-Kai Hon, Lap-Kei Lee, Kunihiko Sadakane, Konstantinos Tsakalidis
    Proceedings of WADS 2013: 402-414
  11. An improved algorithm for static 3D dominance reporting in the pointer machine
    Christos Makris, Konstantinos Tsakalidis
    Proceedings of ISAAC 2012: 568-577
  12. Fully persistent B-trees
    Gerth S. Brodal, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas
    Proceedings of SODA 2012: 602-614
  13. Dynamic planar range maxima queries
    Gerth S. Brodal, Konstantinos Tsakalidis
    Proceedings of ICALP (1) 2011: 256-267
  14. A new approach on indexing mobile objects on the plane
    Christos Makris, Yiannis Manolopoulos, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas
    Data Knowl. Eng. 67(3): 362-380 (2008).
    The preliminary version appeared in the proceedings of ADBIS 2007: 189-204