( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Time Efficient Indexing Scheme for Complex Spatiotemporal Retrieval

, , , и . CoRR, (2008)

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.

Konstantinos Lagogiannis

George Mertzios

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

Andrew George

George Teodoru

George Couplanad

 

Другие публикации лиц с тем же именем

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