From post

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.

 

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

Reachability Queries in Public Transport Networks., и . GvD, том 1594 из CEUR Workshop Proceedings, стр. 109-114. CEUR-WS.org, (2016)Statistics of RDF Store for Querying Knowledge Graphs., , , и . FoIKS, том 13388 из Lecture Notes in Computer Science, стр. 93-110. Springer, (2022)Open benchmark for filtering techniques in entity resolution., , , , , , и . VLDB J., 33 (5): 1671-1696 (сентября 2024)A Scalable Index for Top-k Subtree Similarity Queries., и . SIGMOD Conference, стр. 1624-1641. ACM, (2019)Tree edit distance: Robust and memory-efficient., и . Inf. Syst., (2016)A Relational Matrix Algebra and its Implementation in a Column Store., , и . SIGMOD Conference, стр. 2573-2587. ACM, (2020)A Roadmap towards Declarative Similarity Queries.. EDBT, стр. 509-512. OpenProceedings.org, (2018)Preserving Contextual Information in Relational Matrix Operations., , и . ICDE, стр. 1894-1897. IEEE, (2020)Speeding Up Reachability Queries in Public Transport Networks Using Graph Partitioning., , , , и . Inf. Syst. Frontiers, 24 (1): 11-29 (2022)PEL: Position-Enhanced Length Filter for Set Similarity Joins., и . Grundlagen von Datenbanken, том 1313 из CEUR Workshop Proceedings, стр. 89-94. CEUR-WS.org, (2014)