G. Lagogiannis
G. Lagogiannis
Verified email at aua.gr
Title
Cited by
Cited by
Year
Strict fibonacci heaps
GS Brodal, G Lagogiannis, RE Tarjan
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
622012
Optimal finger search trees in the pointer machine
GS Brodal, G Lagogiannis, C Makris, A Tsakalidis, K Tsichlas
Journal of Computer and System Sciences 67 (2), 381-418, 2003
442003
Geometric Retrieval for Grid Points in the RAM Model.
S Sioutas, C Makris, N Kitsios, G Lagogiannis, J Tsaknakis, K Tsichlas, ...
J. UCS 10 (9), 1325-1353, 2004
72004
A time efficient indexing scheme for complex spatiotemporal retrieval
G Lagogiannis, N Lorentzos, S Sioutas, E Theodoridis
ACM SIGMOD Record 38 (3), 11-16, 2010
52010
A new algorithm for rectangle enclosure reporting
G Lagogiannis, C Makris, A Tsakalidis
Information processing letters 72 (5-6), 177-182, 1999
51999
New dynamic balanced search trees with worst-case constant update time
G Lagogiannis, C Makris, Y Panagis, S Sioutas, K Tsichlas
Journal of Automata, Languages and Combinatorics 8 (4), 607-632, 2003
42003
Partially persistent B-trees with constant worst-case update time
G Lagogiannis, N Lorentzos
Computers & Electrical Engineering 38 (2), 231-242, 2012
32012
Indexing moving objects: A real time approach
G Lagogiannis, N Lorentzos, AB Sideridis
Computer Science and Information Systems 10 (1), 173-195, 2013
22013
Indexing moving objects: A real time approach
G Lagogiannis, N Lorentzos, AB Sideridis
World Summit on Knowledge Society, 421-426, 2010
12010
A survey of persistent data structures
G Lagogiannis, Y Panagis, S Sioutas, A Tsakalidis
Proceedings of the 9th WSEAS International Conference on Computers, 1-6, 2005
12005
On the randomness that generates biased samples: The limited randomness approach
G Lagogiannis, S Kontopoulos, C Makris
Computer Science and Information Systems 16 (1), 205-225, 2019
2019
Query-Optimal Partially Persistent B-Trees with Constant Worst-Case Update Time
G Lagogiannis
International Journal of Foundations of Computer Science 28 (02), 141-169, 2017
2017
Parent queries over dynamic balanced parenthesis strings
G Lagogiannis
International Journal of Foundations of Computer Science 25 (01), 25-57, 2014
2014
Indexing Techniques for Spatiotemporal Databases
G Lagogiannis, C Makris, Y Panagis, S Sioutas, E Theodoridis, ...
Encyclopedia of Information Science and Technology, Second Edition, 1911-1916, 2009
2009
Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem
G Lagogiannis, C Makris, A Tsakalidis
Journal of Discrete Algorithms 4 (1), 106-141, 2006
2006
Special Issue on STOC 2002
N Alon, WF de la Vega, R Kannan, M Karpinski, S Basu, S Chien, ...
2003
Rectangle enclosure reporting in linear space revisited
G Lagogiannis, C Makris, Y Panagis, S Sioutas, K Tsichlas
Journal of Automata, Languages and Combinatorics 8 (4), 633-645, 2003
2003
Hall, Alexander, 707 Heusch, Peter, 772
CM Homan, N Alon, RS Anand, S Arora, S Basu, L Cai, M Cesati, ...
Journal of Computer and System Sciences 67, 849, 2003
2003
ON EFFICIENTLY CREATING TEMPORALLY BIASED SAMPLES OVER DATA STREAMS: BEYOND MEMORYLESS FUNCTIONS
G Lagogiannis, C Makris
ATHANASIOS TSAKALIDIS
G LAGOGIANNIS, Y PANAGIS, S SIOUTAS
The system can't perform the operation now. Try again later.
Articles 1–20