George Lagogiannis

According to our database1, George Lagogiannis authored at least 16 papers between 1999 and 2017.

Collaborative distances :

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Query-Optimal Partially Persistent B-Trees with Constant Worst-Case Update Time.
Int. J. Found. Comput. Sci., 2017

2014
Parent Queries over Dynamic Balanced Parenthesis Strings.
Int. J. Found. Comput. Sci., 2014

2013
Indexing moving objects: A real time approach.
Comput. Sci. Inf. Syst., 2013

2012
Partially persistent B-trees with constant worst-case update time.
Computers & Electrical Engineering, 2012

Strict fibonacci heaps.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2010
Indexing Moving Objects: A Real Time Approach.
Proceedings of the Knowledge Management, Information Systems, E-Learning, and Sustainability Research, 2010

Partially Persistent B-trees with Constant Worst Case Update Time.
Proceedings of the Computer and Information Sciences, 2010

2009
A time efficient indexing scheme for complex spatiotemporal retrieval.
SIGMOD Record, 2009

2008
A Time Efficient Indexing Scheme for Complex Spatiotemporal Retrieval
CoRR, 2008

2006
Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem.
J. Discrete Algorithms, 2006

2004
Geometric Retrieval for Grid Points in the RAM Model.
J. UCS, 2004

2003
Optimal finger search trees in the pointer machine.
J. Comput. Syst. Sci., 2003

Rectangle Enclosure Reporting in Linear Space Revisited.
Journal of Automata, Languages and Combinatorics, 2003

New Dynamic Balanced Search Trees with Worst-Case Constant Update Time.
Journal of Automata, Languages and Combinatorics, 2003

2002
Optimal finger search trees in the pointer machine.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

1999
A New Algorithm for Rectangle Enclosure Reporting.
Inf. Process. Lett., 1999


  Loading...