( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Formal Framework for Complex Event Processing.

, , и . ICDT, том 127 из LIPIcs, стр. 5:1-5:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

Cristian Sommariva

Cristian Chitu

Carolina Riveros Ferrada

Cristian Picioreanu

Cristian Weiss

 

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

Bounded repairability for regular tree languages., , и . ICDT, стр. 155-168. ACM, (2012)How to choose the root: centrality measures over tree structures, , и . (2021)cite arxiv:2112.13736Comment: submitted to PODS2022.Streaming Enumeration on Nested Documents., и . ICDT, том 220 из LIPIcs, стр. 19:1-19:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Efficient Enumeration for Annotated Grammars., , , и . PODS, стр. 291-300. ACM, (2022)When is approximate counting for conjunctive queries tractable?, , , и . STOC, стр. 1015-1027. ACM, (2021)Matrix Query Languages., , , , и . SIGMOD Rec., 50 (3): 6-19 (2021)The recovery of a schema mapping: bringing exchanged data back., , и . PODS, стр. 13-22. ACM, (2008)Expressive Power of Linear Algebra Query Languages., , , и . PODS, стр. 342-354. ACM, (2021)A Family of Centrality Measures for Graph Data Based on Subgraphs., и . ICDT, том 155 из LIPIcs, стр. 23:1-23:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the Expressiveness of Languages for Complex Event Recognition., , , и . ICDT, том 155 из LIPIcs, стр. 15:1-15:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)