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.

 

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

Efficient Engines for Keyword Proximity Search., и . WebDB, стр. 67-72. (2005)eLinda: Explorer for Linked Data., , , и . CoRR, (2017)The Complexity of Mining Maximal Frequent Subgraphs., и . ACM Trans. Database Syst., 39 (4): 32:1-32:33 (2014)Extracting minimum-weight tree patterns from a schema with neighborhood constraints., и . ICDT, стр. 249-260. ACM, (2013)Transducing Markov sequences., и . PODS, стр. 15-26. ACM, (2010)Dichotomies in the Complexity of Preferred Repairs., , и . PODS, стр. 3-15. ACM, (2015)Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration., , , , и . CoRR, (2019)Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries., и . NGITS, том 4032 из Lecture Notes in Computer Science, стр. 141-152. Springer, (2006)Detecting Ambiguity in Prioritized Database Repairing., , и . ICDT, том 68 из LIPIcs, стр. 17:1-17:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Recursive Programs for Document Spanners., , , и . ICDT, том 127 из LIPIcs, стр. 13:1-13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)