( en | de | ru )

 

Disambiguation of "Lagogiannis, George"

Author of the publication

copydeleteadd this publication to your clipboard
Optimal finger search trees in the pointer machine.

, , , , and . J. Comput. Syst. Sci., 67 (2): 381-418 (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Konstantinos Lagogiannis

George Mertzios

Combinatorial optimization and recognition of graph classes with applications to related models. TU Aachen, (2009)

Andrew George

George Biros

George Bandlamudi

 

Other publications of authors with the same name

Indexing moving objects: A real time approach., , and . Comput. Sci. Inf. Syst., 10 (1): 173-195 (2013)On the randomness that generates biased samples: The limited randomness approach., , and . Comput. Sci. Inf. Syst., 16 (1): 205-225 (2019)Partially Persistent B-trees with Constant Worst Case Update Time., and . ISCIS, volume 62 of Lecture Notes in Electrical Engineering, page 3-6. Springer, (2010)Parent Queries over Dynamic Balanced Parenthesis Strings.. Int. J. Found. Comput. Sci., 25 (1): 25-58 (2014)Partially persistent B-trees with constant worst-case update time., and . Comput. Electr. Eng., 38 (2): 231-242 (2012)Geometric Retrieval for Grid Points in the RAM Model., , , , , , and . J. Univers. Comput. Sci., 10 (9): 1325-1353 (2004)Rectangle Enclosure Reporting in Linear Space Revisited., , , , and . Journal of Automata, Languages and Combinatorics, 8 (4): 633-645 (2003)A Time Efficient Indexing Scheme for Complex Spatiotemporal Retrieval, , , and . CoRR, (2008)Query-Optimal Partially Persistent B-Trees with Constant Worst-Case Update Time.. Int. J. Found. Comput. Sci., 28 (2): 141-170 (2017)New Dynamic Balanced Search Trees with Worst-Case Constant Update Time., , , , and . Journal of Automata, Languages and Combinatorics, 8 (4): 607-632 (2003)